A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem

Citation

Burke E, Hellier RSR, Kendall G & Whitwell G (2006) A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Operations Research, 54 (3), pp. 587-601. https://doi.org/10.1287/opre.1060.0293

Abstract
This paper presents a new heuristic algorithm for the two-dimensional irregular stock-cutting problem, which generates significantly better results than the previous state of the art on a wide range of established benchmark problems. The developed algorithm is able to pack shapes with a traditional line representation, and it can also pack shapes that incorporate circular arcs and holes. This in itself represents a significant improvement upon the state of the art. By utilising hill climbing and tabu local search methods, the proposed technique produces 25 new best solutions for 26 previously reported benchmark problems drawn from over 20 years of cutting and packing research. These solutions are obtained using reasonable time frames, the majority of problems being solved within five minutes. In addition to this, we also present 10 new benchmark problems, which involve both circular arcs and holes. These are provided because of a shortage of realistic industrial style benchmark problems within the literature and to encourage further research and greater comparison between this and future methods.

Keywords
search production/scheduling; cutting-stock/trim; production/scheduling; approximations/heuristic; computers/computer science; artificial intelligence

Journal
Operations Research: Volume 54, Issue 3