The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm
International Transactions in Operational Research · 2026-05 · 33 (3) · 1609-1635
DOI: 10.1111/itor.13606 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Transactions in Operational Research, online erschienen am 30.12.2024. Verfasst von Samuel Nucamendi‐Guillén und 4 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: Universidad Panamericana.
Abstract (Originalsprache)
Integrating location and routing into a unified decision‐making framework offers a more comprehensive reflection of real‐world scenarios where different facility layouts directly influence routing plans. Consequently, addressing the issue holistically becomes imperative, especially when considering service level metrics like customer waiting times. In this paper, we address the latency location routing problem with opening costs and split deliveries (LLRP‐OCSD). This complex problem involves optimizing the design of a supply chain network by determining depot locations, assigning vehicles and demand nodes to these depots, and designing routes. This must be done while accommodating split deliveries and prioritizing minimizing waiting times for demand nodes. We formulate a mathematical model and propose an iterated local search (ILS) algorithm to solve the problem. To validate the performance of our approach, we adapted a set of benchmark instances previously used for LLRP‐OC without considering split deliveries. Computational results demonstrate that the proposed model is able to optimally solve only 2 out of the 38 tested instances within a 2‐hour timeframe. On the other hand, the proposed ILS algorithm is able to find good‐quality solutions in significantly less computational time for the LLRP‐OCSD. Extensive experimentation on larger instances (up to 200 nodes) yields consistent results within reasonable computational limits. In summary, our findings highlight how split deliveries enhance vehicle utilization, enabling the use of smaller vehicles and creating balanced routes with minimal increases in latency costs.
Förderung
- Universidad Panamericana
Zitieren
APA
Nucamendi‐Guillén, S., Gómez‐Rocha, J. E., Camacho‐Vallejo, J., Pardo, J. A. M., & González‐Ramírez, R. G. (2026). The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm. International Transactions in Operational Research, 33(3), 1609-1635. https://doi.org/10.1111/itor.13606
Vancouver
Nucamendi‐Guillén S, Gómez‐Rocha JE, Camacho‐Vallejo J, Pardo JAM, González‐Ramírez RG. The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm. International Transactions in Operational Research. 2026;33(3):1609-1635. doi:10.1111/itor.13606
BibTeX
@article{NucamendiGuilln2026,
author = {Nucamendi‐Guillén, Samuel and Gómez‐Rocha, José Emmanuel and Camacho‐Vallejo, José‐Fernando and Pardo, Javier A. Moraga and González‐Ramírez, Rosa G.},
title = {The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm},
journal = {International Transactions in Operational Research},
year = {2026},
volume = {33},
number = {3},
pages = {1609--1635},
doi = {10.1111/itor.13606}
}
EUVIMED