A deterministic tabu search algorithm for the capacitated arc routing problem

Computers and Operations Research

Volumn 35, Issue 4, 2008, Pages 1112-1126

  Brandão, José ^a   Eglese, Richard ^b  

^a UNIVERSITY OF MINHO   (Portugal)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Arc routing; Heuristics; Tabu search

Indexed keywords

BENCHMARKING; ELECTRIC ARCS; HEURISTIC ALGORITHMS; PROBLEM SOLVING; VEHICLE ROUTING;

CAPACITATED ARC ROUTING PROBLEM (CARP); REASONABLE COMPUTING TIME;

TABU SEARCH;

EID: 35248873900     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.07.007     Document Type: Article

References (26)

1. Dror M. (Ed.). Arc routing. Theory, solutions and applications. Boston: Kluwer Academic Publishers; 2000.
2. Lacomme P., Prins C., and Ramdane-Cherif W. Evolutionary algorithms for periodic arc routing problems. European Journal of Operational Research 165 (2005) 535-553
3. Lenstra J.K., and Rinnooy Kan A.H.G. On general routing problems. Networks 6 (1976) 273-280
4. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 (1981) 305-315
5. Pearn W.L. Approximate solutions for the capacitated arc routing problem. Computers and Operations Research 16 6 (1989) 589-600
6. Pearn W.L. Augment-insert algorithms for the capacitated arc routing problem. Computers and Operations Research 18 2 (1991) 189-198
7. Hertz A., Laporte G., and Mittaz M. A tabu search heuristic for the capacitated arc routing problem. Operations Research 48 1 (2000) 129-135
8. Lacomme P., Prins C., and Ramdane-Cherif W. Competitive memetic algorithms for arc routing problems. Annals of Operational Research 131 1-4 (2004) 159-185
9. Beullens P., Muyldermans L., Cattrysse D., and Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 147 (2003) 629-643
10. Greistorfer P. A tabu search metaheuristic for the arc routing problem. Preprint. Amsterdam: Elsevier Science; 2002.
11. Hertz A., and Mittaz M. A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science 35 4 (2001) 425-434
12. Amberg A., Domschke W., and Voss S. Multiple center capacitated arc routing problems: a tabu search algorithm using capacitated trees. European Journal of Operational Research 124 (2000) 360-376
13. Baldacci R., and Maniezzo V. Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47 (2006) 52-60
14. Longo H., Poggi de Aragão M., and Uchoa E. Solving capacitated arc routing problems using a transformation to the CVRP. Computers and Operations Research 33 (2006) 1823-1837
15. Edmonds J., and Johnson E.L. Matching, Euler tours and the Chinese postman problem. Mathematical Programming 5 (1973) 88-124
16. Frederickson G.N. Approximation algorithms for some postman problems. Journal of the ACM 26 3 (1979) 538-554
17. Christofides N. Worst-case analysis of a new heuristic for the traveling salesman problem. Report No. 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh; 1976.
18. Pearn W.L., and Wu T.C. Algorithms for the rural postman problem. Computers and Operations Research 22 8 (1995) 819-828
19. Golden B.L., DeArmon J.S., and Baker E.K. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 10 1 (1983) 47-59
20. DeArmon JS. A comparison of heuristics for the capacitated Chinese postman problem. Master's thesis, University of Maryland, College Park, MD; 1981.
21. Benavent E., Campos V., Corberán E., and Mota E. The capacitated arc routing problem. Lower bounds. Networks 22 (1992) 669-690
22. Eglese R.W. Routing winter gritting vehicles. Discrete Applied Mathematics 48 3 (1994) 231-244
23. Eglese R.W., and Li L.Y.O. A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In: Osman I.H., and Kelly J.P. (Eds). Metaheuristics: theory and applications (1996), Kluwer Academic Publishers, Boston 633-650
24. Li L.Y.O., and Eglese R.W. An interactive algorithm for vehicle routing for winter-gritting. Journal of the Operational Research Society 47 (1996) 217-228
25. Belenguer J.M., and Benavent E. A cutting plane algorithm for the capacitated arc routing problem. Computers and Operations Research 30 5 (2003) 705-728
26. Ahr D. Contributions to multiple postmen problems. Ph.D. Dissertation, Ruprecht-Karls-Universität, Heidelberg; 2004.