An improved heuristic and an exact algorithm for the 2D strip and bin packing problem Online publication date: Thu, 03-Dec-2009
by Abdelghani Bekrar, Imed Kacem, Chengbin Chu, Cherif Sadfi
International Journal of Product Development (IJPD), Vol. 10, No. 1/2/3, 2010
Abstract: In this paper, we consider a two-dimensional (2D) packing problem. It consists of packing a given set of rectangular items either into a strip with a fixed width and infinite height or into identical bins. This problem has industrial applications such as cutting glass and Very-Large-Scale Integration (VLSI) design. The guillotine constraint is imposed in this paper. For this problem, we propose some strategies to improve the Shelf Heuristic Filling (SHF) introduced by Ben Messaoud et al. (2003). In a second part, we present a branch-and-bound algorithm for the 2D Strip Packing (2SP) problem that uses a new lower bound and the improved heuristic. All our algorithms are tested on generated and literature-based instances and give good results compared to the existing algorithms.
Online publication date: Thu, 03-Dec-2009
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Product Development (IJPD):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com