The Vehicle Routing Problem with Time Window and Randomness in Demands, Travel, and Unloading Times

Pérez-Lechuga, Gilberto and Venegas-Martínez, Francisco (2026): The Vehicle Routing Problem with Time Window and Randomness in Demands, Travel, and Unloading Times. Published in: Logistics , Vol. 10, No. paper 13 (7 January 2026): pp. 1-33.

Abstract

Background: The vehicle routing problem (VRP) is of great importance in the Industry 4.0 era because enabling technologies such as the internet of things (IoT), artificial intelligence (AI), big data, and geographic information systems (GISs) allows for real-time solutions to versions of the problem, adapting to changing conditions such as traffic or fluctuating demand. Methods: In this paper, we model and optimize a classic multi-link distribution network topology, including randomness in travel times, vehicle availability times, and product demands, using a hybrid approach of nested linear stochastic programming and Monte Carlo simulation under a time-window scheme. The proposed solution is compared with cutting-edge metaheuristics such as Ant Colony Optimization (ACO), Tabu Search (TS), and Simulated Annealing (SA). Results: The results suggest that the proposed method is computationally efficient and scalable to large models, although convergence and accuracy are strongly influenced by the probability distributions used. Conclusions: The developed proposal constitutes a viable alternative for solving real-world, large-scale modeling cases for transportation management in the supply chain.

• Item Type: MPRA Paper
• Language: English
• Keywords: vehicle routing problem; stochastic modeling; Monte Carlo simulation; supply chain management; metaheuristics; logistics optimization
• Subjects: L - Industrial Organization > L6 - Industry Studies: Manufacturing > L60 - General

References

Dantzig, G.; Fulkerson, R.; Johnson, S. Solution of a Large-Scale Traveling-Salesman Problem. J. Oper. Res. Soc. Am. 1954, 2, 393–410.

Pérez-Lechuga, G.; Martínez-Sánchez, J.F.; Venegas-Martínez, F.; Madrid-Fernández, K.N. A Routing Model for the Distribution of Perishable Food in a Green Cold Chain. Mathematics 2024, 12, 332.

Soto-Mendoza, V.; Ruiz-y-Ruiz, E.; García-Calvillo, I.; Nucamendi-Guillén, S.; Cardona-Valdés, Y. A location-routing problem for local supply chains. Comput. Ind. Eng. 2023, 183, 109528.

Agárdi, A.; Kovács, L.; Bányai, T. Mathematical Model for the Generalized VRP Model. Sustainability 2022, 14, 11639.

Dornemann, J. Solving the capacitated vehicle routing problem with time windows via graph convolutional network assisted tree search and quantum-inspired computing. Front. Appl. Math. Stat. 2023, 9, 1155356.

Soares, R.; Marques, A.; Amorim, P.; Parragh, S.N. Synchronisation in vehicle routing: Classification schema, modelling framework and literature review. Eur. J. Oper. Res. 2024, 313, 817–840.

Archetti, C.; Fernandez, E.; Huerta, D. The Flexible Periodic Vehicle Routing Problem. Comput. Oper. Res. 2017, 85.

Contardo, C.; Martinelli, R. A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret. Optim. 2014, 12, 129–146.

What Is a Warehouse Management System (WMS)? Available online: https://www.oracle.com/scm/logistics/warehouse- management/what-is-warehouse-management/#:~:text=de%20Oracle%20(WMS)-,%C2%BFQu%C3%A9%20es%20un%20 sistema%20de%20gesti%C3%B3n%20de%20almacenes%20(WMS)%3F,el%20estante%20de%20la%20tienda (accessed on 15 May 2025).

Silvertouch SAP. SAP for Warehouse Management—Its Types, Modules, Benefits, Features, and Price Details. Available on- line: https://sap.silvertouch.com/blog/sap-erp-for-warehouse-management-system-modules-benefits-features-andprice#:~: text=Simply%20put%2C%20the%20SAP%20warehouse,all%20warehouse%2Drelated%20operations%20efficiently (accessed on 17 May 2025).

Boumpa, E.; Tsoukas, V.; Chioktour, V.; Kalafati, M.; Spathoulas, G.; Kakarountas, A.; Trivellas, P.; Reklitis, P.; Malindretos, G. A Review of the Vehicle Routing Problem and the Current Routing Services in Smart Cities. Analytics 2023, 2, 1.

Liu, X.; Chen, Y.-L.; Por, L.Y.; Ku, C.S. A Systematic Literature Review of Vehicle Routing Problems with Time Windows. Sustainability 2023, 15, 12004.

Chabot, T.; Coelho, L.C.; Renaud, J.; Roodbergen, K.J. Mathematical Models for the Warehouse Reassignment Problem. In Warehousing and Material Handling Systems for the Digital Industry; Manzini, R., Accorsi, R., Eds.; Springer: Cham, Switzerland, 2024.

Li, X.; Tian, P.; Leung, S.C.H. Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. Int. J. Prod. Econ. 2010, 125, 137–145.

Pérez Lechuga, G. Optimal logistics strategy to distribute medicines in clinics and hospitals. J. Math. Ind. 2018, 8, 2.

Pérez-Lechuga, G.; Aguilar-Velázquez, S.L.; Cisneros-López, M.A.; Martínez, F.V. A model for the location and scheduling of the operation of second-generation ethanol biorefineries. J. Math. Ind. 2019, 9, 3.

Widuch, J. Chapter 1—Current and emerging formulations and models of real-life rich vehicle routing problems. In Intelligent Data-Centric Systems, Smart Delivery Systems; Nalepa, J., Ed.; Elsevier: Amsterdam, The Netherlands, 2020; pp. 1–35.

Stewart, W.R., Jr.; Golden, B.L. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. 1983, 14, 371–385.

Ulmer, M.W.; Goodson, J.C.; Mattfeld, D.C.; Thomas, B.W. On modeling stochastic dynamic vehicle routing problems. EURO J. Transp. Logist. 2020, 9, 100008.

Adulyasak, Y.; Jaillet, P. Models and algorithms for stochastic and robust vehicle routing with deadlines. Transp. Sci. 2015, 50, 608–626.

Gómez, A.; Mariño, R.; Akhavan-Tabatabaei, R.; Medaglia, A.L.; Mendoza, J.E. On Modeling Stochastic Travel and Service Times in Vehicle Routing. Transp. Sci. 2015, 50, 627–641.