EUVIMEDOpdag EUVIMED
Open access · CC BY 4.0

A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

Sara Charaf, Guy Desaulniers, Frédéric Quesnel, Duygu Taş, Simme Douwe P. Flapper, Tom Van Woensel

International Transactions in Operational Research · 2026-07-12

DOI: 10.1111/itor.70235 ↗

At a glance

Journal article in International Transactions in Operational Research, published online on 2026-07-12. Written by Sara Charaf and 5 co-authors. 35 references. The full text is freely available (open access, CC BY 4.0). Funded by: Nederlandse Organisatie voor Wetenschappelijk Onderzoek.

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

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.

Funding

  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Cite

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}
}
Start for free →