A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

Operations Research Letters

Volumn 37, Issue 6, 2009, Pages 392-398

  Christiansen, Christian H ^a   Lysgaard, Jens ^a   Wøhlk, Sanne ^a  

^a AARHUS SCHOOL OF BUSINESS   (Denmark)

Author keywords

Arc Routing; Logistics; Stochastic programming

Indexed keywords

ARC ROUTING; BRANCH-AND-PRICE ALGORITHMS; CAPACITATED ARC ROUTING PROBLEM; COMPUTATIONAL RESULTS; GRAPH TRANSFORMATION; PRICING PROBLEMS; SET PARTITIONING PROBLEM; STOCHASTIC DEMAND; STOCHASTIC NATURE;

CAVITY RESONATORS; STOCHASTIC PROGRAMMING;

ROUTING ALGORITHMS;

EID: 70349802154     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2009.05.008     Document Type: Article

References (28)

1. Bertsimas D.J. A vehicle routing problem with stochastic demand. Operations Research 40 (1992) 574-585
2. 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
3. Fukasawa R., Longo H., Lysgaard J., Poggi de Aragão M., Reis M., Uchoa E., and Werneck R.F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106 (2006) 491-511
4. Christiansen C.H., and Lysgaard J. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters 35 (2007) 773-781
5. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 (1981) 305-315
6. D. Ahr, Contributions to multiple postmen problems, Ph.D. Thesis, University of Heidelberg, Germany, 2004
7. In: Dror M. (Ed). Arc Routing: Theory, Solutions and Applications (2000), Kluwer Academic Publishers, Boston
8. S. Wøhlk, Contributions to arc routing, Ph.D. Thesis, University Press of Southern Denmark, Odense, 2006
9. Wøhlk S. A decade of capacitated arc routing. In: Golden B.L., Raghavan S., and Wasil E.A. (Eds). The Vehicle Routing Problem: Latest Advances and New Challenges (2008), Springer
10. Hirabayashi R., Nishida N., and Saruwatari Y. Tour construction algorithm for the capacitated arc routing problem. Asia-Pacific Journal of Operational Research 9 (1992) 155-175
11. Baldacci R., and Maniezzo V. Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47 (2006) 52-60
12. J.M. Belenguer, E. Benavent, D. Gómez-Cabrero, Cutting plane and column generation for the capacitated arc routing problem, in: ORP3 Meeting, Valencia, 2005
13. Letchford A.N., and Oukil A. Exploiting sparsity in pricing routines for the capacitated arc routing problem. Computers & Operations Research 36 (2009) 2320-2327
14. Fleury G., Lacomme P., Prins C., and Ramdane-Chérif W. Robustness evaluation of solutions for the capacitated arc routing problem. Conference, AI Simulation and Planning in High Autonomy Systems (2002). 1-56555242-3 290-295
15. Fleury G., Lacomme P., Prins C., and Ramdane-Chérif W. Improving robustness of solutions to arc routing problems. Journal of the Operational Research Society 56 (2005) 526-538
16. Fleury G., Lacomme P., and Prins C. Evolutionary algorithms for stochastic arc routing problems. In: Raidl G.R., Rothlauf F., Smith G.D., Squillero G., Cagnoni S., Branke J., Corne D.W., Drechsler R., Jin Y., and Johnson C.G. (Eds). Applications of Evolutionary Computing (2004), Springer-Verlag, Berlin and Heidelberg 501-512
17. Lacomme P., Prins C., and Ramdane-Chérif W. Competitive memetic algorithms for arc routing problems. Parallel Computing 30 (2004) 377-387
18. Tillman F.A. The multiple terminal delivery problem with probabilistic demands. Transportation Science 3 (1969) 192-204
19. Bastian C., and Rinnooy Kan A.H.G. The stochastic vehicle routing problem revisited. European Journal of Operational Research 56 (1992) 407-412
20. Dror M., and Trudeau P. Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research 23 (1986) 228-235
21. Stewart W.R., and Golden B.L. Stochastic vehicle routing: A comprehensive approach. European Journal of Operational Research 14 (1983) 371-385
22. Dror M., Laporte G., and Trudeau P. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science 23 (1989) 166-176
23. Laporte G., Louveaux F.V., and Van Hamme L. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research 50 (2002) 415-423
24. Laporte G., and Louveaux F.V. The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters 13 (1993) 133-142
25. Secomandi N. A rollout policy for the vehicle routing problem with stochastic demands. Operations Research 49 (2001) 796-802
26. Secomandi N. Analysis of a rollout approach to sequencing problems with stochastic routing applications. Journal of Heuristics 9 (2003) 321-352
27. Yang W.H., Mathur K., and Ballou R.H. Stochastic vehicle routing problem with restocking. Transportation Science 34 (2000) 99-112
28. Gélinas S., Desrochers M., Desrosiers J., and Solomon M.M. A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research 61 (1995) 91-109