Exploiting sparsity in pricing routines for the capacitated arc routing problem

Computers and Operations Research

Volumn 36, Issue 7, 2009, Pages 2320-2327

  Letchford, Adam N ^a   Oukil, Amar ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Arc routing; Branch cut and price; Column generation

Indexed keywords

CAVITY RESONATORS; COSTS;

ARC ROUTING; BRANCH-CUT-AND-PRICE; CAPACITATED ARC ROUTING PROBLEMS; COLUMN GENERATION; COMPUTATIONAL RESULTS; EXACT SOLUTIONS; SET COVERING PROBLEMS; SPARSE GRAPHS; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

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

References (29)

1. In: Dror M. (Ed). Arc routing: theory, solutions and applications (2000), Kluwer Academic Publishers, Dordrecht
2. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 (1981) 305-315
3. Ahr D. Contributions to multiple postmen problems. PhD dissertation, Department of Computer Science, Heidelberg University; 2004.
4. Wøhlk S. Contributions to arc routing. PhD dissertation, Faculty of Social Sciences, University of Southern Denmark, 2005.
5. Longo H., Poggi de Aragão M., and Uchoa E. Solving capacitated arc routing problems using a transformation to the CVRP. Computers & Operations Research 33 (2006) 1823-1837
6. Fukasawa R., Longo H., Lysgaard J., de Aragao M.P., Reis M., Uchoa E., et al. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106 (2006) 491-511
7. Pearn W.-L., Assad A., and Golden B.L. Transforming arc routing into node routing problems. Computers & Operations Research 14 (1987) 285-288
8. Letchford AN. Polyhedral results for some constrained arc routing problems. PhD dissertation, Department of Management Science, Lancaster University, 1997.
9. Dror M, Langevin A. Transformations and exact solutions for arc and node routing by column generation. In: Dror M, editor. Arc routing: theory, solutions and applications. Dordrecht: Kluwer Academic Publishers; 2000.
10. Baldacci R., and Maniezzo V. Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47 (2006) 52-60
11. Lysgaard J., Letchford A.N., and Eglese R.W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100 (2004) 423-445
12. Labbé M., Laporte G., and Mercure H. Capacitated vehicle routing on trees. Operation Research 39 (1991) 616-622
13. Welz SA. Optimal solutions for the capacitated arc routing problem using integer programming. PhD dissertation, Department of QT and OM, University of Cincinnati, 1994.
14. Belenguer J.M., and Benavent E. The capacitated arc routing problem: valid inequalities and facets. Computational Optimization and Applications 10 (1998) 165-187
15. Ghiani G, Laganá D, Laporte G, Musmanno R. A branch-and-cut algorithm for the capacitated arc routing problem. Working paper, 2007.
16. Fleischmann B. Linear programming approaches to traveling salesman and vehicle scheduling problems. Presented at the XIth International Symposium on Mathematical Programming, Bonn, 1982.
17. Belenguer J.M., and Benavent E. A cutting plane algorithm for the capacitated arc routing problem. Computers & Operations Research 30 (2003) 705-728
18. Gómez-Cabrero D, Belenguer JM, Benavent E. Cutting plane and column generation for the capacitated arc routing problem. Presented at ORP3, Valencia, 2005.
19. Bramel J., and Simchi-Levi D. Set-covering-based algorithms for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2002), SIAM Publications, Philadelphia, PA
20. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34 (1987) 596-615
21. Irnich S., and Villeneuve D. The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS Journal of Computers 18 (2006) 391-406
22. Gouveia L. A result on projection for the vehicle routing problem. European Journal of Operational Research 85 (1995) 610-624
23. Golden B.L., De Armon J.S., and Baker E.K. Computational experiments with algorithms for a class of routing problems. Computers & Operations Research 10 (1983) 47-59
24. Benavent E., Campos V., Corberán A., and Mota E. The capacitated arc routing problem: lower bounds. Networks 22 (1992) 669-690
25. Kiuchi M, Shinano Y, Hirabayashi R, Saruwatari Y. An exact algorithm for the capacitated arc routing problem using parallel branch and bound method. Presented at the 1995 Spring National Conference of the Operational Research Society of Japan, 1995.
26. Li LYO. Vehicle routing for winter gritting. PhD dissertation, Department of Management Science, Lancaster University, 1992.
27. Li L.Y.O., and Eglese R.W. An interactive algorithm for vehicle routing for winter-gritting. Journal of Operational Research Society 47 (1996) 217-228
28. Brandão J., and Eglese R.W. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35 (2008) 1112-1126
29. du Merle O., Villeneuve D., Desrosiers J., and Hansen P. Stabilized column generation. Discrete Mathematics 194 (1999) 229-237