Applying triple-block patterns in solving the two-dimensional bin packing problem. Issue 3 (4th March 2018)

• Record Type: Journal Article
• Authors: Cui, Yi-Ping; Yao, Yi; Zhang, Defu
• Is Part Of: Journal of the Operational Research Society. Volume 69:Issue 3(2018)
• Page Start: 402
• Page End: 415
• Publication Date: 2018-03-04
• Subjects: Two-dimensional bin packing -- triple-block patterns -- cutting stock; Operations research -- Periodicals; 658.4034
• DOI: 10.1057/s41274-016-0148-5
• Languages: English
• ISSNs: 0160-5682

Abstract

Abstract: This paper presents a heuristic for the guillotine two-dimensional bin packing problem, where a set of rectangular items are packed using guillotine patterns into bins of the same size, such that the number of bins used is minimized. Both oriented and non-oriented items are considered. The algorithm considers a novel combination of three procedures. The first is a pattern-generation procedure that generates a set of triple-block patterns on each call. The second is a plan-generation procedure that uses some of these patterns to compose the solution. The third is a plan-improvement procedure that solves an integer linear programming model over a given set of patterns generated previously to improve the solution. According to the computational results, the heuristic can obtain very good solution quality. For some classes of instances, the gap to lower bound is reduced by more than 30% compared to algorithms recently published.