A guided local search heuristic for the capacitated arc routing problem

Beullens, Patrick, Muyldermans, Luc, Cattrysse, Dirk and Van Oudheusden, Dirk (2002) A guided local search heuristic for the capacitated arc routing problem European Journal of Operational Research, 147, (3), pp. 629-643. (doi:10.1016/S0377-2217(02)00334-X).


Full text not available from this repository.


This paper presents a new local search algorithm for the capacitated arc routing problem (CARP). The procedure uses single vehicle moves and moves that operate on two routes, both derived from a node routing context but properly adapted to work well for arc routing problems. We combine the algorithm with the meta-heuristic guided local search and further use the mechanisms of neighbor lists and edge marking to improve the solution quality and to save computation time. Experiments on standard benchmark problems from the literature show that our algorithm outperforms the existing heuristics for the CARP. On a set of new test problems, the local search approach consistently produces high quality solutions and often detects an optimal solution within limited computation time

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/S0377-2217(02)00334-X
ISSNs: 0377-2217 (print)
Keywords: routing, capacitated arc routing problem, local search
Organisations: Operational Research
ePrint ID: 205863
Date :
Date Event
28 May 2002e-pub ahead of print
16 June 2003Published
Date Deposited: 14 Dec 2011 14:47
Last Modified: 18 Apr 2017 01:04
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/205863

Actions (login required)

View Item View Item