A comparative study of algorithms based on particle swarm optimization for solving the 2D guillotine bin packing

Abstract

This article presents a methodology based on metaheuristic optimization techniques for the solution of the two- dimensional rectangular guillotineable bin packing problem, with and without 90 degrees items rotation. This one belongs to the family of cutting and packing problems, considered classic problems in the operations research, due to its  big  spectrum  of  application  in  the  industry  and  its  highly  mathematical  and  computational  complexity.  An appropriate encoding called slicing tree was developed to work this problem. In the results analysis a computational study was presented using 3 algorithms based on the particle swarm technique. In order to check the efficiency of the presented methodology in terms of the computational time and the quality of the answers, different cases of study from the specialized literature were taken to make a benchmark, that finally corroborated the performance of the proposed methodology.