当前位置: X-MOL 学术Eur. J. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
New construction heuristic for capacitated lot sizing problems
European Journal of Operational Research ( IF 6.4 ) Pub Date : 2023-06-05 , DOI: 10.1016/j.ejor.2023.06.002
Daryna Dziuba , Christian Almeder

We consider the classical single-level multi-item capacitated lot-sizing problem (CLSP) which is the core model for production planning. It is NP-hard and if setup operations consume capacity the feasibility problem itself is NP-complete. Several construction heuristics have been proposed in the research literature, but none of them achieves a sufficient solution quality and generality at the same time - meaning that they can be applied to different variations of the problem easily. We propose a general two-step construction heuristic (2-SCH) which sorts the customer orders in the first step and iteratively adds them to a preliminary production plan in the second step. Hence, various problem classes can be solved easily and fast. Computational experiments on the CLSP without setup times show that the 2-SCH outperforms the well-known Dixon–Silver (Dixon & Silver, 1981) and the ABC heuristics Maes and Van Wassenhove (1986) and provides better results than the genetic programming approach proposed recently by Hein et al. (2018). We also apply it to the CLSP with setup times where it outperforms the construction heuristic proposed by Trigeiro (1989). Finally, we show the flexibility of the 2-SCH by applying it to the CLSP with backorders and the multi-level CLSP as well as the single-level CLSP in an online environment.



中文翻译:

针对容量容量问题的新施工启发式

我们考虑经典的单级多项目容量批量问题(CLSP),它是生产计划的核心模型。它是 NP 困难的,如果设置操作消耗容量,那么可行性问题本身就是 NP 完全的。研究文献中已经提出了几种构造启发式方法,但它们都没有同时实现足够的解决方案质量和通用性——这意味着它们可以轻松地应用于问题的不同变体。我们提出了一种通用的两步构建启发式(2-SCH),它在第一步对客户订单进行排序,并在第二步迭代地将它们添加到初步生产计划中。因此,可以轻松快速地解决各种问题类别。无设置时间的 CLSP 计算实验表明,2-SCH 优于著名的 Dixon-Silver(Dixon & Silver,1981)和 ABC 启发式 Maes 和 Van Wassenhove(1986),并且提供比提出的遗传编程方法更好的结果最近由海因等人。(2018)。我们还将其应用于具有设置时间的 CLSP,它的性能优于 Trigeiro (1989) 提出的构造启发式。最后,我们通过将 2-SCH 应用于带延期交货的 CLSP 和在线环境中的多级 CLSP 以及单级 CLSP 来展示 2-SCH 的灵活性。我们还将其应用于具有设置时间的 CLSP,它的性能优于 Trigeiro (1989) 提出的构造启发式。最后,我们通过将 2-SCH 应用于带延期交货的 CLSP 和在线环境中的多级 CLSP 以及单级 CLSP 来展示 2-SCH 的灵活性。我们还将其应用于具有设置时间的 CLSP,它的性能优于 Trigeiro (1989) 提出的构造启发式。最后,我们通过将 2-SCH 应用于带延期交货的 CLSP 和在线环境中的多级 CLSP 以及单级 CLSP 来展示 2-SCH 的灵活性。

更新日期:2023-06-05
down
wechat
bug