An Improved Genetic Programming Hyper-Heuristic for the Uncertain Capacitated Arc Routing Problem
Lists
Only you see this
Abstract
This paper uses a Genetic Programming Hyper-Heuristic (GPHH) to evolve routing policies for the Uncertain Capacitated Arc Routing Problem (UCARP). Given a UCARP instance, the GPHH evolves feasible solutions in the form of decision making policies which decide the next task to serve whenever a vehicle completes its current service. Existing GPHH approaches have two drawbacks. First, they tend to generate small routes by routing through the depot and refilling prior to the vehicle being fully loaded. This usually increases the total cost of the solution. Second, existing GPHH approaches cannot control the extra repair cost incurred by a route failure, which may result in higher total cost. To address these issues, this paper proposes a new GPHH algorithm with a new No-Early-Refill filter to prevent generating small routes, and a novel Flood Fill terminal to better handle route failures. Experimental studies show that the newly proposed GPHH algorithm significantly outperforms the existing GPHH approaches on the Ugdb and Uval benchmark datasets. Further analysis has verified the effectiveness of both the new filter and terminal.
BibTeX
@inproceedings{maclachlan2018improved,
author = {Jordan MacLachlan and Yi Mei and Jürgen Branke and Mengjie Zhang},
title = {{An Improved Genetic Programming Hyper-Heuristic for the Uncertain Capacitated Arc Routing Problem}},
booktitle = {Australasian Conference on Artificial Intelligence},
year = {2018},
doi = {10.1007/978-3-030-03991-2\_40},
}Loading related content...