An improved model and exact algorithm using local branching for the inventory-routing problem with time windows

The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW) considers time windows for the deliveries to the customers. Due to its importance and several real-world applications, in this paper, we develop...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of production research Vol. 61; no. 1; pp. 49 - 64
Main Authors:	Demantova, Bruno E., Scarpin, Cassius T., Coelho, Leandro C., Darvish, Maryam
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 02.01.2023 Taylor & Francis LLC
Subjects:	Algorithms exact methods Inventory-routing local branching Optimization time windows valid inequalities vehicle routing Windows (intervals)
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!