A column generation algorithm for a rich vehicle-routing problem

Transportation Science

Volumn 43, Issue 1, 2009, Pages 56-69

  Ceselli, Alberto ^a   Righini, Giovanni ^a   Salani, Matteo ^a,b  

^a UNIVERSITY OF MILAN   (Italy)

^b EPFL   (Switzerland)

Author keywords

Column generation; Vehicle routing

Indexed keywords

COST FUNCTIONS; COSTS; DYNAMIC PROGRAMMING; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION; ROUTING ALGORITHMS; SALES; VEHICLE ROUTING; VEHICLES;

COLUMN GENERATION; DISTRIBUTION LOGISTICS; DYNAMIC PROGRAMMING ALGORITHM; EXPRESS COURIER SERVICES; OPTIMIZATION ALGORITHMS; SOFTWARE PLANNING TOOLS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

FLEET OPERATIONS;

EID: 70449913277     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1080.0256     Document Type: Article

References (36)

1. Amor, H. B. 2002. Stabilization de l'algorithme de géné ration de colonnes. Ph. D. thesis, École Polytechnique de Montréal.
2. Archetti, C., R. Mansini, M. Speranza. 2005. Complexity and reducibility of the skip delivery problem. Transportation Sci. 39(2) 182-187.
3. Archetti, C., M. Savelsbergh, M. Speranza. 2006a. An optimizationbased heuristic for the split delivery vehicle routing problem. Technical report, Department of Quantitative Methods, University of Brescia, Brescia, Italy.
4. Archetti, C., M. Savelsbergh, M. Speranza. 2006b. Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. 40(2) 226-234. (Pubitemid 43747025)
5. Baldacci, R., M. Battarra, D. Vigo. 2007. Routing a heterogeneous fleet of vehicles. B. Golden, S. Raghavan, E. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer-Verlag, Heidelberg, Germany.
6. Beasley J., N. Christofides. 1989. An algorithm for the resource constrained shortest path problem. Networks 19 379-394.
7. Ben Amor, H., J. Desrosiers, J. M. Valerio de Carvalho. 2006. Dualoptimal inequalities for stabilized column generation. Oper. Res. 54(3) 454-463.
8. Bianchessi, N., G. Righini. 2007. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. 34(2) 578-594.
9. Braeysy O., M. Gendreau. 2005a. Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Sci. 39(1) 104-118.
10. Braeysy, O., M. Gendreau. 2005b. Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Sci. 39(1) 104-118.
11. Dell'Amico, M., G. Righini, M. Salani. 2006. A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Sci. 40(2) 235-247.
12. Desaulniers, G., J. Desrosiers, M. Solomon, eds. 2005. Column Generation. GERAD 25th Anniversary Series, Springer, Heidelberg, Germany.
13. Desaulniers, G., J. Lavigne, F. Soumis. 1998. Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. 111(3) 479-494.
14. Desrochers, G., F. Soumis. 1988. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR 26 191-212.
15. Dondo, R., J. Cerdà. 2006. A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows. Internat. Trans. Oper. Res. 13(5) 441-459.
16. Dror, M. 1994. Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. 42 977-978.
17. Dror, M., P. Trudeau. 1989. Savings by split delivery routing. Transportation Sci. 23 141-145.
18. Dror, M., G. Laporte, P. Trudeau. 1994. Vehicle routing with split deliveries. Discrete Appl. Math. 50 239-254.
19. Dumas, Y., J. Desrosiers, F. Soumis. 1991. The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1) 7-22.
20. Elhallaoui, I., G. Desaulniers, A. Metrane, F. Soumis. 2008. Bi-dynamic constraint aggregation and subproblem reduction. Comput. Oper. Res. 35(5) 1713-1724.
21. Feillet, D., P. Dejax, M. Gendreau, C. Gueguen. 2004. An exact algorithm for the elementary shortest path with resource constraints: Application to some vehicle routing problems. Networks 44(3) 216-229.
22. Fukasawa, R., J. Lysgaard, M. de Aragao, M. Reis, E. Uchoa, R. Werneck. 2006. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3) 1491-511.
23. Golden, B., R. Raghavan, E. Wasil, eds. 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Heidelberg, Germany.
24. Hadjar, A., O. Marcotte, F. Soumis. 2006. A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Oper. Res. 54 130-149.
25. Ibaraki, T., M. Kubo, T. Masuda, T. Uno, M. Yagiura. 2005. Effective local search algorithms for the vehicle routing problem with general time windows. Transportation Sci. 39(2) 206-232.
26. Koskosidis, Y., W. Powell, M. Solomon. 1992. An optimizationbased heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Sci. 26 69-85.
27. Liberatore, F., G. Righini, M. Salani. 2006. A pricing algorithm for the vehicle routing problem with soft time windows. Technical Report 100, Note del Polo, Università degli Studi di Milano, Milano, Italy.
28. Ribeiro, C., F. Soumis. 1994. A column gneration approach to the multiple-depot vehicle scheduling problem. Oper. Res. 142 41-52.
29. Righini, G., M. Salani. 2008. New dynamic programming algorithms for the resource-constrained elementary shortest path problem. Networks 51 155-170.
30. Righini, G., M. Salani. 2006. Symmetry helps: Bounded bidirectional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3) 255-273.
31. Rousseau, L., M. Gendreau, D. Feillet. 2003. Interior point stabilization for column generation. Technical Report PO2003-39-X, Centre de Recherche sur les Transports, Montreal, Canada.
32. Savelsbergh, M., M. Sol. 1995. The general pickup and delivery problem. Transportation Sci. 29 17-29.
33. Solomon, M. 1983. Vehicle routing and scheduling with time windows constraints: Models and algorithms. Ph. D. thesis, University of Pennsylvania, Philadelphia.
34. Toth, P., D. Vigo, eds. 2002. The Vehicle Routing Problem. Society for Industrial and Applied Mathematics (SIAM), Philadelphia.
35. Xu, H., Z. Chen, S. Rajagopal, S. Arunapuram. 2003. Solving a practical pickup and delivery problem. Transportation Sci. 37(3) 347-364.
36. Yepes, V., J. Medina. 2006. Economic heuristic optimization for heterogeneous fleet VRPHESTW. J. Transportation Engrg. 132(4) 303-311.