Abstract
Multi-trip vehicle routing problem with a variable number of wagons significantly reduces the number of vehicles and drivers needed to service customers. It is often hard to solve these problems in acceptable CPU times using exact algorithms when the problem contains very big real-world data sets. We use meta-heuristic algorithms to get a solution close to the optimal solutions for vehicle routing problems with a dynamic capacity of a vehicle. First, local search heuristics applied with genetic algorithms are proposed. Then, a pattern-mining algorithm is developed to improve the solutions found from the genetic algorithm. We perform detailed experiments on Solomon instances for vehicle routing problem with time windows (VRPTW). Our experiments establish the effectiveness of the algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Solomon’s benchmark instances (2008). https://www.sintef.no/projectweb/top/vrptw/solomon-benchmark/. Accessed 30 Mar 2023
Abdoun, O., Abouchabaka, J., Tajani, C.: Analyzing the performance of mutation operators to solve the travelling salesman problem. arXiv preprint arXiv:1203.3099 (2012)
Arnold, F., Santana, Í., Sörensen, K., Vidal, T.: PILS: exploring high-order neighborhoods by pattern mining and injection. Pattern Recogn. 116, 107957 (2021)
Arnold, F., Sörensen, K.: Knowledge-guided local search for the vehicle routing problem. Comput. Oper. Res. 105, 32–46 (2019)
Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3), 756–763 (2010)
Berghida, M., Boukra, A.: Quantum inspired algorithm for a VRP with heterogeneous fleet mixed backhauls and time windows. Int. J. Appl. Metaheuristic Comput. (IJAMC) 7(4), 18–38 (2016)
Brandão, J.C.S., Mercer, A.: The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49, 799–805 (1998)
Cattaruzza, D., Absi, N., Feillet, D., Vidal, T.: A memetic algorithm for the multi trip vehicle routing problem. Eur. J. Oper. Res. 236(3), 833–848 (2014)
Fleischmann, B.: The vehicle routing problem with multiple use of vehicles. Fachbereich Wirtschaftswissenschaften, Universität Hamburg (1990)
Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, É.D.: A Tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26(12), 1153–1173 (1999)
Hernandez, F., Feillet, D., Giroudeau, R., Naud, O.: An exact method to solve the multitrip vehicle routing problem with time windows and limited duration. TRISTAN 7, 366–369 (2010)
Karakatič, S., Podgorelec, V.: A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl. Soft Comput. 27, 519–532 (2015)
Karimi, L., Nawrin Ferdous, C.: Branch and price algorithm for multi-trip vehicle routing with a variable number of wagons and time windows. Algorithms 15(11), 412 (2022)
Karimi, L., et al.: Algorithms for multi-trip vehicle routing and device to device communications. Ph.D. thesis, Lethbridge, Alta.: Department of Mathematics and Computer Science (2022)
Katoch, S., Chauhan, S.S., Kumar, V.: A review on genetic algorithm: past, present, and future. Multimedia Tools Appl. 80, 8091–8126 (2021)
Koç, Ç., Bektaş, T., Jabali, O., Laporte, G.: Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1), 1–21 (2016)
Lenstra, J.K., Kan, A.R.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221–227 (1981)
Little, C., Choudhury, S., Hu, T., Salomaa, K.: Comparison of genetic operators for the multiobjective pickup and delivery problem. Mathematics 10(22), 4308 (2022)
Little, C., et al.: An exploration of heuristics applied to genetic algorithms on the capacitated pickup and delivery problem with time windows. Master’s thesis (2023)
Macrina, G., Pugliese, L.D.P., Guerriero, F., Laporte, G.: The green mixed fleet vehicle routing problem with partial battery recharging and time windows. Comput. Oper. Res. 101, 183–199 (2019)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)
Pace, S., Turky, A., Moser, I., Aleti, A.: Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Comput. Sci. 51, 2257–2266 (2015)
Pan, B., Zhang, Z., Lim, A.: Multi-trip time-dependent vehicle routing problem with time windows. Eur. J. Oper. Res. 291(1), 218–231 (2021)
Penna, P.H.V., Subramanian, A., Ochi, L.S., Vidal, T., Prins, C.: A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. 273(1), 5–74 (2019)
Prins, C.: Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case. J. Math. Model. Algorithms 1(2), 135–150 (2002)
Sethanan, K., Jamrus, T.: Hybrid differential evolution algorithm and genetic operator for multi-trip vehicle routing problem with backhauls and heterogeneous fleet in the beverage logistics industry. Comput. Ind. Eng. 146, 106571 (2020)
Solomon, M.M., Desrosiers, J.: Survey paper-time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1–13 (1988)
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), 611–624 (2012)
Vieira, B.S., Ribeiro, G.M., Bahiense, L.: Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem. Comput. Oper. Res. 153, 106189 (2023)
Yağmur, E., Kesen, S.E.: Multi-trip heterogeneous vehicle routing problem coordinated with production scheduling: memetic algorithm and simulated annealing approaches. Comput. Ind. Eng. 161, 107649 (2021)
Zhen, L., Ma, C., Wang, K., Xiao, L., Zhang, W.: Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transp. Res. Part E: Logistics Transp. Rev. 135, 101866 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Karimi, L., Little, C., Choudhury, S. (2024). A Pattern Mining Heuristic for the Extension of Multi-trip Vehicle Routing. In: Pereira, A.I., Mendes, A., Fernandes, F.P., Pacheco, M.F., Coelho, J.P., Lima, J. (eds) Optimization, Learning Algorithms and Applications. OL2A 2023. Communications in Computer and Information Science, vol 1981. Springer, Cham. https://doi.org/10.1007/978-3-031-53025-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-53025-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53024-1
Online ISBN: 978-3-031-53025-8
eBook Packages: Computer ScienceComputer Science (R0)