A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

Operations Research Letters

Volumn 35, Issue 6, 2007, Pages 773-781

  Christiansen, Christian H ^a   Lysgaard, Jens ^a  

^a AARHUS SCHOOL OF BUSINESS   (Denmark)

Author keywords

Logistics; Routing; Stochastic programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; STOCHASTIC PROGRAMMING;

CAPACITATED VEHICLE ROUTING PROBLEM; STOCHASTIC DEMANDS;

VEHICLE ROUTING;

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

References (20)

1. Bertsimas D.J. A vehicle routing problem with stochastic demand. Oper. Res. 40 (1992) 574-585
2. Christofides N., and Eilon S. An algorithm for the vehicle-dispatching problem. Oper. Res. Quart. 20 (1969) 309-318
3. Christofides N., Mingozzi A., and Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming 20 (1981) 255-282
4. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 (1964) 568-581
5. W. Cook, J.L. Rich, A parallel cutting-plane algorithm for the vehicle routing problem with time windows, Technical Report, Computational and Applied Mathematics, Rice University, 1999.
6. In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column Generation (2005), Springer, New York
7. Desrosiers J., Soumis F., and Desrochers M. Routing with time windows by column generation. Networks 14 (1984) 545-565
8. Dror M., Laporte G., and Trudeau P. Vehicle routing with stochastic demands: properties and solution frameworks. Transportation Sci. 23 (1989) 166-176
9. Dror M., and Trudeau P. Stochastic vehicle routing with modified savings algorithm. European J. Oper. Res. 23 (1986) 228-235
10. Fukasawa R., Longo H., Lysgaard J., de Aragão M.P., Reis M., Uchoa E., and Werneck R.F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106 (2006) 491-511
11. Gélinas S., Desrochers M., Desrosiers J., and Solomon M.M. A new branching strategy for time constrained routing problems with application to backhauling. Ann. Oper. Res. 61 (1995) 91-109
12. Gendreau M., Laporte G., and Ségiun R. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. 29 (1995) 143-155
13. Hadjiconstantinou E., Christofides N., and Mingozzi A. A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Ann. Oper. Res. 61 (1995) 21-43
14. Hjorring C., and Holt J. New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper. Res. 86 (1999) 569-584
15. Houck D.J., Picard J.C., Queyranne M., and Vemuganti R.R. The travelling salesman problem as a constrained shortest path problem: theory and computational experience. Opsearch 17 (1980) 93-109
16. Laporte G., and Louveaux F.V. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13 (1993) 133-142
17. Laporte G., and Louveaux F.V. Solving stochastic routing problems with the integer L-shaped method. In: Crainic T.G., and Laporte G. (Eds). Fleet Management and Logistics (1998), Kluwer Academic Publishers, USA 159-167 (Chapter 7)
18. Laporte G., Louveaux F.V., and Van Hamme L. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50 (2002) 415-423
19. In: Law A.M., and Kelton W.D. (Eds). Simulation Modeling and Analysis (2000), McGraw-Hill, Singapore
20. Tillman F.A. The multiple terminal delivery problem with probabilistic demands. Transportation Sci. 3 (1969) 192-204