IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v10y2026i1p13-d1835007.html

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

Author

Listed:
  • Gilberto Pérez-Lechuga

    (Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero, División de Estudios de Posgrado e Investigación, Av. 1° de Mayo y Sor Juana I. de la Cruz S/N Col. Los Mangos, Ciudad Madero 89440, Mexico)

  • Francisco Venegas-Martínez

    (Escuela Superior de Economía (ESE), Instituto Politécnico Nacional, Av. Plan de Agua Prieta 66, Plutarco Elías Calles, Miguel Hidalgo, Ciudad de México 11350, Mexico)

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.

Suggested Citation

  • Gilberto Pérez-Lechuga & Francisco Venegas-Martínez, 2026. "The Vehicle Routing Problem with Time Window and Randomness in Demands, Travel, and Unloading Times," Logistics, MDPI, vol. 10(1), pages 1-33, January.
    • Handle: RePEc:gam:jlogis:v:10:y:2026:i:1:p:13-:d:1835007
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/10/1/13/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2305-6290/10/1/13/
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • L60 - Industrial Organization - - Industry Studies: Manufacturing - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jlogis:v:10:y:2026:i:1:p:13-:d:1835007. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.