A matheuristic algorithm for the multi-depot inventory routing problem

Luca Bertazzi, Leandro C. Coelho, Annarita De Maio and Demetrio Laganà

Transportation Research Part E: Logistics and Transportation Review, 2019, vol. 122, issue C, 524-544

Abstract: In this paper we solve a practical Multi-Depot Inventory Routing Problem (MDIRP). One minimizes routing costs by determining how to serve the customers from different depots, managing their inventory levels to avoid stock-outs. The MDIRP optimizes the trade-off between inventory and routing decisions in an integrated way. We formulate this problem as a mixed-integer linear programming model and design a three-phase matheuristic to solve the problem. The solutions of our matheuristic are compared with those from a branch-and-cut algorithm on classical IRP instances, new instances and a real case study, showing to be very effective.

Keywords: Multi-depot inventory routing problem; Mixed-integer linear programming; Matheuristic; Clustering (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554518307749
Full text for ScienceDirect subscribers only

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:eee:transe:v:122:y:2019:i:c:p:524-544

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2019.01.005

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().