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!
Description
Summary: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 an intricate solution algorithm for this problem. A combination of tools ranging from established groups of valid inequalities, pre-processing techniques, local search procedures, and a local branching algorithm is utilised to solve the IRPTW efficiently. We compare the performance of our algorithm on a benchmark set of instances and show how our solution algorithm provides promising results against a competing algorithm from the literature. Moreover, the results of our study provide an overview of the performance of several already proposed techniques and their integration in the literature.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2021.1998696