Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems
Jordan MacLachlan, Yi Mei, Juergen Branke, Mengjie Zhang

TL;DR
This paper introduces a novel genetic programming hyper-heuristic with vehicle collaboration for uncertain capacitated arc routing problems, significantly improving solution quality in uncertain, multi-vehicle routing scenarios.
Contribution
It proposes a new collaborative solution construction procedure and a GP-evolved routing policy specifically designed for UCARP, addressing vehicle collaboration under uncertainty.
Findings
Outperforms state-of-the-art algorithms on benchmark problems.
Shows greater benefits on larger task and vehicle instances.
Demonstrates vehicle collaboration effectively handles uncertainty.
Abstract
Due to its direct relevance to post-disaster operations, meter reading and civil refuse collection, the Uncertain Capacitated Arc Routing Problem (UCARP) is an important optimisation problem. Stochastic models are critical to study as they more accurately represent the real-world than their deterministic counterparts. Although there have been extensive studies in solving routing problems under uncertainty, very few have considered UCARP, and none consider collaboration between vehicles to handle the negative effects of uncertainty. This paper proposes a novel Solution Construction Procedure (SCP) that generates solutions to UCARP within a collaborative, multi-vehicle framework. It consists of two types of collaborative activities: one when a vehicle unexpectedly expends capacity (\emph{route failure}), and the other during the refill process. Then, we propose a Genetic Programming…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsTest
