Abstract
Modern market behavior and globalization have increased the complexity of supply chains, dealing logistics managers to implement strategies to fulfill customers’ needs. Hence, product transportation activities are highly dependent on production outputs. In the literature, the product distribution in supply chains has traditionally been approached as a vehicle routing problem, for which several variants have been studied. However, traditional approaches consider that the set of delivery orders are available at the initial time of route design. So, inspired by the complexity of production-distribution problems, this paper addresses the case in which delivery orders have different availability at the time of designing the distribution routes (i.e., each order has its own release time). The problem is modeled as a mathematical program and solved using an Iterated Local Search algorithm hybridized with Variable Neighborhood Descent (ILS-VND). Experiments are run using adapted benchmark instances and results show the efficiency and effectiveness of the proposed algorithm.
Supported by School of Engineering Universidad de La Sabana and research grant INGPHD-10-2019 from Universidad de La Sabana.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Archetti, C., Feillet, D., Gendreau, M., Grazia Speranza, M.: Complexity of the VRP and SDVRP. Transp. Res. Part C: Emerg. Technol. 19(5), 741–750 (2011)
Ballou, R.: Logística. Administración de la cadena de suministro, Pearson Educación (2004)
Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29–46 (2007)
Díaz-Madroñero, M., Mula, J., Peidro, D.: A mathematical programming model for integrating production and procurement transport decisions. Appl. Math. Model. 52, 527–543 (2017)
Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472–1483 (2009)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, Mathematical Sciences Series (1979)
Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated vrp. Discrete Mathematics and Applications, pp. 129–154 (2002)
Irnich, S., Toth, P., Vigo, D.: Chapter 1: The family of vehicle routing problems. Vehicle Routing, pp. 1–33
Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345–358 (1992)
Martins, L.d.C., Gonzalez-Neira, E.M., Hatami, S., Juan, A.A., Montoya-Torres, J.R.: Combining production and distribution in supply chains: The hybrid flow-shop vehicle routing problem. Comput. Ind. Eng. 159, 107486 (2021)
Mentzer, J.T., Flint, D.J., Hult, G.T.M.: Logistics service quality as a segment-customized process. J. Mark. 65(4), 82–104 (2001)
Min, H., Zhou, G.: Supply chain modeling: past, present and future. Comput. Ind. Eng. 43(1), 231–249 (2002)
Montoya-Torres, J.R., López Franco, J., Nieto Isaza, S., Felizzola Jiménez, H., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 79, 115–129 (2015)
Mourgaya, M., Vanderbeck, F.: The periodic vehicle routing problem: classification and heuristic. RAIRO - Oper. Res. 40(2), 169–194 (2006)
Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143–164 (1995)
Shapiro, L.: The embodied cognition research programme. Philos Compass 2(2), 338–346 (2007)
Solina, V., Mirabelli, G.: Integrated production-distribution scheduling with energy considerations for efficient food supply chains. Procedia Comput. Sci. 180, 797–806 (2021)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)
Thomas, D.J., Griffin, P.M.: Coordinated supply chain management. Eur. J. Oper. Res. 94(1), 1–15 (1996)
Torres-Tapia, W., Montoya-Torres, J.R., Ruiz-Meza, J., Belmokhtar-Berraf, S.: A matheuristic based on ant colony system for the combined flexible jobshop scheduling and vehicle routing problem. In: 10th IFAC Conference on Manufacturing Modelling, Management and Control. Elsevier, Nantes, France (2022)
Acknowledgements
The work presented in this paper was supported by Universidad de La Sabana, Colombia, under a postgraduate scholarship from the School of Engineering awarded to the first author, and by internal research funds under project INGPHD-10-2019.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Torres-Tapia, W., Montoya-Torres, J., Ruiz-Meza, J. (2022). Hybrid ILS-VND Algorithm for the Vehicle Routing Problem with Release Times. In: Figueroa-García, J.C., Franco, C., Díaz-Gutierrez, Y., Hernández-Pérez, G. (eds) Applied Computer Sciences in Engineering. WEA 2022. Communications in Computer and Information Science, vol 1685. Springer, Cham. https://doi.org/10.1007/978-3-031-20611-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-031-20611-5_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20610-8
Online ISBN: 978-3-031-20611-5
eBook Packages: Computer ScienceComputer Science (R0)