The exact solution of several classes of inventory-routing problems
The exact solution of several classes of inventory-routing problems
复制标题
DOI：
10.1016/j.cor.2012.08.012
复制
发表时间：
2013-02
期刊：
影响因子：
--
通讯作者：
Leandro C. Coelho;G. Laporte
中科院分区：
文献类型：
--
作者：
Leandro C. Coelho;G. Laporte
为了具有竞争力，公司需要利用不同决策领域之间的协同互动。其中两项与分配和库存管理程序有关。库存-路径问题（IRP）是同时进行库存和路径决策的问题，是一个复杂的组合优化问题。在本文中，我们提出了一个分支和切割算法的几类IRP的精确解。具体来说，我们解决了多车辆IRP与同质和异质车队，IRP与转运选项，IRP与增加一致性功能。我们对基准实例进行了广泛的计算分析。
In order to be competitive companies need to take advantage of synergistic interactions between different decision areas. Two of these are related to the distribution and inventory management processes. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be made simultaneously, which yields a difficult combinatorial optimization problem. In this paper, we propose a branch-and-cut algorithm for the exact solution of several classes of IRPs. Specifically, we solve the multi-vehicle IRP with a homogeneous and a heterogeneous fleet, the IRP with transshipment options, and the IRP with added consistency features. We perform an extensive computational analysis on benchmark instances.