A skyline-based heuristic for the 2D rectangular strip packing problem

Authors:
Lijun Wei;Andrew Lim;Wenbin Zhu
Affiliations:
Department of Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong;Department of Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong;Department of Computer Science, Hong Kong Univ. of Science and Technology, Kowloon, Hong Kong
Venue:
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Year:
2011

Citing 4
Cited 1

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
Reactive GRASP for the strip-packing problem

Computers and Operations Research
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem

INFORMS Journal on Computing

Smart energy case study

BuildSys '12 Proceedings of the Fourth ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Buildings

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a greedy heuristic for the 2D rectangular packing problem that represents packings using a skyline. To solve the 2D rectangular strip packing problem, we make use of this heuristic as a subroutine in an iterative deepening binary search on the maximum height of the packing that incorporates a tabu search mechanic. Our approach outperforms all existing approaches on several sets of standard benchmark test cases for the 2D strip packing problem.