New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces

Authors:
A. Bortfeldt;H. Gehring
Affiliations:
University of Hagen;University of Hagen
Venue:
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 02
Year:
2006

Citing 0
Cited 6

New heuristic and interactive approaches to 2D rectangular strip packing

Journal of Experimental Algorithmics (JEA)
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems

IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems

Engineering Applications of Artificial Intelligence
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems

Engineering Applications of Artificial Intelligence
An evolutionary hyperheuristic to solve strip-packing problems

IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
A new lossy and lossless image representation by using non-symmetry and anti-packing model with rectangles for gray images

Journal of Mobile Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of rectangular pieces and a rectangular container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) aims at orthogonally placing all the pieces within the container such that the pieces do not overlap and the total length of the resulting layout is minimized. Up to now, most of the benchmark instances to the 2D-SPP reported in the literature are rather small. In this paper 360 large random-based instances with 1000 pieces each are introduced. Further essential problem-specificparameters such as the number of item types and the quotient of the container width and the mean item dimension are varied in a systematical way. Results for the 360 instances calculated by a recently developed genetic algorithm are also reported and may serve as reference solutions.