Authors: Yi Yao; Chaoan Lai; Yaodong Cui
Addresses: School of Business Administration, South China University of Technology, Guangzhou 510640, China; College of Computer and Electronics Information, Guangxi University, Nanning 530004, China ' School of Business Administration, South China University of Technology, Guangzhou 510640, China ' College of Computer and Electronics Information, Guangxi University, Nanning 530004, China
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.
Keywords: 2D bin packing; value correction; guillotine cut; heuristics; space merging; optimisation; bin usage; space efficiency; packing priority; residual spaces.
International Journal of Computer Applications in Technology, 2017 Vol.55 No.1, pp.12 - 21
Received: 08 May 2015
Accepted: 11 Oct 2015
Published online: 14 Feb 2017 *