The two-echelon capacitated vehicle routing problem: Models and math-based heuristics

Transportation Science

Volumn 45, Issue 3, 2011, Pages 364-380

  Perboli, Guido ^a,b   Tadei, Roberto ^a   Vigo, Daniele ^c  

^a POLITECNICO DI TORINO   (Italy)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

City logistics; Two echelon systems; Vehicle routing

Indexed keywords

PUBLIC ADMINISTRATION; SUPPLY CHAINS; VEHICLES;

CAPACITATED VEHICLE ROUTING PROBLEM; CITY LOGISTICS; COMPUTATIONAL RESULTS; DISTRIBUTION SYSTEMS; TRAFFIC PLANNING; VALID INEQUALITY; VEHICLE FLEETS; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

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

References (44)

1. Albareda-Sambola, M., J. A Diaz, E. Fernandez. 2005. A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. 32 407-428.
2. Atamturk, A., M. W. P. Savelsbergh. 2005. Integer programming software systems. Ann. Oper. Res. 140 67-124.
3. Baldacci, R., P. Toth, D. Vigo. 2007. Recent advances in vehicle routing exact algorithms. 4OR: Quart. J. Oper. Res. 5 269-298.
4. Barros, A. I. 1998. Discrete and Fractional Programming Techniques for Location Models, Combinatorial Optimization, Vol. 3. Kluwer Academic Publishers, London.
5. Barros, A. I., M. Labbé. 1994. A general model for the uncapacitated facility and depot location problem. Location Sci. 2 173-191.
6. Barthold, J. J., R. Gue. 2004. The best shape for a crossdock. Transportation Sci. 38 235-244.
7. Beasley, J. E. 1990. OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41 1069-1072. http://people.brunel .ac.uk/m̃astjjb/jeb/info.html
8. Boulanger, C., F. Semet. 2009. A column generation based heuristic for the Capacitated location-routing problem. Proc. Odysseus 2009, Çȩsme-Izmir, Turkey.
9. Christofides, N., S. Eilon. 1969. An algorithm for the vehicle dispatching problem. Oper. Res. Quart. 20 309-318.
10. Crainic, T. G., M. Gendreau, J.-Y. Potvin. 2009a. Intelligent freight- transportation systems: Assessment and the contribution of operations research. Transportation Res. Part C 17 541-557.
11. Crainic, T. G., N. Ricciardi, G. Storchi. 2004. Advanced freight transportation systems for congested urban areas. Transportation Res. Part C 12 119-137. (Pubitemid 39239100)
12. Crainic, T. G., N. Ricciardi, G. Storchi. 2007. Models for evaluating and planning city logistics systems. CIRRELT-2007-65, CIRRELT, Montréal.
13. Crainic, T. G., N. Ricciardi, G. Storchi. 2009b. Models for evaluating and planning city logistics systems. Transportation Sci. 43 432-454.
14. Crainic, T. G., S. Mancini, G. Perboli, R. Tadei. 2008. Clusteringbased heuristics for the two-echelon vehicle routing problem. CIRRELT-2008-48, CIRRELT, Montréal.
15. Crainic, T. G., S. Mancini, G. Perboli, R. Tadei. 2010. Twoechelon vehicle routing problem: A satellite location analysis. CIRRELT-2009-15 and Procedia-Soc. Behav. Sci. 2 5944-5955.
16. Dash Associates. 2008. XPRESS-MP User Guide and Reference Manual (Release 2008a). Dash Associates, Northants, UK.
17. Daskin, M. S., C. Coullard, Z.-J. M. Shen. 2002. An inventorylocation model: Formulation, solution algorithm and computational results. Ann. Oper. Res. 110 83-106. (Pubitemid 37132277)
18. Galvão, R. D., E. Santibaez-Gonzalez. 1992. A Lagrangean heuristic for the pk-median dynamic location. Eur. J. Oper. Res. 58 250-262.
19. Gendron, B., P.-V. Khuong, F. Semet. 2009. Variable neighborhood heuristic methods for a multi-echelon capacitated locationdistribution. Proc. Odysseus, Çȩsme-Izmir, Turkey.
20. Hormozi, A. M., B. M. Khumawala. 1996. An improved algorithm for solving a multi-period facility location problem. IIE Trans. 28 105-112.
21. Jacobsen, S. K., O. B. G. Madsen. 1980. A comparative study of heuristics for a two-level routing-location problem. Eur. J. Oper. Res. 5 378-387.
22. Khumawala, B. M., D. C. Whybark. 1976. Solving the dynamic warehouse location problem. Internat. J. Production Res. 6 238-251.
23. Klose, A., A. Drexl. 2005. Facility location models for distribution system design. Eur. J. Oper. Res. 162 4-29.
24. Lin, S.-W., V. F. Yu, S.-Y. Chou. 2009. Solving the truck and trailer routing problem based on a simulated annealing heuristic. Comput. Oper. Res. 36 1683-1692.
25. Melachrinoudis, E., H. Min. 2000. The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: A multiple objective approach. Eur. J. Oper. Res. 123 1-15. (Pubitemid 30575848)
26. Melo, M. T., S. Nickel, F. S. da Gama. 2006. Dynamic multicommodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning. Comput. Oper. Res. 33 181-208. (Pubitemid 40915206)
27. Min, H., E. Melachrinoudis. 1999. The relocation of a hybrid manufacturing/ distribution facility from supply chain perspectives: A case study. OMEGA 27 75-85.
28. Nagy, G., S. Salhi. 2007. Location outing: Issues, models and methods. Eur. J. Oper. Res. 177 649-672.
29. Perboli, G., F. Pezzella, R. Tadei. 2008. EVE-OPT: An hybrid algorithm for the capability vehicle routing problem. Math. Methods Oper. Res. 68 361-382.
30. Perboli, G., R. Tadei, F. Masoero. 2010. Models and cuts for the twoechelon capacitated vehicle routing problem. Electronic Notes Discrete Math. Forthcoming.
31. Prins, C., C. Prodhon, A. Ruiz, P. Soriano, R. W. Calvo. 2007. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-Granular tabu search heuristic. Transportation Sci. 41 470-483.
32. Ralphs, T. K., L. Kopman, W. R. Pulleyblank, L. E. Trotter, Jr. 2003. On the capacitated vehicle routing problem. Math. Programming Ser. B 94 343-359.
33. Ricciardi, N., R. Tadei, A. Grosso. 2002. Optimal facility location with random throughput costs. Comput. Oper. Res. 29(6) 593-607. (Pubitemid 34099407)
34. Semet, F., E. Taillard. 1993. Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41 469-488.
35. Shen, Z.-J. M., C. Coullard, M. S. Daskin. 2003. A joint locationinventory model. Transportation Sci. 37 40-55.
36. Tadei, R., G. Perboli, N. Ricciardi. 2009. The capacitated transshipment location problem under uncertaintly. CIRRELT-2009-38, CIRRELT, Montréal.
37. Tadei, R., G. Perboli, N. Ricciardi, M. Baldi. 2010. The transshipment location problem under uncertainty with lower and upper capacity constraints. Proc. CIRO'10, Marrakech, Morocco.
38. Taniguchi, E., R. G. Thompson, T. Yamada, J. H. R. van Duin. 2001. City Logistics: Network Modeling and Intelligent Transport Systems. Amsterdam, Pergamon.
39. Toth, P., D. Vigo. 2002. An overview of vehicle routing problem. P. Toth, D. Vigo, eds. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Vol. 9. SIAM, Philadelphia, 1-51.
40. Van Roy, T. J., D. Erlenkotter. 1982. A dual-based procedure for dynamic facility location. Management Sci. 28 1091-1105.
41. Verrijdt, J. H. C. M., A. G. de Kok. 1995. Distribution planning for a divergent n-echelon network without intermediate stocks under service restrictions. Internat. J. Production Econom. 38 225-243.
42. Villegas, J. G., C. Prins, C. Prodhon, A. L. Medaglia, N. Velasco. 2010. GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engrg. Appl. Artificial Intelligence 23 780-794.
43. Wang, Q., R. Batta, J. Bhadury, C. M. Rump. 2003. Budget constrained location problem with opening and closing of facilities. Comput. Oper. Res. 30 2047-2069. (Pubitemid 36893349)
44. Wolsey, L. A. 1998. Integer Programming, John Wiley & Sons.