Vehicle routing problem with time windows

Column Generation

Volumn , Issue , 2005, Pages 67-98

  Kallehauge, Brian ^a   Larsen, Jesper ^a   Madsen, Oli B G ^a   Solomon, Marius M ^b,c  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b NORTHEASTERN UNIVERSITY   (United States)

^c GERAD   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84889954151     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-25486-2_3     Document Type: Chapter

References (40)

1. Ascheuer, N., Fischetti, M., and Grötschel, M. (2000). Polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36:69-79.
2. Ascheuer, N., Fischetti, M., and Grötschel, M. (2001). Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming 90:475-506.
3. Balas, E., Fischetti, M., and Pulleyblank, W.R. (1995). The precedence-constrained asymmetric travelling salesman polytope. Mathematical Programming 68:241-265.
4. Bard, J., Kontoravdis, G., and Yu, G. (2002). A Branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36:250-269.
5. Chabrier, A. (2005). Vehicle routing problem with elementary shortest path based column generation. Forthcoming in: Computers and Operations Research.
6. Chabrier, A., Danna, E., and Claude Le Pape. (2002). Coopération entre génération de colonnes avec tournées sans cycle et recherche locale appliquée au routage de véhicules. In: Huitièmes Journées Nationales sur la Résolution de Problèmes NP-Complets (JNPC 2002).
7. Cook, W. and Rich, J.L. (1999). A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical report TR99-04. Department of Computational and Applied Mathematics, Rice University.
8. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., and Soumis, F. (2002). The VRP with time windows. In: The vehicle routing problem (P. Toth and D. Vigo, eds.), pp. 157-193, SIAM Monographs on Discrete Mathematics and its Applications.
9. Crowder, H. and Padberg, M. (1980). Solving large-scale symmetric travelling salesman problems to optimality. Management Science 26:495-509.
10. Danna, E. and Le Pape, C. (2005). Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. This volume.
11. Desaulniers, G., Desrosiers, J., and Solomon, M.M. (2002). Accelerating Strategies in column generation methods for vehicle routing and crew scheduling problems. In: Essays and Surveys in Metaheuristics (C. Ribeiro and P. Hansen, eds.), pp. 309-324, Kluwer Academic Publishers.
12. Desrosiers, M., Desrosiers, J., and Solomon, M.M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40:342-354.
13. Desrochers, M. and Soumis, F. (1988). A generalized permanent labelling' algorithm for the shortest path problem with time windows. INFORMS 26:191-212.
14. Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F. (1995). Time constrained routing and scheduling. In: Handbooks in Operations Research and Management Sciences (M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds.), vol. 8, Network Routing, pp. 35-139, North-Holland, Amsterdam.
15. Desrosiers, J., Sauvé, M., and Soumis, F. (1988). Lagrangean relaxation methods for solving the minimum fleet size multiple travelling-salesman problem with time windows. Management Science 34:1005-1022.
16. Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 42:977-978.
17. Dumitrescu, I., and Boland, N. (2003). Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42:135-153.
18. Fehlet, D., Dejax, P., Gendreau, M., and Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44:216-229.
19. Gélinas, S., Desrochers, M., Desrosiers, J., and Solomon, M.M. (1995). A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research 61:91-109.
20. Halse, K. (1992). Modeling and solving complex vehicle routing problems. Ph.D Thesis, Technical University of Denmark.
21. Homberger, J. and Gehring, H. (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows, INFORMS 37:297-318.
22. Ioachim, L, Gélinas, S., Desrosiers, J., and Soumis F. (1998). A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks, 31:193-204.
23. Irnich, S. and Villeneuve, D. (2005). The shortest path problem with/c-cycle elimination [k > 3): Improving a branch-and-price algorithm for the VRPTW. Forthcoming in: INFORMS Journal of Computing.
24. Jörnsten, K., Madsen, O.B.G., and S0rensen, B. (1986). Exact solution of the vehicle routing and scheduling problem with time windows by variable splitting, Research Report 5/1986, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark.
25. Kallehauge, B. (2000). Lagrangian duality and non-differentiable optimization-Applied on vehicle routing' [in Danish]. Master's Thesis, Technical University of Denmark.
26. Kallehauge, B. and Boland, N. (2004). Infeasible path inequalities for the vehicle routing problem with time windows. Technical Report, Centre for Traffic and Transport, Technical University of Denmark.
27. Kallehauge, B., Larsen, J., and Madsen, O.B.G. (2000). Lagrangean duality and non-differentiable optimization applied on routing with time windows-Experimental results. Technical Report IMM-REP-2000-8, Department of Mathematical Modelling, Technical University of Denmark.
28. Kohl, N. (1995). Exact methods for time constrained routing and related scheduling problems. Ph.D Thesis, Technical University of Denmark.
29. Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M., and Soumis, F. (1999). 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33:101-116.
30. Kohl, N. and Madsen, O.B.G. (1997). An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation. Operations Research 45:395-403.
31. Kolen, A.W.J., Rinnooy Kan, A.H.G., and Trienekens, H.W.I.M. (1987). Vehicle routing with time windows. Operations Research 35:266-273.
32. Kontoravdis, G. and Bard, J.F. (1995). A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing 7:10-23.
33. Laporte, G., Nobert, Y., and Desrochers, M. (1985). Optimal routing under capacity and distance restrictions. Operations Research 33:1050-1073.
34. Larsen, J. (1999). Parallelization of the vehicle routing problem with time windows. Ph.D Thesis, Technical University of Denmark.
35. Larsen, J. (2004). Refinements of the column generation process for the vehicle routing problem with time windows. Journal of Systems Science and Systems Engineering 13(3):326-341.
36. Mak, V.H. (2001). On the asymmetric travelling salesman problem with replenishment arcs. Ph.D Thesis, Department of Mathematics and Statistics, The University of Melbourne.
37. du Merle, 0., Villeneuve, D., Desrosiers, J., and Hansen, P. (1999). Stabilized column generation. Discrete Mathematics 199:229-237.
38. Naddef, D., and Rinaldi, G. (2002). Branch-and-cut algorithms for the capacitated VRP. In: The Vehicle Routing Problem (P. Toth and D. Vigo, eds.), SI AM Monographs on Discrete Mathematics and Applications, pp. 53-84, SIAM, Philadelphia.
39. Rousseau, L.-M., Gendreau, M., and Pesant, G. (2004). Solving VRPTWs with constraint programming based column generation. Annals of Operations Research 130:199-216.
40. Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35:254-265.