A skyline heuristic for the 2D rectangular packing and strip packing problems
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 337-346 |
Journal / Publication | European Journal of Operational Research |
Volume | 215 |
Issue number | 2 |
Publication status | Published - 1 Dec 2011 |
Link(s)
Abstract
In this paper, we propose a greedy heuristic for the 2D rectangular packing problem (2DRP) that represents packings using a skyline; the use of this heuristic in a simple tabu search approach outperforms the best existing approach for the 2DRP on benchmark test cases. We then make use of this 2DRP approach as a subroutine in an "iterative doubling" binary search on the height of the packing to solve the 2D rectangular strip packing problem (2DSP). This approach outperforms all existing approaches on standard benchmark test cases for the 2DSP. © 2011 Elsevier B.V. All rights reserved.
Research Area(s)
- Cutting and packing, Heuristics, Tabu search
Citation Format(s)
A skyline heuristic for the 2D rectangular packing and strip packing problems. / Wei, Lijun; Oon, Wee-Chong; Zhu, Wenbin et al.
In: European Journal of Operational Research, Vol. 215, No. 2, 01.12.2011, p. 337-346.
In: European Journal of Operational Research, Vol. 215, No. 2, 01.12.2011, p. 337-346.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review