Journal
DISCRETE OPTIMIZATION
Volume 6, Issue 2, Pages 174-188Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disopt.2008.11.002
Keywords
Strip packing problem; Level algorithms
Funding
- Third World Organisation for Women in Science (TWOWS)
- South African National Research Foundation [Gun 2072815]
- 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
Recommended
No Data Available