A new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard c...
Saved in:
Published in | Journal of industrial engineering international Vol. 10; no. 1; pp. 1 - 16 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Heidelberg
Springer
01.04.2014
Springer Berlin Heidelberg Islamic Azad University, South Tehran Branch |
Subjects | |
Online Access | Get full text |
ISSN | 2251-712X 1735-5702 2251-712X |
DOI | 10.1007/s40092-014-0047-9 |
Cover
Loading…
Summary: | Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. In this paper, we give a hybrid approach which combined genetic encoding and evolution scheme with the proposed placement approach. Such a combination resulted in better population evolution and faster solution convergence to optimal. The approach is subjected to a comprehensive test using benchmark instances. The computation results validate the solution and the effectiveness of the approach. |
---|---|
Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
ISSN: | 2251-712X 1735-5702 2251-712X |
DOI: | 10.1007/s40092-014-0047-9 |