A hyper-heuristic approach to strip packing problems

Authors:
Edmund K. Burke;Qiang Guo;Graham Kendall
Affiliations:
School of Computer Science, University of Nottingham, Nottingham, United Kingdom;School of Computer Science, University of Nottingham, Nottingham, United Kingdom;School of Computer Science, University of Nottingham, Nottingham, United Kingdom
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 10
Cited 0

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems

Artificial Intelligence Review
Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

Mathematics of Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
Reactive GRASP for the strip-packing problem

Computers and Operations Research
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem

Computers and Operations Research
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem

INFORMS Journal on Computing
Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a genetic algorithm based hyperheuristic for producing good quality solutions to strip packing problems. Instead of using just a single decoding heuristic, we employ a set of heuristics. This enables us to search a larger solution space without loss of efficiency. Empirical studies are presented on two-dimensional orthogonal strip packing problems which demonstrate that the algorithm operates well across a wide range of problem instances.