A tabu search heuristic for the capacitated arc routing problem

Authors
Hertz, A Laporte, G Mittaz, M
Citation
A. Hertz et al., A tabu search heuristic for the capacitated arc routing problem, OPERAT RES, 48(1), 2000, pp. 129-135
Citations number
27
Categorie Soggetti
Engineering Mathematics
Journal title
OPERATIONS RESEARCH
ISSN journal
0030364X → ACNP
Volume
48
Issue
1
Year of publication
2000
Pages
129 - 135
Database
ISI
SICI code
0030-364X(200001/02)48:1<129:ATSHFT>2.0.ZU;2-E
Abstract
The Capacitated Are Routing Problem arises in several contexts where street s or roads must be traversed for maintenance purposes or for the delivery o f services. A tabu search is proposed for this difficult problem. On benchm ark instances, it outperforms all known heuristics and often produces a pro ven optimum.