| Article ID: | iaor20051135 |
| Country: | Netherlands |
| Volume: | 131 |
| Issue: | 1 |
| Start Page Number: | 159 |
| End Page Number: | 185 |
| Publication Date: | Oct 2004 |
| Journal: | Annals of Operations Research |
| Authors: | Prins Christian, Lacomme Philippe, Ramdane-Cherif Wahiba |
| Keywords: | heuristics, networks: flow |
The Capacitated Arc Routing Problem or CARP arises in applications like waste collection or winter gritting. Metaheuristics are tools of choice for solving large instances of this NP-hard problem. The paper presents basic components that can be combined into powerful memetic algorithms (MAs) for solving an extended version of the CARP (ECARP). The best resulting MA outperforms all known heuristics on three sets of benchmark files containing in total 81 instances with up to 140 nodes and 190 edges. In particular, one open instance is broken by reaching a tight lower bound designed by Belenguer and Benavent, 26 best-known solutions are improved, and all other best-known solutions are retrieved.