Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Conference on Control Systems, Mathematical Modeling, Automation and Energy Efficiency, SUMMA 2021

Год издания: 2021

Идентификатор DOI: 10.1109/SUMMA53307.2021.9632195

Ключевые слова: bin packing problem, ingot packing problem, metaheuristic, optimization, rectangle, strip packing problem

Аннотация: This paper presents the formulation of the ingot cutting problem, which consists in the need to produce a set of blanks from an ingot in an optimal way. The main difference from the classical packaging problems is the dynamic change in the geometry of the original container during the production process. As a result, ingot cutting problem can be represented in the form of two components. The first is the solution of the bin pacing problem, and the second is the search for the optimal sequence of operations on the ingot. The paper proposes a metaheuristic algorithm to search for the sequence of operations with the ingot. The method is based on a tree-like representation of the cutting process, where the nodes represent the operations performed, as well as the states of the bin. This allows you to provide not only the final configurations of containers and their cutting schemes, but also the sequence of technological operations necessary to produce elements. The proposed algorithm showed acceptable quality on specially generated test examples. © 2021 IEEE.

Журнал: Proceedings - 2021 3rd International Conference on Control Systems, Mathematical Modeling, Automation and Energy Efficiency, SUMMA 2021

Номера страниц: 931-934

Издатель: Institute of Electrical and Electronics Engineers Inc.

• Voronov V. S. (Institute of Space and Information Technologies Siberian Federal University, Department of Informatics, Krasnoyarsk, Russian Federation)

• Scopus