Reactive GRASP for the strip-packing problem

Authors:
R. Alvarez-Valdes;F. Parreño;J. M. Tamarit
Affiliations:
Department of Statistics and Operations Research, University of Valencia, Burjassot, Valencia, Spain;Department of Computer Science, University of Castilla-La Mancha, Albacete, Spain;Department of Statistics and Operations Research, University of Valencia, Burjassot, Valencia, Spain
Venue:
Computers and Operations Research
Year:
2008

Citing 9
Cited 23

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing
An Exact Approach to the Strip-Packing Problem

INFORMS Journal on Computing
New heuristic and interactive approaches to 2D rectangular strip packing

Journal of Experimental Algorithmics (JEA)
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation

IEEE Transactions on Computers
An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Operations Research
A probabilistic heuristic for a computationally difficult set covering problem

Operations Research Letters

Ant colony optimization for the two-dimensional loading vehicle routing problem

Computers and Operations Research
A Tabu Search Algorithm with Direct Representation for Strip Packing

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio

Computers and Operations Research
Using a greedy random adaptative search procedure to solve the cover printing problem

Computers and Operations Research
A hyper-heuristic approach to strip packing problems

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A squeaky wheel optimisation methodology for two-dimensional strip packing

Computers and Operations Research
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics

IEEE Transactions on Evolutionary Computation
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

Operations Research
Tabu search with consistent neighbourhood for strip packing

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem

INFORMS Journal on Computing
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

Computers and Operations Research
A fast layer-based heuristic for non-guillotine strip packing

Expert Systems with Applications: An International Journal
On the use of human-guided evolutionary algorithms for tackling 2D packing problems

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
A skyline-based heuristic for the 2D rectangular strip packing problem

IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
An efficient deterministic heuristic for two-dimensional rectangular packing

Computers and Operations Research
A simple randomized algorithm for two-dimensional strip packing

Computers and Operations Research
Heuristics for the strip packing problem with unloading constraints

Computers and Operations Research
Heuristic for the rectangular strip packing problem with rotation of items

Computers and Operations Research
A Reinforced Tabu Search Approach for 2D Strip Packing

International Journal of Applied Metaheuristic Computing
Automatic discovery of optimisation search heuristics for two dimensional strip packing using genetic programming

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

INFORMS Journal on Computing
An effective shaking procedure for 2D and 3D strip packing problems

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite height so as to minimize the required height. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances which have been previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures. The results show that the GRASP algorithm outperforms recently reported metaheuristics.