Tabu search heuristic for the capacitated arc routing problem

Operations Research

Volumn 48, Issue 1, 2000, Pages 129-135

  Hertz, Alain ^a   Laporte, Gilbert ^b   Mittaz, Michel ^a  

^a EPFL   (Switzerland)

^b HEC MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; ROADS AND STREETS; SET THEORY; TRANSPORTATION ROUTES;

CAPACITATED ARC ROUTING PROBLEM; TABU SEARCH;

OPERATIONS RESEARCH;

EID: 0033718405     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.1.129.12455     Document Type: Article

References (28)

1. Assad, A. A., W.-L. Pearn, B.L. Golden. 1987. The capacitated Chinese postman problem: Lower bounds and solvable cases. Amer. J. Math. and Management Sci. 7 63-88.
2. Belenguer, J. M. 1990. El poliedro del problema de rutas por arcos con capacidades. Ph.D. Thesis, Universidad de Valencia, Spain.
3. _, E. Benavent. 1991. Polyhedral results on the capacitated arc routing problem. Working Paper, Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain.
4. _, _. 1997. A cutting plane algorithm for the capacitated arc routing problem. Unpublished manuscript.
5. Benavent, E. 1997. ftp://indurain.estadi.uv.es/pub/CARP.
6. _, V. Campos, A. Corberán, E. Mota. 1992. The capacitated arc routing problem: lower bounds. Networks 22 669-690.
7. Chapleau, L., J. A. Ferland, G. Lapalme, J.-M. Rousseau. 1984. A parallel insert method for the capacitated arc routing problem. Oper. Res. Letters 3 95-99.
8. Christofides, N. 1973. The optimum traversal of a graph. Omega 1 719-732.
9. DeArmon, J. S. 1981. A Comparison of Heuristics for the Capacitated Chinese Postman Problem. Master's Thesis, University of Maryland, College Park, MD.
10. Eglese, R. W. 1994. Routing winter gritting vehicles. Discrete Appl. Math. 48 231-244.
11. Eiselt, H. A., M. Gendreau, G. Laporte. 1995. Arc routing problems, part II: the rural postman problem. Oper. Res. 43 399-414.
12. Frederickson, G. N. 1979. Approximation algorithms for some postman problems. J. ACM 26 538-554.
13. Gendreau, M., A. Hertz, G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Sci. 40 1276-1290.
14. Golden, B. L., R. T. Wong. 1981. Capacitated arc routing problems. Networks 11 305-315.
15. _, J. S. DeArmon, E K. Baker. 1983. Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10 47-59.
16. Greistorfer, P. 1994. Computational experiments with heuristics for a capacitated arc routing problem. Working Paper 32, Department of Business, University of Graz, Graz, Austria.
17. Hertz, A., G. Laporte, M. Mittaz. 1997. A tabu search heuristic for the capacitated arc routing problem. Publication CRT-97-03, Centre for Research on Transportation, Montreal, Canada.
18. _, _, P. Nanchen-Hugo. 1999. Improvement procedures for the undirected rural postman problem. INFORMS J. on Computing 11 53-62.
19. Hirabayashi, R., Y. Saruwatari, N. Nishida. 1992. Tour construction algorithm for the capacitated arc routing problem. Asia-Pacific J. Oper. Res. 9 155-175.
20. Lenstra, J. K., A. H. G. Rinnooy Kan. 1976. On general routing problems. Networks 6 273-280.
21. Li, L. Y. O. 1992. Vehicle Routing for Winter Gritting. Ph.D. Dissertation, Department of OR & OM, Lancaster University, Lancaster, UK.
22. Martello, S., P. Toth. 1990. Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28 59-70.
23. Pearn, W.-L. 1988. New lower bounds for the capacitated arc routing problem. Networks 18 181-191.
24. _. 1989. Approximate solutions for the capacitated arc routing problem. Comput. Oper. Res. 16 589-600.
25. _. 1991. Augment-insert algorithms for the capacitated arc routing problem. Comput. Oper. Res. 18 189-198.
26. Ulusoy, G. 1985. The fleet size and mix problem for capacitated arc routing. Euro. J. Oper. Res. 22 329-337.
27. Win, Z. 1987. Contribution to Routing Problems. Ph.D. Dissertation, University of Augsburg, Augsburg, Germany.
28. _. 1989. On the windy postman problem on Eulerian graphs. Math. Programming 44 97-112.