A guided local search heuristic for the capacitated arc routing problem

European Journal of Operational Research

Volumn 147, Issue 3, 2003, Pages 629-643

  Beullens, Patrick ^a   Muyldermans, Luc ^a   Cattrysse, Dirk ^a   Van Oudheusden, Dirk ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Capacitated arc routing problem; Local search; Routing

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY;

ROUTING PROBLEMS;

OPERATIONS RESEARCH;

EID: 0037449219     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00334-X     Document Type: Article

References (30)

1. Amberg A., Domschke W., Voss S. Multiple center capacitated arc routing problems: A Tabu search algorithm using capacitated trees. European Journal of Operational Research. 124:2000;360-376.
2. Assad A.A., Golden B.L. Arc routing methods and applications. Ball M.O., Magnanti T.L., Monma C.L., Nemhauser G.L. Network Routing, Handbooks in Operations Research and Management Science. 1995;375-483 North-Holland, Amsterdam, The Netherlands.
3. Belenguer J.M., Benavent E. The capacitated arc routing problem: Valid inequalities and facets. Computational Optimization and Applications. 10:1998;165-187.
4. Belenguer, J.M., Benavent, E., 2000. A Cutting Plane Algorithm for the Capacitated Arc Routing Problem. Working paper, Departemento de Estadística e Investigación Operativa, Universidad de Valencia.
5. Benavent, E., 1997. ftp://indurain.estadi.uv.es/pub/CARP.
6. Benavent E., Campos V., Corberán A., Mota E. The capacitated arc routing problem. Lower bounds. Networks. 22:1992;669-690.
7. Benavent E., Corberán A., Sanchis J.M. Linear programming based methods for solving arc routing problems. Dror M. Arc Routing: Theory, Solutions and Applications. 2000;231-275 Kluwer Academic Publishers, Dordrecht, The Netherlands.
8. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing. 4:1992;387-411.
9. Croes G.A. A method for solving traveling salesman problems. Operations Research. 6:1958;791-812.
10. Dror M. Arc Routing: Theory, Solutions and Applications. 2000;Kluwer Academic Publishers, Dordrecht, The Netherlands.
11. Eglese R.W. Routing winter gritting vehicles. Discrete Applied Mathematics. 48:1994;231-244.
12. Eglese, R.W., Li, L.Y.O., 1994. Modeling Issues in Arc Routing. In: Paper presented at EURO XIII/OR36, Glasgow, Scotland.
13. Eiselt H.A., Gendreau M., Laporte G. Arc routing problems, Part II: The rural postman problem. Operations Research. 43:1995;399-414.
14. Gendreau M., Hertz A., Laporte G. A Tabu search heuristic for the vehicle routing problem. Management Science. 40:1994;1276-1290.
15. Golden B.L., Wong R.T. Capacitated arc routing problems. Networks. 11:1981;305-315.
16. Golden B.L., DeArmon J.S., Baker E.K. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research. 10:1983;47-59.
17. Greistorfer P. Computational experiments with heuristics for a capacitated arc routing problem. Operations Research Proceedings 1994. 1994;185-190 Physica-Verlag, Wurzburg.
18. Greistorfer, P., 2000. Tabu scatter search metaheuristic for the arc routing problem. Applied Intelligence (in press).
19. Hertz A., Laporte G., Mittaz M. A Tabu search heuristic for the capacitated arc routing problem. Operations Research. 48:2000;129-135.
20. Hertz A., Laporte G., Nanchen Hugo P. Improvement procedures for the undirected rural postman problem. INFORMS Journal on Computing. 11:1999;53-62.
21. Hirabayashi R., Saruwatari Y., Nishida N. Tour construction algorithm for the capacitated arc routing problem. Asia-Pacific Journal of Operational Research. 9:1992;155-175.
22. Johnson D.S., McGeoch L.A. The traveling salesman problem: A case study. Aarts E., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;215-310 John Wiley and Sons, Chichester.
23. Kilby P., Prosser P., Shaw P. Guided local search for the vehicle routing problem. Voss S., Martello S., Osman H., Roucairol C. Meta Heuristics: Advances and Trends in Local Search Paradigms for Optimization. 1999;473-486 Kluwer Academic Publishers, Boston.
24. Kiushi, M., Shinano, Y., Hirabayashi, R., Saruwatari, Y., 1995. An exact algorithm for the capacitated arc routing problem using parallel branch and bound method. Abstracts of the 1995 Spring National Conference of the Operational Research Society of Japan, pp. 28-29.
25. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal. 44:1965;2245-2269.
26. Muyldermans, L., Beullens, P., Cattrysse, D., Van Oudheusden, D., 2001a. The k -opt approach for the general routing problem. Working paper 01/18, Center for Industrial Management, Katholieke Universiteit Leuven.
27. Muyldermans, L., Cattrysse, D., Van Oudheusden, D., 2001b. Evaluation of districting procedures for arc routing. Talk presented at EURO XVIII, Rotterdam, The Netherlands.
28. Savelsbergh, M.W.P., 1988. Computer aided routing. PhD Thesis. Centrum voor Wiskunde en Informatica, Amsterdam.
29. Voudouris, C., Tsang, E., 1996. Partial constraint satisfaction problems and guided local search. In: Proceedings of the Second International Conference on Practical Application of Constraint Technology (PACT'96), London, pp. 337-356.
30. Voudouris C., Tsang E. Guided local search and its application to the traveling salesman problem. European Journal of Operational Research. 113:1999;469-499.