Heuristic Solutions for the 2D Bin-Packing Problem with Varied Size

• Eduardo Augusto Militão Fernandes UFMG
• Thiago Ferreira de Noronha UFMG
• Amadeu Almeida Coco ORKAD, CRIStAL, UMR 9189, CNRS, Centrale Lille, Université de Lille

Resumo

This work addresses the 2D Bin-Packing Problem with Varied Size and proposes heuristic solutions for it. An extensive literature review on the problem is carried out, and the state-of-the-art literature algorithm for its variation with guillotine constraint is reproduced in order to validate the reported results. It is also used to build a baseline which is compared with a proposed improvement for this algorithm in order to enable the addition of a new constraint to the problem that meets an industry demand for its practical application.