Cut-first branch-and-price-second for the capacitated arc-routing problem

Operations Research

Volumn 60, Issue 5, 2012, Pages 1167-1182

  Bode, Claudia ^a   Irnich, Stefan ^a  

^a JOHANNES GUTENBERG UNIVERSITY MAINZ   (Germany)

Author keywords

Integer programming: cutting plane and branch and price algorithm; Transportation: vehicle routing

Indexed keywords

ARC ROUTING PROBLEMS; BRANCH AND PRICE; BRANCH-AND-PRICE ALGORITHMS; CUTTING PLANES; DANTZIG-WOLFE DECOMPOSITION; EDGE FLOW; EXACT SOLUTION; INHERENT SYMMETRY; INTEGER SOLUTIONS; LOWER BOUNDS; MASTER PROGRAMS; POTENTIAL SOLUTIONS; SECOND PHASE; UNDERLYING NETWORKS;

ALGORITHMS; COSTS; INTEGER PROGRAMMING;

ITERATIVE METHODS;

EID: 84869860246     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1079     Document Type: Article

References (41)

1. Ahr D (2004) Contributions to multiple postmen problems. Ph.D. thesis, Ruprecht-Karls-Universität Heidelberg, Heidelberg, Germany.
2. Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).
3. Baldacci R, Maniezzo V (2006) Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47(1):52-60.
4. Baldacci R, Mingozzi A, Roberti R (2009) Solving the vehicle routing problem with time windows using new state space relaxation and pricing strategies. Presented at AIRO 2008, EURO 2009, ISMP 2009, and AIRO 2009.
5. Baldacci R, Bartolini E, Mingozzi A, Roberti R (2010) An exact solution framework for a broad class of vehicle routing problems. Comput. Management Sci. 7:229-268.
6. Bartolini E, Cordeau J-F, Laporte G (2011) Improved lower bounds and exact algorithm for the capacitated arc routing problem. Technical report, HEC Montréal and CIRRELT, Montreal, Quebec, Canada.
7. Belenguer JM, Benavent E (1998) The capacitated arc routing problem: Valid inequalities and facets. Comput. Optim. Appl. 10(2):165-187.
8. Belenguer JM, Benavent E (2003) A cutting plane algorithm for the capacitated arc routing problem. Comput. Oper. Res. 30:705-728.
9. Ben Amor H, Desrosiers J, de Carvalho JMV (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3): 454-463.
10. Benavent E, Campos V, Corberán A, Mota E (1992) The capacitated arc routing problem: Lower bounds. Networks 22(7):669-690.
11. Beullens P, Muyldermans L, Cattrysse D, Van Oudheusden D (2003) A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper Res. 147(3):629-643.
12. Brandão J, Eglese R (2008) A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper Res. 35(4):1112-1126.
13. Corberán A, Prins C (2010) Recent results on arc routing problems: An annotated bibliography. Networks 56(1):50-69.
14. Desaulniers G, Desrosiers J, Solomon MM, eds. (2005) Column Generation (Springer, New York).
15. Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3):387-404.
16. Dror M, ed. (2000) Arc Routing: Theory, Solutions, and Applications (Kluwer, Boston).
17. du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194:229-237.
18. Eglese RW, Li LYO (1992) Efficient routeing for winter gritting. J. Oper Res. Soc. 43(11):1031-1034.
19. Feillet D, Dejax P, Gendreau M, Guéguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216-229.
20. Fukasawa R, Longo H, Lysgaard J, Poggi de Aragão M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming, Ser A 106(3):491-511.
21. Golden BL, Wong RT (1981) Capacitated arc routing problems. Networks 11:305-315.
22. Gómez-Cabrero D, Belenguer JM, Benavent E (2005) Cutting plane and column generation for the capacitated arc routing problem. Presented at ORP3, Valencia, Spain.
23. Hertz A, Laporte G, Mittaz M (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res. 48(1):129-135.
24. Houck DJ, Picard JC, Queyranne M, Vemuganti RR (1980) The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. Opsearch 17:93-109.
25. Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 33-65.
26. Irnich S, Villeneuve D (2006) The shortest path problem with resource constraints and k-cycle elimination for k ^ 3. INFORMS J. Comput. 18(3):391-406.
27. Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res. 56(2):497-511.
28. Lacomme P, Prins C, Ramdane-Chérif W (2001) A genetic algorithm for the capacitated arc routing problem and its extensions. Boers EJW, Cagnoni S, Gottlieb J, Hart E, Luca Lanzi P, Raidl G, Smith RE, Tijink H, eds. Appl. Evolutionary Comput. EvoWorkshops2001: Evo-COP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM. Proc., LNCS, Vol. 2037 (Springer-Verlag, Berlin), 473-483.
29. Letchford AN (1997) Polyhedral results for some constrained arc-routing problems. Ph.D. thesis, Lancaster University, Lancaster, UK.
30. Letchford AN, Oukil A (2009) Exploiting sparsity in pricing routines for the capacitated arc routing problem. Comput. Oper. Res. 36(7):2320-2327.
31. Letchford AN, Reinelt G, Theis DO (2008) Odd minimum cut-sets and b-matchings revisited. SIAM J. Discrete Math. 22(4):1480-1487.
32. Longo H, de Aragão MP, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput. Oper. Res. 33(6):1823-1837.
33. Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007-1023.
34. Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423-445.
35. Martinelli R, Poggi M, Subramanian A (2011) Improved bounds for large scale capacitated arc routing problem. Working paper, Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro.
36. Pearn WL, Assad A, Golden BL (1987) Transforming arc routing into node routing problems. Comput. Oper. Res. 14(4):285-288.
37. Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J. Heuristics 14(5):405-423.
38. Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Wren A, ed. Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling, Chap. 17 (North-Holland, Amsterdam), 269-280.
39. Santos L, Coutinho-Rodrigues J, Current JR (2010) An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transportation Res. B 44(2):246-266.
40. Schrijver A (2003) Combinatorial Optimization. Polyhedra and Efficiency Algorithms and Combinatorics, No. 24 (Springer, Berlin).
41. Villeneuve D, Desaulniers G (2005) The shortest path problem with forbidden paths. Eur. J. Oper. Res. 165(1):97-107.