Algoritmo para a Minimização do uso de Recipientes no Problema do Empacotamento Bidimensional com Restrições de Guilhotina

Cutting and packing problems are prevalent in various industries, logistics, and the construction sector. Therefore, the study of this class of problems is justified due to its potential to reduce material wastage and associated costs, among other benefits. This paper presents a study aimed at minimizing the number of bins required to pack all items in the rectangular two-dimensional variable-sized bin packing problem. This problem involves guillotine constraints without rotations. The heuristics ILS and a modified BCSA were implemented. After conducting preliminary tests, the use of ILS was discarded, and only the proposed modified BCSA was employed to obtain results. To validate the performance and quality of the developed algorithm, various experiments were conducted on benchmark instances from the literature, including the dataset of [1], dataset of [2], and dataset of [3], and compared with several other heuristics. Consequently, it was found that the modified BCSA applied in this work achieved excellent results in most classes, with an average improvement of 14.6% over the compared heuristics in the first dataset and 14.08% in the second.