A cutting plane algorithm for the capacitated arc routing problem

Computers and Operations Research

Volumn 30, Issue 5, 2003, Pages 705-728

  Belenguer, José M ^a   Benavent, Enrique ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Arc routing; Lower bounds; Postman problems

Indexed keywords

APPROXIMATION THEORY; DATA ACQUISITION; HEURISTIC METHODS;

ROUTING PROBLEMS;

ALGORITHMS;

ALGORITHM;

EID: 0037393086     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00046-1     Document Type: Article

References (27)

1. Golden BL, Wong R. Capacitated arc routing problems. Networks 1981;11:305-15.
2. Hirabayashi R, Saruwatari Y, Nishida N. Tour construction algorithm for the capacitated arc routing problem. Asia-Pacific Journal of Operational Research 1992;9:155-75.
3. Kiuchi M, Shinano Y, Hirabayashi R, Saruwatari Y. 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, 1995. p. 28-9 [in Japanese].
4. Assad A, Pearn WL, Golden BL. The capacitated Chinese postman problem: lower bounds and solvable cases American Journal of Mathematical and Management Science 1987;7:63-88.
5. Pearn WL. New lower bounds for the capacitated arc routing problems. Networks 1988;18:181-91.
6. Zaw Win. Contributions to routing problems. Dissertation, Universität Augsburg, Germany, 1988.
7. Benavent E, Campos V, Corberán A, Mota E. The capacitated arc routing problem. Lower bounds. Networks 1992;22:669-90.
8. Assad A, Golden BL. Arc routing methods and applications. In: Ball MO et al., editors. Handbook on operations research and management science, vol. 8. Amsterdam: Elsevier, 1995. p.375-483.
9. Eiselt HA, Gendreau M, Laporte G. Arc routing problems, Part 1: The Chinese postman problem. Operations Research 1995;43:231-42.
10. Eiselt HA, Gendreau M, Laporte G. Arc routing problems, Part 2: The rural postman problem. Operations Research 1995;43:399-414.
11. Dror M. (ed.), Arc routing. Theory, solutions and applications. Boston: Kluwer Academic Publishers, 2000.
12. Eglese RW, Letchford A. Polyhedral theory for arc routing problems. In: Dror M, editor. Arc routing. Theory, solutions and applications. Boston: Kluwer Academic Publishers, 2000. p. 199-230.
13. Benavent E, Corberán A, Sanchis JM. Linear programming based methods for solving arc routing problems. In: Dror M, editor. Arc routing. Theory, solutions and applications. Boston: Kluwer Academic Publishers, 2000. p. 231-75.
14. Belenguer JM, Benavent E. Polyhedral results on the capacitated arc routing problem. Dep. Estadistica e Inv. Op., T.R. 1-92, Univ. de Valencia, 1992.
15. Belenguer JM, Benavent E. The capacitated are routing problem: Valid inequalities and facets Computational Optimization and Applications 1998;10:165-87.
16. Padberg MW, Rao MR. Odd minimum cut-sets and b-matchings. Mathematics of Operations Research 1982;7:67-80.
17. Harche F, Rinaldi G. The capacity inequalities for the Capacitated Vehicle Routing Problem, 1993, private communication.
18. Bertsekas DP, Tseng P. The relax codes for linear minimum cost network flow problems. Annals of Operations Research 1988;13:125-90.
19. CPLEX Optimization Inc., CPLEX Version 3.0, 1994.
20. Golden BL, DeArmon JS, Baker EK. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 1983;10:47-59.
21. Li LYO. Vehicle Routing for Winter Gritting. Dissertation, Lancaster University, UK, 1992.
22. Li LYO, Eglese RW. An Interactive Algorithm for Vehicle Routing for Winter-Gritting. Journal of the Operational Research Society 1996;47:217-28.
23. Belenguer JM, Benavent E, Cognata F. Un Metaheuristico para el Problema de Rutas por Arcos con Capacidades, talk presented at the 23th National SEIO Meeting, 1997, Valencia, Spain.
24. Hertz A, Laporte G, Mittaz M. A tabu search heuristic for the capacitated arc routing problem. Operations Research 2000;48:129-35.
25. Pearn WL. Approximate solutions for the capacitated arc routing problem. Computers and Operations Research 1989;16:589-600.
26. Lacomme P, Prins C, Ramdane-Chérif W. A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers EJW et al., editors. Applications of evolutionary computing. Lecture Notes in Computer Science, vol. 2037. Berlin: Springer, 2001. p. 473-83.
27. Coutinho-Rodrigues J, Rodrigues N, Climaco J. Solving an urban routing problem using heuristics: a successful case study. Belgian Journal of Operations Research, Statistics and Computer Science 1993;33(1,2):19-32.