A Tabu Search Heuristic for the Capacitated arc Routing Problem

Alain Hertz, Gilbert Laporte () and Michel Mittaz
Additional contact information
Alain Hertz: Département de Mathématiques, École Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
Gilbert Laporte: École des Hautes Etudes Commerciales de Montreal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
Michel Mittaz: Département de Mathématiques, École Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland

Operations Research, 2000, vol. 48, issue 1, 129-135

Abstract: The Capacitated Arc Routing Problem arises in several contexts where streets or roads must be traversed for maintenance purposes or for the delivery of services. A tabu search is proposed for this difficult problem. On benchmark instances, it outperforms all known heuristics and often produces a proven optimum.

Keywords: Transportation:; arc; routing; problems (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (35)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.48.1.129.12455 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:48:y:2000:i:1:p:129-135

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().