论文标题
库存路由问题的计算研究
A computational study for the inventory routing problem
论文作者
论文摘要
在这项工作中，我们比较了库存路由问题的几种新计算方法，其中单个产品通过无影响的车辆从仓库运往零售商。我们调查了旅行推销员问题（TSP）的确切算法及其在文献中为路由组件的放松。对于库存控制组件，我们调查经典混合整数线性编程和库存模型的最短路径公式。我们提出了一项数值研究，以成本和解决方案的时间在经验上比较两者的组合。
In this work we compare several new computational approaches to an inventory routing problem, in which a single product is shipped from a warehouse to retailers via an uncapacitated vehicle. We survey exact algorithms for the Traveling Salesman Problem (TSP) and its relaxations in the literature for the routing component. For the inventory control component we survey classical mixed integer linear programming and shortest path formulations for inventory models. We present a numerical study comparing combinations of the two empirically in terms of cost and solution time.
