2009 | OriginalPaper | Chapter
Solving the Rectangle Packing Problem by an Iterative Hybrid Heuristic
Authors : David Beltrán-Cano, Belén Melián-Batista, J. Marcos Moreno-Vega
Published in: Computer Aided Systems Theory - EUROCAST 2009
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we propose an iterative hybrid heuristic approach consisting of two phases to solve the Rectangle Packing Problem. In the first phase, a strip width value
W
is fixed and the corresponding Strip Packing Problem is solved using an efficient hybrid GRASP-VNS heuristic. In the second one, a new value
W
is determined. The above phases are repeated until the stopping condition is met. Then, the results obtained by this iterated heuristic are compared with the results given by a Simulated Annealing given in the literature. The comparative analysis corroborates the effectiveness of the proposed hybrid approach.