The tasks of rational cutting-packaging have long attracted the attention of researchers and practitioners in various industries. They are classified as NP-complete problems. In this paper, two-dimensional orthogonal guillotine packaging in sheets of the same size is considered as the main one. An essential feature of the problem under consideration is technological limitations. You must place all the rectangles of different sizes and quantities, however, the layout template should be the same for all sheets. Thus, it is necessary to minimize the number of sheets in an acceptable time. To compare the effectiveness of various methods on the same class of tasks, the cutting coefficient is determined. However, an important issue in evaluating a particular method is the decision time. The paper presents a heuristic algorithm. The performed computational experiments confirm the effectiveness of the proposed method.
展开▼
