A Matheuristic Algorithm for the Inventory Routing Problem

Zhouxing Su (), Zhipeng Lü (), Zhuo Wang (), Yanmin Qi () and Una Benlic ()
Additional contact information
Zhouxing Su: SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Zhipeng Lü: SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Zhuo Wang: SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Yanmin Qi: SMART, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Una Benlic: Tesco Plc, Holborn, London EC1R 5AR, United Kingdom

Transportation Science, 2020, vol. 54, issue 2, 330-354

Abstract: This work addresses a challenging inventory routing problem that arises from a practical application faced by air-product companies, including Air Liquide. Given its computational complexity and industrial importance, this problem (denoted as IRP-Challenge2016) was presented as the topic of the French Operational Research and Decision Support Society/European Operational Research Society (ROADEF/EURO) Challenge 2016. The IRP-Challenge2016 seeks an optimal delivery schedule to minimize the unit distribution cost, while satisfying various hard constraints. It involves a single product, a heterogeneous fleet, heterogeneous drivers, multiperiods, a deterministic consumption forecast, and time-window constraints. We present a new mathematical formulation of the problem and introduce a matheuristic algorithm that integrates a local search-based metaheuristic with mathematical programming. Our algorithm combines mixed integer programming and linear programming as slave methods to optimize timing and delivery and embeds these procedures within a multineighborhood search metaheuristic to adjust routes. The method extends and enhances a preliminary version of our algorithm, which ranked third in the final round of the ROADEF/EURO Challenge 2016. Computational results for 20 challenge benchmark instances demonstrate the value of the proposed algorithm in terms of both effectiveness and efficiency with respect to the results reported in the competition. We additionally analyze several key components of our matheuristic to gain an insight into its operation.

Keywords: ROADEF/EURO Challenge 2016; inventory routing problem; matheuristic; local search; mixed integer programming; linear programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1287/trsc.2019.0930 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:54:y:2020:i:2:p:330-354

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().