A constructive heuristic for the two-dimensional bin packing based on value correction Online publication date: Tue, 14-Feb-2017
by Yi Yao; Chaoan Lai; Yaodong Cui
International Journal of Computer Applications in Technology (IJCAT), Vol. 55, No. 1, 2017
Abstract: A heuristic approach for two-dimensional bin packing problems with guillotine-cut constraint is proposed to minimise bin usage by maximising space efficiency given fixed dimensions. Three effective concepts are combined into a single coherent heuristic: (1) higher value and packing priority is assigned to items considered more difficult to pack into residual spaces; (2) packing spaces are selected in descending order of area; and (3) expanding or merging residual small spaces will improve the utilisation rate, and unusable space should be added to the residual adjacent space set. Computational experiments on benchmark test sets suggest the approach rivals existing packing methods with potential for use in the two patterns of both RG and OG.
Online publication date: Tue, 14-Feb-2017
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 Computer Applications in Technology (IJCAT):
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 firstname.lastname@example.org