An Effective Corner Increment-Based Algorithm for the Two-Dimensional Strip Packing Problem

The 2-D strip packing problem is an NP-hard combinatorial optimization problem. Given a strip with fixed width and infinite height, the aim of strip packing is to pack a set of rectangles with known widths and heights into the strip such that the used height of the strip is minimized. In this paper,...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE access Ročník 6; s. 72906 - 72924
Hlavní autori: Chen, Zhen, Chen, Jianli
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
AVL tree
Benchmark testing
Combinatorial analysis
corner increment
Genetic algorithms
Heuristic algorithms
Optimization
Rectangles
segment tree
Simulated annealing
Strip
Strips
Two dimension strip packing
Vegetation
ISSN:2169-3536, 2169-3536
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The 2-D strip packing problem is an NP-hard combinatorial optimization problem. Given a strip with fixed width and infinite height, the aim of strip packing is to pack a set of rectangles with known widths and heights into the strip such that the used height of the strip is minimized. In this paper, we address the 2-D strip packing problem without guillotine constraint and present an effective corner increment-based algorithm. First, a corner increment-based rectangle selection strategy is adopted in a constructive heuristic way. Second, by using the AVL tree and the segment tree, the constructive heuristic is efficiently implemented. Finally, a multi-start random local search is combined to improve the solution. Experimental results on a wide range of benchmark instances show that the proposed algorithm is effective, especially for large instances.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2882823