A matheuristic algorithm for the multi-depot inventory routing problem

作     者：Bertazzi, Luca Coelho, Leandro C. De Maio, Annarita Lagana, Demetrio 

作者机构：Univ Brescia Dept Econ & Management Brescia Italy Laval Univ CIRRELT Quebec City PQ Canada Laval Univ Canada Res Chair Integrated Logist Quebec City PQ Canada Univ Calabria Dept Mech Energy & Management Engn DIMEG Commenda Di Rende Italy 

出 版 物：《TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW》 (运输研究E部分：后勤学与运输评论)

年 卷 期：2019年第122卷

页      面：524-544页

核心收录：

学科分类：0201[经济学-理论经济学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0814[工学-土木工程] 0823[工学-交通运输工程] 

基　　金：Canadian Natural Sciences and Engineering Research Council [2014-05764] 

主　　题：Multi-depot inventory routing problem Mixed-integer linear programming Matheuristic Clustering 

摘      要：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.