集成切割与包装的异质预制梁多周期生产计划问题
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
