By the same authors

Evaluating hyperheuristics and local search operators for periodic routing problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DatePublished - 15 Mar 2016
Pages104-120
Number of pages17
PublisherSpringer-Verlag
Volume9595
Original languageEnglish
ISBN (Print)9783319306971

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9595
ISSN (Print)03029743
ISSN (Electronic)16113349

Abstract

Meta-heuristics and hybrid heuristic approaches have been successfully applied to Periodic Vehicle Routing Problems (PVRPs). However, to be competitive, these methods require careful design of specific search strategies for each problem. By contrast, hyperheuristics use the performance of low level heuristics to automatically select and tailor search strategies. Hyperheuristics have been successfully applied to problem domains such as timetabling and production scheduling. In this study, we present a comprehensive analysis of hyperheuristic approaches to solving PVRPs. The performance of hyperheuristics is compared to published performance of state-of-the-art meta-heuristics.

    Research areas

  • Computational analysis, Hyperheuristic, PVRP

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations