Improved bounds for large scale capacitated arc routing problem

Computers and Operations Research

Volumn 40, Issue 8, 2013, Pages 2145-2160

  Martinelli, Rafael ^a   Poggi, Marcus ^a   Subramanian, Anand ^b  

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

^b FEDERAL UNIVERSITY OF PARAÍBA   (Brazil)

Author keywords

Arc routing; Capacity cuts; Dual ascent; Integer programming; Iterated local search

Indexed keywords

ARC ROUTING; CAPACITATED ARC ROUTING PROBLEM; CAPACITATED VEHICLE ROUTING PROBLEM; CAPACITY CUTS; COMPUTATIONAL EXPERIMENT; DUAL ASCENT; ITERATED LOCAL SEARCH; LOWER AND UPPER BOUNDS;

INTEGER PROGRAMMING;

EXPERIMENTS;

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

References (35)

1. Wøhlk S. Contributions to arc routing. PhD thesis. Faculty of Social Sciences, University of Southern Denmark; 2005.
2. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 1981 305 315
3. J.M. Belenguer, and E. Benavent A cutting plane algorithm for the capacitated arc routing problem Computers & Operations Research 30 2003 705 728
4. Ahr D. Contributions to multiple postmen problems. PhD thesis. Department of Computer Science, Heidelberg University; 2004.
5. Li Lyo. Vehicle routeing for winter gritting. PhD thesis. Department of Management Science, Lancaster University; 1992.
6. 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
7. Bartolini E, Cordeau JF, Laporte G. Improved lower bounds and exact algorithm for the capacitated arc routing problem. Technical Report CIRRELT-2011-33, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation; 2011.
8. Bode C, Irnich S. Cut-first branch-and-price-second for the capacitated arc routing problem. Technical Report LM-2011-01, Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz, Germany; 2011.
9. R. Martinelli, D. Pecin, M. Poggi, and H. Longo A branch-cut-and-price algorithm for the capacitated arc routing problem P. Pardalos, S. Rebennack, Experimental algorithms. Lecture notes in computer science vol. 6630 2011 Springer Berlin/Heidelberg 315 326
10. J. Brandão, and R. Eglese A deterministic tabu search algorithm for the capacitated arc routing problem Computers & Operations Research 35 2008 1112 1126
11. B.L. Golden, J.S. DeArmon, and E.K. Baker Computational experiments with algorithms for a class of routing problems Computers & Operations Research 10 1 1983 47 59
12. Y. Mei, K. Tang, and X. Yao A global repair operator for capacitated arc routing problem IEEE Transactions on Systems, Man and Cybernetics 39 3 2009 723 734
13. A. Letchford, and A. Oukil Exploiting sparsity in pricing routines for the capacitated arc routing problem Computers & Operations Research 36 2009 2320 2327
14. M.W. Padberg, and M.R. Rao Odd minimum cut-sets and b-matchings Mathematics of Operations Research 7 1982 67 80
15. R.E. Gomory, and T.C. Hu Multi-terminal network flows Journal of the Society for Industrial and Applied Mathematics 9 4 1961 551 570
16. J. Edmonds, and R.M. Karp Theoretical improvements in algorithmic efficiency for network flow problems Journal of the ACM 19 1972 248 264
17. R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Arag ao, M. Reis, and E. Uchoa Robust branch-and-cut-and-price for the capacitated vehicle routing problem Mathematical Programming 106 3 2006 491 511
18. M. Fischetti, and A. Lodi Optimizing over the first chvátal closure Mathematical Programming 110 2007 3 20
19. R. Wong A dual ascent approach for steiner tree problems on a directed graph Mathematical Programming 28 1984 271 287
20. J.B. Kruskal Jr. On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society 7 1 1956 48 50
21. H.R. Lourenço, O.C. Martin, and T. Stützle Handbook of metaheuristics, iterated local search 2003 Kluwer Academic Publishers Chap. p. 321-53
22. Penna PHV, Subramanian A, Ochi LS. An iterated local search heuristic for the heterogenous fleet vehicle routing problem. Journal of Heuristics; 2011; http://dx.doi.org/10.1007/s10732-011-9186-y. In press
23. W.L. Pearn, A. Assad, and B.L. Golden Transforming arc routing into node routing problems Computers & Operations Research 14 4 1987 285 288
24. H. Longo, M. Poggi de Aragão, and E. Uchoa Solving capacitated arc routing problems using a transformation to the CVRP Computers & Operations Research 33 2006 1823 1827
25. R. Baldacci, and V. Maniezzo Exact methods based on node-routing formulations for undirected arc-routing problems Networks 47 1 2006 52 60
26. N. Mladenović, and P. Hansen Variable neighborhood search Computers & Operations Research 24 11 1997 1097 1100
27. A. Subramanian, L. Drummond, C. Bentes, L. Ochi, and R. Farias A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery Computers & Operations Research 37 11 2010 1899 1911
28. 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].
29. DeArmon JS. A comparison of heuristics for the capacitated Chinese postman problem. Master's thesis. University of Maryland, College Park, MD; 1981.
30. E. Benavent, V. Campos, A. Corberan, and E. Mota The capacitated arc routing problem lower bounds Networks 22 1992 669 690
31. P. Beullens, L. Muyldermans, D. Cattrysse, and D.V. Oudheusden A guided local search heuristic for the capacitated arc routing problem European Journal of Operational Research 147 3 2003 629 643
32. M. Polacek, K. Doerner, R. Hartl, and V. Maniezzo A variable neighborhood search for the capacitated arc routing problem with intermediate facilities Journal of Heuristics 14 2008 405 423
33. K. Tang, Y. Mei, and X. Yao Memetic algorithm with extended neighborhood search for capacitated arc routing problems Transactions on Evolutionary Computation 13 5 2009 1151 1166
34. L. Santos, J. Coutinho-Rodrigues, and J. Current An improved ant colony optimization based algorithm for the capacitated arc routing problem Transportation Research Part B 44 2 2010 246 266
35. Usberti FL, França PM, França ALM. Grasp with evolutionary path-relinking for the capacitated arc routing problem. Computers and Operations Research; 2011 10.1016/j.cor.2011.10.014