4.1 Article

A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem

Journal

DISCRETE OPTIMIZATION
Volume 6, Issue 2, Pages 174-188

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.disopt.2008.11.002

Keywords

Strip packing problem; Level algorithms

Funding

  1. Third World Organisation for Women in Science (TWOWS)
  2. South African National Research Foundation [Gun 2072815]
  3. Harry Crossley Foundation

Ask authors/readers for more resources

Ail overview and comparison is provided Of a number of heuristics from the literature for the two-dimensional strip packing problem in which rectangles have to be packed without rotation. Heuristics producing only guillotine packings are considered. A new heuristic is also introduced and a number of modifications are Suggested to the existing heuristics. The resulting heuristics (known and new) are then compared statistically with respect to a large set of known benchmarks at a 5% level of significance, (C) 2008 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.1
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available