A skyline heuristic for the 2D rectangular packing and strip packing problems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

52 Scopus Citations
View graph of relations

Author(s)

  • Lijun Wei
  • Wee-Chong Oon
  • Wenbin Zhu
  • Andrew Lim

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)337-346
Journal / PublicationEuropean Journal of Operational Research
Volume215
Issue number2
Publication statusPublished - 1 Dec 2011

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; Lim, Andrew.

In: European Journal of Operational Research, Vol. 215, No. 2, 01.12.2011, p. 337-346.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review