A Hybrid Simulated-Annealing Algorithm for Two-Dimensional Strip Packing Problem.

This paper presents a hybrid simulated-annealing (SA) algorithm for two-dimensional strip packing problem (2D SPP) where a set of small rectangular items has to be allocated on a larger stock rectangle in order to find a minimum height. A new recursive placement procedure is proposed and the procedure is combined with the SA algorithm. The hybrid-SA algorithm was tested on a set of benchmark problems taken from the literature. The computational results have validated the quality of the solutions and usefulness of the proposed hybrid-SA algorithm. [ABSTRACT FROM AUTHOR]