Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research

Volumn 33, Issue 6, 2006, Pages 1823-1837

  Longo, Humberto ^a   De Aragão, Marcus Poggi ^b   Uchoa, Eduardo ^c  

^a FEDERAL UNIVERSITY OF GOIÁS   (Brazil)

^b PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Arc routing; Mixed integer programming

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPHIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; ROUTERS;

ARC ROUTING; BRANCH-AND-CUT-AND-PRICE ALGORITHM; CAPACITATED ARC ROUTING PROBLEM (CARP); MIXED-INTEGER PROGRAMMING;

PROBLEM SOLVING;

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

References (34)

1. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 1981 305 315
2. M. Dror Arc routing theory, solutions and applications 2000 Kluwer Academic Publishers Dordrecht
3. E.K. Baker, J.S. DeArmon, and B.L. Golden Computational experiments with algorithms for a class of routing problems Computers and Operations Research 10 1 1983 47 59
4. L. Chapleau, J.A. Ferland, G. Lapalme, and J.-M. Rousseau A parallel insert method for the capacitated arc routing problem Operations Research Letters 3 2 1984 95 99
5. G. Ulusoy The Zeet size and mix problem for capacitated arc routing European Journal of Operational Research 22 3 1985 329 337
6. W.-L. Pearn Approximate solutions for the capacitated arc routing problem Computers and Operations Research 16 6 1989 589 600
7. W.-L. Pearn Argument-insert algorithms for the capacitated arc routing problem Computers and Operations Research 18 2 1991 189 198
8. A. Hertz, G. Laporte, and M. Mittaz A tabu search heuristic for the capacitated arc routing problem Operations Research 48 1 2000 129 135
9. Assad AA, Golden BL. Arc routing methods and applications. In: Ball MG, Magnanti TL, Monma CL, Nemhauser GL, editors. Network routing, handbooks in operations research and management science, vol. 8. Amsterdam: Elsevier; 1995. p. 375-483 [chapter 5].
10. H.A. Eiselt, M. Gendreau, and G. Laporte Arc routing problems II the rural postman problem Operations Research 43 3 1995 339 414
11. R. Hirabayashi, N. Nishida, and Y. Saruwatari Node dublication lower bounds for the capacitated arc routing problems Journal of the Operations Research Society of Japan 35 2 1992 119 133
12. Kiuchi M, Shinano Y, Hirabayashi R, Saruwatari Y. An exact algorithm for the capacitated arc routing problem using parallel branch and bound method. In: Abstracts of the 1995 spring national conference of the Operational Research Society of Japan. 1995. p. 28-9 [in Japanese].
13. Welz SA. Optimal solutions for the capacitated arc routing problem using integer programming. PhD Thesis, Department of QT and OM, University of Cincinnati; 1994.
14. J.M. Belenguer, and E. Benavent The capacitated arc routing problem valid inequalities and facets Computational Optimization and Applications 10 2 1998 165 187
15. A.A. Assad, B.L. Golden, and W. Pearn The capacitated Chinese postman problem lower bounds and solvable cases American Journal of Mathematics and Management Science 7 1,2 1987 63 88
16. W.-L. Pearn New lower bounds for the capacitated arc routing problem Networks 18 1988 181 191
17. E. Benavent, V. Campos, A. Corberan, and E. Mota The capacitated arc routing problem lower bounds Networks 22 1992 669 690
18. Amberg A, Voß S. A hierarquical relaxations lower bound for the capacitated arc routing problem. In: Proceedings of the 35th annual Hawaii international conference on system sciences; 2002.
19. Whlk S. New lower bound for the capacitated arc routing problem. Preprint PP-2003-15, University of Southern Denmark, IMADA - Department of Mathematics and Computer Science, 2003.
20. Belenguer JM, Benavent E. A cutting plane algorithm for the capacitated arc routing problem. Computers and Operations Research 2003; 705-28.
21. W.L. Pearn, A. Assad, and B.L. Golden Transforming arc routing into node routing problems Computers and Operations Research 14 4 1987 285 288
22. Augerat P, Belenguer J, Benavent E, Corberán A, Naddef D, Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical report 949-M, Université Joseph Fourier, Grenoble, France; 1995.
23. Blasum U, Hochstättler W. Application of the branch and cut method to the vehicle routing problem. Technical report ZPR2000-386, Zentrum fur Angewandte Informatik Köln; 2000.
24. J. Lysgaard, A. Letchford, and R. Eglese A new branch-and-cut algorithm for the capacitated vehicle routing problem Mathematical Programming 100 2 2004 423 445
25. Wenger KM. Generic cut generation methods for routing problems. PhD Thesis, Institute of Computer Science, University of Heidelberg; 2003.
26. T. Ralphs, L. Kopman, W. Pulleyblank, and L. Trotter Jr On the capacitated vehicle routing problem Mathematical Programming 94 2003 343 359
27. Fukasawa R, Lysgaard J, Poggi de Aragão M, Reis M, Uchoa E, Werneck RF. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In: Proceedings of the X IPCO, Lecture Notes in Computer Science, vol. 3064, New York; June 2004. pp. 1-15.
28. N. Christofides, A. Mingozzi, and P. Toth Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations Mathematical Programming 20 1981 255 282
29. D. Naddef, and G. Rinaldi Branch-and-cut algorithms for the capacitated VRP P. Toth D. Vigo The vehicle routing problem 2002 SIAM Philadelphia 53 84 [chapter 3]
30. Irnich S, Villeneuve D. The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS Journal on Computing 2004, to appear.
31. Lysgaard J. CVRPSEP: a package of separation routines for the capacitated vehicle routing problem; 2003. Available at www.asb.dk/ ∼ lys.
32. DeArmon JS. A comparison of heuristics for the capacitated Chinese postman problem. Master's Thesis, University of Maryland, Colledge Park, MD; 1981.
33. Li LYO. Vehicle routeing for winter gritting. PhD Thesis, Department of Management Science, Lancaster University; 1992.
34. L.Y.O. Li, and R.W. Eglese An interactive algorithm for vehicle routeing for winter-gritting Journal of the Operational Research Society 47 1996 217 228