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,...

Full description

Bibliographic Details

Published in:	IEEE access Vol. 6; pp. 72906 - 72924
Main Authors:	Chen, Zhen, Chen, Jianli
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!