Theory and Methodology An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

In this paper we consider the two-dimensional (2D) rectangular packing problem, where a fixed set of items have to be allocated on a single object. Two heuristics, which belong to the class of packing procedures that preserve bottomleft (BL) stability, are hybridised with three meta-heuristic algorithms (genetic algorithms (GA), simulated annealing