The York Research Database
- » Research
- » York Research Database
- » Publications
- » Evaluating hyperheuristics and local search operators for periodic rou...
Evaluating hyperheuristics and local search operators for periodic routing problems
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published copy (DOI)
Author(s)
Department/unit(s)
Publication details
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Date | Published - 15 Mar 2016 |
| Pages | 104-120 |
| Number of pages | 17 |
| Publisher | Springer-Verlag |
| Volume | 9595 |
| Original language | English |
| ISBN (Print) | 9783319306971 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9595 |
| 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.
- Computational analysis, Hyperheuristic, PVRP
Research areas
Discover related content
Find related publications, people, projects, datasets and more using interactive charts.