数学优化
水准点(测量)
计算机科学
列生成
可变邻域搜索
趋同(经济学)
布线(电子设计自动化)
变量(数学)
车辆路径问题
算法
数学
元启发式
计算机网络
数学分析
大地测量学
经济增长
经济
地理
作者
Leandro C. Coelho,A. De Maio,Demetrio Laganà
标识
DOI:10.1016/j.tre.2020.102137
摘要
In this paper we study a Multi-Attribute Inventory Routing Problem (MAIRP). A mathematical formulation and exact solution algorithms are introduced for this problem. More precisely, we extend the Multi-Depot Inventory Routing Problem (MDIRP) in order to consider the multi-product case with a heterogeneous fleet of vehicles and explicit constraints for the route duration. The MAIRP is an NP-hard problem more complex than the classical Inventory Routing Problem. Moreover, it captures many features that can be found in real applications of a vendor-managed inventory strategy. We introduce a hybrid exact algorithm to solve it, in which several Mixed Integer Programming (MIP) models are solved to explore the neighborhoods of a Variable Neighborhood Search (VNS) scheme applied to the MAIRP. We design several neighborhoods that are based on the features of the problem. The impact of this hybridization is a faster convergence of the model and an accelerated resolution process with respect to a branch-and-cut algorithm applied to the regular MIP formulation. Extensive computational results on new and existing instances from the literature on two benchmark problems and a real data set confirm the high efficiency of our algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI