An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 95, Issue , 2016, Pages 95-123

  Dayarian, Iman ^a   Crainic, Teodor Gabriel ^b,d   Gendreau, Michel ^c,d   Rei, Walter ^b,d  

^a Georgia Institute of Technology   (United States)

^b Université du Québec à Montréal   (Canada)

^c ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^d INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Adaptive large neighborhood search; Multi period vehicle routing problem with seasonal fluctuations; Seasonal variation; Tactical planning

Indexed keywords

ADAPTIVE MANAGEMENT; ALGORITHM; DESIGN; HEURISTICS; NEIGHBORHOOD; ROUTING; SEASONAL VARIATION; TRANSPORT VEHICLE;

EID: 84989186734     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2016.09.004     Document Type: Article

References (54)

1. Adulyasak, Y., Cordeau, J.-F., Jans, R., Optimization-based adaptive large neighborhood search for the production routing problem. Transp. Sci. 48:1 (2014), 20–45.
2. Aksen, D., Kaya, O., Salman, F.S., Tüncel, Ö., An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. Eur. J. Oper. Res. 239:2 (2014), 413–426 ISSN 0377-2217.
3. Angelelli, E., Speranza, M.G., The application of a vehicle routing model to a waste collection problem: two case studies. Klose, A., Speranza, M.G., Van Wassenhove, L.N., (eds.) Quantitative Approaches to Distribution Logistics and Supply Chain Management, 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 269–286 ISBN 978-3-642-56183-2.
4. Angelelli, E., Grazia, S.M., Savelsbergh, M.W.P., Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49:4 (2007), 308–317.
5. Athanasopoulos, T., The Multi-Period Vehicle Routing Problem and Its Applications. (Ph.D. Thesis), 2011, Department of Financial & Management Engineering, University of the Aegean, Chios, Greece.
6. Audet, C., Dang, K.-C., Orban, D., Optimization of algorithms with OPAL. Math. Programm. Comput. 6:3 (2014), 233–254 ISSN 1867-2957.
7. Azi, N., Gendreau, M., Potvin, J.-Y., An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41 (2014), 167–173 ISSN 0305-0548.
8. Beullens, P., Van Oudheusden, D., Van Wassenhove, L.N., Collection and vehicle routing issues in reverse logistics. Dekker, R., Fleischmann, M., Inderfurth, K., VanWassenhove, L.N., (eds.) Reverse Logistics: Quantitative Models for Closed-Loop Supply Chains, 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 95–134.
9. Bogh, M.B., Mikkelsen, H., Wøhlk, S., Collection of recyclables from cubes – a case study. Socio-Econ. Plann. Sci. 48:2 (2014), 127–134 ISSN 0038-0121.
10. Chiang, W.-C., Russell, R.A., Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63 (1999), 421–451.
11. Coelho, L.C., Cordeau, J.-F., Laporte, G., The inventory-routing problem with transshipment. Comput. Oper. Res. 39:11 (2012), 2537–2548 ISSN 0305-0548.
12. Cordeau, J.-F., Gendreau, M., Laporte, G., A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30:2 (1997), 105–119.
13. Cordeau, J.-F., Laporte, G., Mercier, A., A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52 (2001), 928–936.
14. Dantzig, G.B., Ramser, J.H., The truck dispatching problem. Manage. Sci. 6:1 (1959), 80–91.
15. Dayarian, I., Crainic, T.G., Gendreau, M., Rei, W., A column generation approach for a multi-attribute vehicle routing problem. Eur. J. Oper. Res. 241:3 (2015), 888–906, 10.1016/j.ejor.2014.09.015.
16. Dayarian, I., Crainic, T.G., Gendreau, M., Rei, W., A branch-and-price approach for a multi-period vehicle routing problem. Comput. Oper. Res. 55 (2015), 167–184, 10.1016/j.cor.2014.06.004 ISSN 0305-0548.
17. Demir, E., Bektaş, T., Laporte, G., An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223:2 (2012), 346–359 ISSN 0377-2217.
18. Elbek, M., Wøhlk, S., A variable neighborhood search for the multi-period collection of recyclable materials. Eur. J. Oper. Res. 249:2 (2016), 540–550 ISSN 0377-2217.
19. Francis, P.M., Smilowitz, K.R., Tzur, M., The period vehicle routing problem and its extensions. Golden, Bruce, Raghavan, S., Wasil, Edward, (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges Operations Research/Computer Science Interfaces, vol. 43, 2008, Springer, New York, 73–102.
20. Gendreau, M., Hertz, A., Laporte, G., A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40:10 (1994), 1276–1290.
21. Gendreau, M., Potvin, J.-Y., Smires, A., Soriano, P., Multi-period capacity expansion for a local access telecommunications network. Eur. J. Oper. Res. 172 (2006), 1051–1066.
22. Gendreau, M., Potvin, J.Y., Bräysy, O., Hasle, G., Løkketangen, A., Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography. Golden, B., Raghavan, S., Wasil, E., (eds.) The Vehicle Routing Problem - Latest Advances and New Challenges, 2008, Springer Verlag, Heidelberg.
23. Gendreau, M., Potvin, J.Y., Bräysy, O., Hasle, G., Løkketangen, A., Large neighborhood search. Gendreau, M., Potvin, J.-Y., (eds.) Handbook of Metaheuristics International Series in Operations Research & Management Science, vol. 146, 2010, Springer, Boston, 399–419.
24. Golden, B., Raghavan, S., Wasil, E.A., The vehicle routing problem: latest advances and new challenges. Operations Research/Computer Science Interfaces Series, vol. 43, 2008, Springer.
25. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F., A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195:3 (2009), 791–802.
26. Hemmelmayr, V.C., Cordeau, J.-F., Crainic, T.G., An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39:12 (2012), 3215–3228 ISSN 0305-054.
27. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization by simulated annealing. Science 220 (1983), 671–680.
28. Kouassi, R., Gendreau, M., Potvin, J.-Y., Soriano, P., Heuristics for multi-period capacity expansion in local telecommunications networks. J. Heurist. 15:4 (2009), 381–402.
29. Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F., Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15:5 (2012), 579–600 ISSN 1094-6136.
30. Lahrichi, N., Crainic, T.G., Gendreau, M., Rei, W., Rousseau, L.-M., Strategic analysis of the dairy transportation problem. J. Oper. Res. Soc., 2013, 10.1057/jors.2013.147 ISSN 0160-5682.
31. Lahrichi, N., Crainic, T.G., Gendreau, M., Rei, W., Crisan, C., Vidal, T., An integrative cooperative search framework for multi-decision-attribute combinatorial optimization. Eur. J. Oper. Res. 246:2 (2015), 400–412.
32. Lahyani, R., Coelho, L.C., Khemakhem, M., Laporte, G., Semet, F., A multi-compartment vehicle routing problem arising in the collection of olive oil in tunisia. Omega 51 (2015), 1–10 ISSN 0305-0483.
33. Laporte, G., Musmanno, R., Vocaturo, F., An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transp. Sci. 44:1 (2010), 125–135 ISSN 1526-5447.
34. Lenstra, J.K., Rinnooy Kan, A.H.G., Complexity of vehicle routing and scheduling problems. Networks 11 (1981), 221–227.
35. Mancini, S., A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: formulation and adaptive large neighborhood search based matheuristic. Transp. Res. Part C: Emerg. Technol., 2015, 10.1016/j.trc.2015.06.016 ISSN 0968-090X.
36. Muyldermans, L., Pang, G., On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. Eur. J. Oper. Res. 206:1 (2010), 93–103 ISSN 0377-2217.
37. Ngueveu, S.U., Prins, C., Calvo, R.W., An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37:11 (2010), 1877–1885 ISSN 0305-0548. Metaheuristics for Logistics and Vehicle Routing.
38. Osman, I.H., Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41 (1993), 421–451.
39. Pepin, A.-S., Desaulniers, G., Hertz, A., Huisman, D., A comparison of five heuristics for the multiple depot vehicle scheduling problem. J. Sched. 12:1 (2009), 17–30.
40. Pisinger, D., Ropke, S., A general heuristic for vehicle routing problems. Comput. Oper. Res. 34 (2007), 2403–2435.
41. Rahimi-Vahed, A., Crainic, Teodor Gabriel, Gendreau, Michel, Rei, Walter, A path relinking algorithm for a multi-depot periodic vehicle routing problem. J. Heurist. 19:3 (2013), 497–524.
42. Renaud, M., Lehuédé, F., Péton, O., An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transp. Sci. 47:3 (2013), 344–355.
43. Ribeiro, G.M., Laporte, G., An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39:3 (2012), 728–735 ISSN 0305-0548.
44. Ropke, S., Pisinger, D., An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40 (2006), 455–472.
45. Rousseau, L.-M., Gendreau, M., Pesant, G., Using constraint-based operators to solve the vehicle routing problem with time windows. J. Heurist. 8 (2002), 43–58.
46. Schrimpf, G., Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159:2 (2000), 139–171.
47. Shaw, P., Using constraint programming and local search methods to solve vehicle routing problems. Maher, M., Puget, J.-F., (eds.) Principles and Practice of Constraint Programming – CP98 Lecture Notes Computer Science, vol. 1520, 1998, Springer Berlin Heidelberg, 417–431.
48. Toth, P., Vigo, D., (eds.) Vehicle Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, 2014, SIAM, Philadelphia, PA.
49. Toth, P., Vigo, D., (eds.) The Vehicle Routing Problem, vol. 9, 2002, Society for Industrial and Applied Mathematics.
50. Tricoire, F., Optimization des tournées de véhicules et de personnels de maintenance: Application à la distribution et au traitement des eaux. (Ph.D. Thesis), 2006, IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes, Nantes, France.
51. Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W., A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60:3 (2012), 611–624.
52. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C., Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231:1 (2013), 1–21.
53. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C., A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234:3 (2014), 658–673.
54. Wen, M., Cordeau, J.-F., Laporte, G., Larsen, J., The dynamic multi-period vehicle routing problem. Comput. Oper. Res. 37:9 (2010), 1615–1623.