The irregular packing problem involves arranging all the irregular pieces on a plate with the objective of maximizing the use of material. In this article, the layout is formed by the ordered sequence of the irregular pieces which is obtained by a hybrid search algorithm and where the order is decoded by a proposed placement principle. First, a novel no-fit-polygon (NFP) generator is introduced. Then, a placement principle is presented with the new NFP generator. Finally, a search algorithm hybridized with beam search (BS) and tabu search (TS) is proposed to search over the sequence. The numerical experiments with many benchmark problems show that the hybrid algorithm is an applicative and effective approach for solving the irregular packing problem. The hybrid algorithm can produce competitive solutions in less time than many other typical algorithms.

中文翻译：

---

光束搜索与禁忌搜索混合解决不规则堆积问题

不规则包装问题涉及将所有不规则块布置在板上，以最大程度地利用材料。在本文中，布局是由不规则块的有序序列形成的，该不规则块是通过混合搜索算法获得的，并且通过建议的放置原理对次序进行解码。首先，介绍了一种新颖的不适合多边形（NFP）生成器。然后，介绍了新的NFP生成器的放置原理。最后，提出了一种与波束搜索（BS）和禁忌搜索（TS）混合的搜索算法来搜索序列。大量基准问题的数值实验表明，混合算法是一种解决不规则堆积问题的实用有效方法。