A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows

Transportation Research Part C: Emerging Technologies

Volumn 19, Issue 5, 2011, Pages 723-740

  Bettinelli, Andrea ^a   Ceselli, Alberto ^a   Righini, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Column generation; Cutting planes; Vehicle routing

Indexed keywords

COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

BRANCH-AND-CUT-AND-PRICE ALGORITHM; COLUMN GENERATION; COMPUTATIONAL RESULTS; CUTTING PLANES; EXPERIMENTAL EVALUATION; HETEROGENEOUS VEHICLES; TRANSPORTATION FLEET; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

FLEET OPERATIONS;

ALGORITHM; HEURISTICS; OPTIMIZATION; ROUTING; TRANSPORTATION PLANNING; NUMERICAL MODEL; ROAD PRICING; TRANSPORTATION SYSTEM;

EID: 79955967127     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2010.07.008     Document Type: Article

References (38)

1. Achterberg, T., 2007. Constraint Integer Programming. PhD thesis, Technische Universität Berlin.
2. Baldacci R., Christofides N., Mingozzi A. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming 2007, 115:351-385.
3. Baldacci R., Mingozzi A. A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming 2009, 120(2):347-380.
4. Belfiore P.P., Fávero L.P.L. Scatter search for the fleet size and mix vehicle routing problem with time windows. Central European Journal of Operations Research 2007, 15:351-368.
5. Timo Berthold, 2006. Primal Heuristics for Mixed Integer Programs. Master's thesis, Technische Universität Berlin.
6. Bettinelli, A., Ceselli, A., Righini, G., 2009. A Branch-and-price Algorithm for the Multi-depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows, AIRO Winter.
7. Ceselli A., Righini G., Salani M. A column generation algorithm for a rich vehicle-routing problem. Transportation Science 2009, 43(1):56-69.
8. Chabrier A. Vehicle routing problem with elementary shortest path based column generation. Computers and Operations Research 2006, 33(10):2972-2990.
9. Christofides N., Mingozzi A., Toth P. State-space relaxation procedures for the computation of bounds to routing problems. Networks 1981, 11:145-164.
10. Cordeau J.F., Laporte G., Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 2001, 52:928-936.
11. Dell'Amico M., Monaci M., Pagani C., Vigo D. Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transportation Science 2007, 41(4):516-526.
12. Desaulniers G., Desrosiers J., Solomon M.M. Column Generation 2005, Springer.
13. Dondo R., Cerdá J. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research 2007, 176:1478-1507.
14. Dondo R., Cerdá J. A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Computers & Chemical Engineering. 2009, 33(2):513-530.
15. Dongarra, J.J., 2009. Performance of Various Computers using Standard Linear Equations Software. Technical Report, University of Tennessee. http://www.netlib.org/benchmark/performance.ps.
16. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 1994, 42:977-978.
17. Dullaert W., Janssens G.K., Sorensen K., Vernimmen B. New heuristics for the fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society 2002, 53:1232-1238.
18. Dumas Y., Desrosiers J., Gelinas E., Solomon M.M. An optimal algorithm for the travelling salesman problem with time windows. Operations Research 1994, 42:626-642.
19. Feillet D., Dejax P., Gendreau M., Gueguen C. An exact algorithm for the elementary shortest path with resource constraints: application to some vehicle routing problems. Networks 2004, 44:216-229.
20. Fukasawa R., Longo H., Lysgaard J., Poggi de Aragão M., Reis M., Uchoa E., Werneck R.F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 2006, 106:491-511.
21. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
22. Golden B.L., Assad A., Levy L., Gheysens F. The fleet size and mix vehicle routing problem. Computers and Operations Research 1984, 11:49-65.
23. Kallehauge B. Formulations and exact algorithms for the vehicle routing problem with time windows. Computers and Operations Research 2008, 35(7):2307-2330.
24. Kallehauge B., Boland N., Madsen O.B.G. Path inequalities for the vehicle routing problem with time windows. Networks 2007, 49(4):273-293.
25. Kellerer H., Pferschy U., Pisinger D. Knapsack Problems 2005, Springer Verlag.
26. Kohl N., Desrosiers J., Madsen O.B.G., Solomon M.M., Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Science 1999, 33:101-116.
27. Laporte G., Norbert Y., Desrochers M. Optimal routing under capacity and distance restrictions. Operations Research 1985, 33:1050-1073.
28. Liu F.H., Shen S.Y. The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society 1999, 50:721-732.
29. Martello S., Toth P. Knapsack Problems: Algorithms and Computer Implementations 1990, Wiley, New York.
30. Pessoa A., Poggi de Aragão M., Uchoa E. A robust branch-and-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 2009, 54(4):167-177.
31. Polacek M., Hartl Richard F., Doerner K., Reimann M. A variable neighborhood search for the multidepot vehicle routing problem with time windows. Journal of Heuristics 2004, 10:613-627.
32. Prindezis N., Kiranoudis C.T. An internet-based logistics management system for enterprise chains. Journal of Food Engineering 2005, 70(3):373-381.
33. Righini G., Salani M. Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization 2006, 30(3):255-273.
34. Righini G., Salani M. New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 2008, 51:155-170.
35. Rousseau L.M., Gendreau M., Feillet D. Interior point stabilization for column generation. Operations Research Letters 2007, 35(5):660-668.
36. Salani, M., 2006. Branch-and-Price Algorithms for Vehicle Routing Problems. PhD thesis, Universita degli Studi di Milano.
37. Santos L., Coutinho-Rodrigues J., Current J.R. Implementing a multi-vehicle multi-route spatial decision support system for efficient trash collection in Portugal. Transportation Research Part A: Policy and Practice 2008, 42(6):922-934.
38. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research 1987, 35:254-265.