Minimizing the logistic ratio in the inventory routing problem
Minimizing the logistic ratio in the inventory routing problem
复制标题
最小化库存路径问题中的物流比率
DOI：
--
复制
发表时间：
2016
影响因子：
2.4
通讯作者：
M. Speranza
中科院分区：
文献类型：
--
作者：
C. Archetti;G. Desaulniers;M. Speranza
库存路径问题（IRP）的目标是最小化总的旅行距离在一个时间范围内离散的时期，同时保证客户不发生缺货事件的成本。在IRP的最优解中，客户通常在地平线的尽头没有库存。只有在不增加行程成本的情况下，才可能保留一些库存。为了避免这种最终的缺点，我们认为在本文中作为目标函数的所谓的物流比，这是总的路由成本的总数量分布的比率。逻辑比产生了一个新的优化问题，其数学规划公式是非线性的。使用经典的方法，我们可以在3个周期内精确求解多达5辆车和15个客户的实例。的解决方案进行了比较与经典的IRP，无论是从最坏的情况下的观点和计算。结果表明，在经典的IRP模型中，在3个周期的情况下，Logistic比平均增加了20.4%，并且这个百分比随着水平长度的增加而减小。
Inventory routing problems (IRPs) aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that the customers do not incur a stock-out event. In an optimal solution of an IRP, the customers in general have no inventory at the end of the horizon. Some inventory may remain only if this does not increase the cost of the distance traveled. To avoid this ending drawback, we consider in this paper as objective function the so-called logistic ratio, which is the ratio of the total routing cost to the total quantity distributed. The logistic ratio gives rise to a new optimization problem whose mathematical programming formulation is non-linear. Using a classical method, we can solve exactly instances with up to 5 vehicles and 15 customers over 3 periods. The solutions are compared with those of a classical IRP, both from the worst-case point of view and computationally. The results show that on average the logistic ratio increases by 20.4 % in the classical IRP on instances with 3 periods and that the percentage decreases when the horizon length increases.