A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows
International Transactions in Operational Research · 12.07.2026
DOI: 10.1111/itor.70235 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Transactions in Operational Research, online erschienen am 12.07.2026. Verfasst von Sara Charaf und 5 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Nederlandse Organisatie voor Wetenschappelijk Onderzoek.
Abstract (Originalsprache)
We study an inventory routing problem with time windows (IRPTW). A single supplier serves a set of customers to fulfill their demand throughout a planning horizon. Each customer can be visited only within designated time windows, assuming each customer provides a single delivery time window valid for all periods. We propose a two‐commodity flow formulation for this problem and develop a branch‐price‐and‐cut algorithm to solve it. We test our algorithm on a rich set of benchmark instances with fixed and time‐varying demands and with up to 100 customers. Computational experiments demonstrate the effectiveness of this approach. Within a 2‐hour time limit, it can provide a lower bound for all 492 tested instances. Furthermore, 211 of them are solved to optimality, achieving an average optimality gap of 4.07% for large instances and closing the gap for 11 instances for the first time in the literature.
Förderung
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Zitieren
APA
Charaf, S., Desaulniers, G., Quesnel, F., Taş, D., Flapper, S. D. P., & Woensel, T. V. (2026). A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows. International Transactions in Operational Research. https://doi.org/10.1111/itor.70235
Vancouver
Charaf S, Desaulniers G, Quesnel F, Taş D, Flapper SDP, Woensel TV. A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows. International Transactions in Operational Research. 2026. doi:10.1111/itor.70235
BibTeX
@article{Charaf2026,
author = {Charaf, Sara and Desaulniers, Guy and Quesnel, Frédéric and Taş, Duygu and Flapper, Simme Douwe P. and Woensel, Tom Van},
title = {A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows},
journal = {International Transactions in Operational Research},
year = {2026},
doi = {10.1111/itor.70235}
}
EUVIMED