Bee Colony Optimization Applied To The B

This study addresses the two-dimensional bin packing problem, which involves efficiently packing a set of rectangles into a minimum number of identical larger rectangles or bins. As a combinatorial challenge, this problem is recognized as NP-hard. The objective of this work is to introduce a novel pretreatment strategy for the oriented variant of the bin packing problem that aims to enhance the utilization of space within the bins and to simplify the underlying problem size. The methodology employs a heuristic approach based on a first-fit strategy tailored for this application, alongside an innovative resolution technique utilizing bee colony optimization. Computational tests provide comparative data on the efficiency of the proposed method versus traditional approaches, illustrating the impact of pretreatment on the number of bins utilized. Results indicate significant improvements in bin usage with the pretreatment, showcasing the efficacy of the heuristic and meta-heuristic methods in solving complex bin packing challenges. This research holds implications for various industrial applications where optimized space management is crucial.