论文标题
集成切割和包装异质预制梁多重生产计划问题
Integrated Cutting and Packing Heterogeneous Precast Beams Multiperiod Production Planning Problem
论文作者
论文摘要
我们介绍了一种新颖的切割生产计划问题的变体，称为集成切割和包装异质预制梁多体生产计划（ICP-HPBMPP）。我们为ICP-HPBMPP提出了一个整数线性编程模型，以及其最佳目标函数值的下限，凭经验证明，该模型比从模型的线性松弛获得的结合界面更接近最佳解决方案值。我们还提出了ICP-HPBMPP作为替代溶液方法的遗传算法方法。我们讨论了计算实验，并使用D-最佳实验设计提出了遗传算法的参数化。在解决小型实例时，我们会观察到确切方法的良好性能，尽管在寻找中和大型问题的最佳解决方案，甚至在为大型实例找到可行的解决方案方面遇到了困难。另一方面，遗传算法可以在短时间计算时间内找到大型实例的优质解决方案。
We introduce a novel variant of cutting production planning problems named Integrated Cutting and Packing Heterogeneous Precast Beams Multiperiod Production Planning (ICP-HPBMPP). We propose an integer linear programming model for the ICP-HPBMPP, as well as a lower bound for its optimal objective function value, which is empirically shown to be closer to the optimal solution value than the bound obtained from the linear relaxation of the model. We also propose a genetic algorithm approach for the ICP-HPBMPP as an alternative solution method. We discuss computational experiments and propose a parameterization for the genetic algorithm using D-optimal experimental design. We observe good performance of the exact approach when solving small-sized instances, although there are difficulties in finding optimal solutions for medium and large-sized problems, or even in finding feasible solutions for large instances. On the other hand, the genetic algorithm could find good-quality solutions for large-sized instances within short computing times.
