Evaluating hyperheuristics and local search operators for periodic routing problems

Chen, Yujie; Mourdjis, Philip; Polack, Fiona; Cowling, Peter; Remde, Stephen

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.

Citation

Chen, Y., Mourdjis, P., Polack, F., Cowling, P., & Remde, S. Evaluating hyperheuristics and local search operators for periodic routing problems

• Presentation Conference Type: Conference Paper (published)
• Publication Date: Mar 30, 2016
• Deposit Date: Mar 17, 2023
• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Print ISSN: 0302-9743
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 9595
• Pages: 104-120
• ISBN: 9783319306971
• DOI: https://doi.org/10.1007/978-3-319-30698-8_8
• Keywords: Hyperheuristic; Computational analysis; PVRP
• Public URL: https://hull-repository.worktribe.com/output/4241606