A real-life Multi Depot Multi Period Vehicle Routing Problem with a Heterogeneous Fleet: Formulation and Adaptive Large Neighborhood Search based Matheuristic

Transportation Research Part C: Emerging Technologies

Volumn 70, Issue , 2016, Pages 100-112

  Mancini, Simona ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Heterogeneous fleet; Large Neighborhood Search; Matheuristic; Multi depot vehicle routing; Multi period

Indexed keywords

INTEGER PROGRAMMING; VEHICLE ROUTING; VEHICLES;

HETEROGENEOUS FLEET; LARGE NEIGHBORHOOD SEARCH; MATHEURISTIC; MULTI DEPOTS; MULTI-PERIOD;

FLEET OPERATIONS;

COMPUTER SIMULATION; HETEROGENEITY; HEURISTICS; NUMERICAL MODEL; PLANNING METHOD; REAL TIME; ROUTING; TRANSPORTATION PLANNING; TRANSPORTATION SYSTEM;

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

References (25)

1. Ahuja, R., Ergun, A., Orlin, J., Punnen, A., A survey of very largescale neighborhood search techniques. Discrete Appl. Math. 123 (2002), 75–102.
2. Archetti, C., Speranza, M., The vehicle routing problem: latest advances and new challenges. The Split Delivery Vehicle Routing Problem: A Survey, 2008, Springer, Berlin, 103–122 Chapter.
3. Baldacci, R., Battarra, M., Vigo, D., The vehicle routing problem: latest advances and new challenges. Routing a Heterogeneous Fleet of Vehicles, 2008, Springer, Berlin, 3–27 Chapter.
4. Brandao, J., A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput. Oper. Res. 38 (2011), 140–151.
5. Caric, T., Galic, A., Fosin, J., Gold, H., Reinholz, A., 2008. Vehicle routing problem. In: A Modelling and Optimization Framework for Real-World Vehicle Routing Problems, I-Tech, Vienna, Austria, pp. 15–34 (Chapter).
6. Choi, E., Tcha, D., A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34 (2007), 2080–2095.
7. Confessore, G., Galiano, G., Stecca, G., Manufacturing systems and technologies for the new Frontier. An Evolutionary Algorithm for Vehicle Routing Problem with Real Life Constraints, 2008, Springer, Berlin, 225–228 Chapter.
8. Crainic, T., Ricciardi, N., Storchi, G., Models for evaluating and planning city logistics systems. Transport. Sci. 43 (2009), 432–454.
9. Crainic, T., Perboli, G., Mancini, S., Tadei, R., Two-echelon vehicle routing problem: a satellite location analysis. Proc.: Soc. Behav. Sci. 2 (2010), 5944–5955.
10. Crainic, T., Perboli, G., Mancini, S., Tadei, R., Impact of generalized travel costs on satellite location in two-echelon vehicle routing problem. Proc.: Soc. Behav. Sci. 39 (2012), 195–204.
11. Francis, P., Smilowitz, K., Tzur, M., The vehicle routing problem: latest advances and new challenges. The Period Vehicle Routing Problem and its Extensions, 2008, Springer, Berlin, 73–102 Chapter.
12. Goel, A., Gruhn, V., A general vehicle routing problem. Euro. J. Oper. Res. 191 (2008), 650–660.
13. Gonzalez-Feliu, J., Cost optimisation in freight distribution with cross-docking: N-echelon location routing problem. Promet – Traffic 24:2 (2012), 143–149.
14. Hasle, G., Kloster, O., Geometric modelling, numerical simulation, and optimization. Industrial Vehicle Routing, 2007, Springer, Berlin, 397–435 Chapter.
15. Larsen, A., 2001. The Dynamic Vehicle Routing Problem, Ph.D. thesis, DTU Lingby, Denmark.
16. Mancini, S., The two-echelon vehicle routing problem. 4OR 10:4 (2012), 391–392.
17. Perboli, G., Tadei, R., Vigo, D., The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Transport. Sci. 45 (2011), 364–380.
18. Pillac, V., Gendreau, M., Gueret, C., Medaglia, A., A review of dynamic vehicle routing problems. Euro. J. Oper. Res. 225:1 (2013), 1–11.
19. Pisinger, D., Ropke, S., Handbook of metaheuristics: international series in operations research & management science. Large Neighborhood Search, 2010, Springer, Berlin, 399–419 Chapter.
20. Ropke, S., Pisinger, D., An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport. Sci. 40:4 (2006), 455–472.
21. Salhi, S., Imran, A., Wassan, N., The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation. Comput. Oper. Res. 52(B) (2014), 314–325.
22. Semet, F., Taillard, E., Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41:4 (1993), 469–488.
23. Toth, P., Vigo, D., The Vehicle Routing Problem. 2002, S.I.A.M., Philadelphia, PA.
24. Weise, T., Podlich, A., Gorldt, C., Natural intelligence for scheduling, planning and packing problems. Solving Real-World Vehicle Routing Problems with Evolutionary Algorithms, 2009, Springer, Berlin, 29–53 Chapter.
25. Wen, M., Cordeau, J.F., Laporte, G., Larsen, J., The dynamic multi-period vehicle routing problem. Comput. Oper. Res. 37:9 (2010), 1615–1623.