Strip-packing using hybrid genetic approach
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 169-177 |
Journal / Publication | Engineering Applications of Artificial Intelligence |
Volume | 17 |
Issue number | 2 |
Publication status | Published - Mar 2004 |
Link(s)
Abstract
A hybrid genetic approach is proposed for the two-dimensional strip packing problems. With a combination of genetic algorithm and a novel heuristic allocation method, the packing problem is transformed into a simple permutation problem which can be effectively solved by a genetic algorithm and the searching domain is greatly reduced. The time complexity of the heuristic method is found to be O(n) for the best and average cases. From the simulation results, it is demonstrated that optimal results can be obtained in a reasonably short period of time for problems with different sizes. © 2003 Elsevier Ltd. All rights reserved.
Research Area(s)
- Genetic algorithms, Heuristic method, Strip packing
Citation Format(s)
Strip-packing using hybrid genetic approach. / Yeung, Leo H.W.; Tang, Wallace K.S.
In: Engineering Applications of Artificial Intelligence, Vol. 17, No. 2, 03.2004, p. 169-177.
In: Engineering Applications of Artificial Intelligence, Vol. 17, No. 2, 03.2004, p. 169-177.
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review