自由截断下有向二维的装箱问题的求解：利用概率解构造的能力
On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction
摘要：
二维的【形】装箱问题是一个高度相关的组合优化问题。它们有大量的应用，例如，在运输或仓储的背景下，以及用于切割不同的材料，如玻璃，木材或金属。在这项工作中，我们处理的有向二维的【形】装箱问题下的自由断头台切割。在这个特定的问题中，一组定向的矩形项目，必须包装成一个最小数量的箱子的大小相等。在这项工作中提出的第一个算法是一个随机的多开始版本的建设性的一次通过启发式的文献。此外，我们建议使用这种随机的一次通过启发式的进化算法。这两种算法的结果进行了比较，从文献中的最佳方法。特别是进化算法相比，非常有利的，目前国家的最先进的方法。可以找到4个先前未解决的实例的最佳解决方案。
英文摘要：
Two-dimensional bin packing problems are highly relevant combinatorial optimization problems. They find a large number of applications, for example, in the context of transportation or warehousing, and for the cutting of different materials such as glass, wood or metal. In this work we deal with the oriented two-dimensional bin packing problem under free guillotine cutting. In this specific problem a set of oriented rectangular items is given which must be packed into a minimum number of bins of equal size. The first algorithm proposed in this work is a randomized multi-start version of a constructive one-pass heuristic from the literature. Additionally we propose the use of this randomized one-pass heuristic within an evolutionary algorithm. The results of the two proposed algorithms are compared to the best approaches from the literature. In particular the evolutionary algorithm compares very favorably to current state-of-the-art approaches. The optimal solution for 4 previously unsolved instances could be found.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
