The open capacitated arc routing problem

Computers and Operations Research

Volumn 38, Issue 11, 2011, Pages 1543-1555

  Usberti, Fábio Luiz ^a   França, Paulo Morelato ^b   França, André Luiz Morelato ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

Author keywords

Arc routing; Computational complexity; Path scanning heuristic

Indexed keywords

ARC ROUTING; CAPACITATED ARC ROUTING PROBLEM; CAPACITY CONSTRAINTS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL TESTS; INTEGER LINEAR PROGRAMMING FORMULATION; LOWER AND UPPER BOUNDS; MINIMUM COST; NP-HARD; NUMBER OF VEHICLES; OPTIMALITY; PATH-SCANNING; UNDIRECTED GRAPH;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING; SCANNING;

COMPUTATIONAL COMPLEXITY;

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

References (36)

1. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 1981 305 315
2. B.L. Golden, J.S. DeArmon, and E.K. Baker Computational experiments with algorithms for a class of routing problems Computers and Operations Research 10 1 1983 47 59 (Pubitemid 13493950)
3. L. Santos, J. Coutinho-Rodrigues, and JR. Current An improved heuristic for the capacitated arc routing problem Computers and Operations Research 36 9 2009 2632 2637
4. W.L. Pearn Augment-insert algorithms for the capacitated arc routing problem Computers and Operations Research 18 1991 189 198
5. R.W. Eglese, and L.Y.O. Li A tabu search based heuristic for arc routing with a capacity constraint and time deadline I.H. Osman, J.P. Kelly, Metaheuristics: theory and applications 1996 Kluwer
6. A. Hertz, G. Laporte, and M. Mittaz A tabu search heuristic for the capacitated arc routing problem Operations Research 48 1 2000 129 135
7. J. Brandão, and R. Eglese A deterministic tabu search algorithm for the capacitated arc routing problem Computers and Operations Research 35 2008 1112 1126 (Pubitemid 47558960)
8. P. Lacomme, C. Prins, and W. Ramdane-Chérif A genetic algorithm for the capacitated arc routing problem and its extensions E.J.W. Boers, Applications of evolutionary computing. Lecture notes in computer science 2001 Springer
9. P. Greistorfer A tabu scatter search metaheuristic for the arc routing problem Computers and Industrial Engineering 44 2003 249 266
10. 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 2003 629 643
11. A. Hertz, and M. Mittaz A variable neighborhood descent algorithm for the undirected capacitated arc routing problem Transportation Science 35 4 2001 425 434 (Pubitemid 34125359)
12. S. Wøhlk An approximation algorithm for the capacitated arc routing problem The Open Operational Research Journal 2 2008 8 12
13. R. Hirabayashi, Y. Saruwatari, and N. Nishida Tour construction algorithm for the capacitated arc routing problem Asia-Pacific Journal of Operational Research 9 1992 155 175
14. H. Longo, M.P. de Aragão, and E. Uchoa Solving capacitated arc routing problems using a transformation to the cvrp Computers and Operations Research 33 6 2006 1823 1837 (Pubitemid 41525712)
15. A. Assad, W.L. Pearn, and B.L. Golden The capacitated chinese postman problem: lower bounds and solvable cases American Journal of Mathematical and Management Science 7 1987 63 88 (Pubitemid 17616556)
16. W.L. Pearn New lower bounds for the capacitated arc routing problems Networks 18 1988 181 191
17. E. Benavent, V. Campos, A. Corberán, and E. Mota The capacitated arc routing problem: lower bounds Networks 22 1992 669 690
18. J.M. Belenguer, and E. Benavent A cutting plane algorithm for the capacitated arc routing problem Computers and Operations Research 30 2003 705 728 (Pubitemid 36178578)
19. S. Wøhlk New lower bound for the capacitated arc routing problem Computers and Operations Research 33 12 2006 3458 3472
20. J.M. Belenguer, E. Benavent, P. Lacomme, and C. Prins Lower and upper bounds for the mixed capacitated arc routing problem Computers and Operations Research 33 2006 3363 3383
21. L. Gouveia, M.C. Mourão, and L.S. Pinto Lower bounds for the mixed capacitated arc routing problem Computers and Operations Research 37 4 2010 692 699
22. H.A. Eiselt, M. Gendreau, and G. Laporte Arc routing problems, Part II: the rural postman problem Operations Research 43 3 1995 399 414
23. M. Dror Arc routing: theory, solutions and applications 1st ed 2001 Kluwer Academic Press ISBN 0792378989
24. A. Hertz Recent trends in arc routing R. Sharda, S. Voß, M.C. Golumbic, I.B.A. Hartman, Graph theory, combinatorics and algorithms 2005 Springer US
25. S. Wøhlk A decade of capacitated arc routing R. Sharda, S. Voß, B. Golden, S. Raghavan, E. Wasil, The vehicle routing problem: latest advances and new challenges vol. 43 2008 Springer US 29 48 ISBN 978-0-387-77778-8
26. A. Corberán, and C. Prins Recent results on arc routing problems: an annotated bibliography Networks 56 1 2010
27. Welz SA. Optimal solutions for the capacitated arc routing problem using integer programming. PhD thesis; University of Cincinnati, United States; 1994.
28. H.I. Stern, and M. Dror Routing electric meter readers Computers and Operations Research 6 1979 209 223
29. J. Wunderlich, M. Collette, L. Levy, and L. Bodin Scheduling meter readers for southern california gas company Interfaces 22 1992 22 30
30. L. Bodin, and L. Levy The arc oriented location routing problem INFOR 27 1989 74 94
31. L. Bodin, and L. Levy The arc partitioning problem European Journal of Operational Research 53 1991 393 401
32. L.M. Moreira, J.F. Oliveira, A.M. Gomes, and J.S. Ferreira Heuristics for a dynamic rural postman problem Computers and Operations Research 34 2007 3281 3294 (Pubitemid 46517857)
33. W.L. Pearn Approximate solutions for the capacitated arc routing problem Computers and Operations Research 16 1989 589 600
34. S. Martello, and P. Toth Knapsack problems: algorithms and computer implementations 1990 John Wiley & Sons ISBN 0-471-92420-2
35. M. Prais, and C.C. Ribeiro Reactive grasp: an application to a matrix decomposition problem in tdma traffic assignment INFORMS Journal on Computing 12 2000 164 176
36. L.Y.O. Li, and R.W. Eglese An interactive algorithm for vehicle routing for winter-gritting Journal of the Operational Research Society 47 1996 217 228 (Pubitemid 126578669)