0/1 1-D Bin Packing Problem Solved by a Recent Nature-Inspired Optimizer

Optimization is an entire field that aims to improve efficiency and effectiveness across various domains. Its primary objective is to minimize costs, time, and risks while maximizing gains, quality, and efficiency. In this context, the 0/1 1-D bin packing problem is one of combinatorial optimization’s most challenging and extensively studied problems. This problem holds significant practical applications in supply chain management, packaging design, and resource optimization. This work solves the 0/1 1-D bin packing problem using a nature-inspired golden eagle optimizer. The hunting behavior of golden eagles inspires this bio-solver, and it employs swarm intelligence-based strategies to approximate solutions. We perform a comparative analysis of the bio-inspired algorithm to evidence its yield. We use twenty instances of the 1-D bin packing problem. Computational results show that the golden eagle optimizer exhibits better results in convergence time than well-known bio-inspired algorithms.