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

Authors:
Türkay Dereli;Gülesin Sena Daş
Affiliations:
Department of Industrial Engineering, University of Gaziantep, 27310, Turkey;Department of Industrial Engineering, University of Gaziantep, 27310, Turkey
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 5
Cited 0

Developing a simulated annealing algorithm for the cutting stock problem

Computers and Industrial Engineering
Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem

Computers and Industrial Engineering
Bin Packing with Adaptive Search

Proceedings of the 1st International Conference on Genetic Algorithms
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.