首页> 外文期刊>Computers & operations research >Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
【24h】

Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection

机译:使用供应商选择的多项库存批量问题的扩展配方和有效的不等式

获取原文
获取原文并翻译 | 示例
           

摘要

This paper considers the multi-item inventory lot-sizing problem with supplier selection. The problem consists of determining an optimal purchasing plan in order to satisfy dynamic deterministic demands for multiple items over a finite planning horizon, taking into account the fact that multiple suppliers are available to purchase from. As the complexity of the problem was an open question, we show that it is NP-hard. We propose a facility location extended formulation for the problem which can be preprocessed based on the cost structure and describe new valid inequalities in the original space of variables. Furthermore, we study the projection of the extended formulation into the original space and show the connection between the inequalities generated by this projection and the newly proposed inequalities. Additionally, we present a simple and easy to implement yet very effective MIP (mixed integer programming) heuristic using the extended formulation. Besides, we introduce two new benchmark sets of instances to assess the performance of the approaches under different cost structures. Computational results show that the preprocessing approach can significantly reduce the size of the formulation to be solved, allowing both an increase in the number of instances solved to optimality within the time limit and a reduction on the average time to solve them. Moreover, the described inequalities can improve the performance of a standard formulation for nearly all instance groups. They can also be used to provide strong lower bounds for certain large instances for which the preprocessed facility location formulation fails even to provide a linear relaxation bound due to memory limitations. Furthermore, the proposed MIP heuristic outperforms the heuristics available in the literature as it obtains solution values which at least match those reported for all instance groups, strictly improving most of them. The results also show that the performance of the approaches can vary considerably under different cost structures.(c) 2021 Elsevier Ltd. All rights reserved.
机译:本文考虑了供应商选择的多项库存批量问题。问题包括确定最佳采购计划,以满足在有限规划地平线上对多个项目的动态确定性需求,同时考虑到多个供应商可供购买。随着问题的复杂性是一个开放的问题,我们表明它是努力的。我们提出了一个设施位置扩展的问题,可以根据成本结构预处理,并描述了原始空间的新有效不等式。此外,我们研究扩展制剂的投影进入原始空间,并显示出该投影产生的不等式与新提出的不等式之间的连接。此外,我们介绍了一种简单易于实现使用扩展制定的最有效的MIP(混合整数编程)启发式。此外,我们介绍了两个新的基准结构,以评估不同成本结构下方法的性能。计算结果表明,预处理方法可以显着降低要解决的制剂的尺寸,允许在时间限制内解决的情况的数量增加,并且可以减少求解它们的平均时间。此外,所描述的不等式可以改善几乎所有实例组的标准配方的性能。它们还可用于为某些大型实例提供强大的下限,其中预处理的设施位置配方甚至由于内存限制而提供线性松弛。此外,所提出的MIP启发式优于文献中可用的启发式,因为它获得了至少匹配所有实例组的解决方案值,严格改善了它们的大部分。结果还表明,在不同的成本结构下,该方法的性能可能会有所不同。(c)2021 elestvier有限公司保留所有权利。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号