Heuristic for the rectangular strip packing problem with rotation of items

Authors:
Yaodong Cui;Liu Yang;Qiulian Chen
Affiliations:
College of Computer Science and Electronic Information, Guangxi University, Nanning 530004, China;College of Computer Science and Electronic Information, Guangxi University, Nanning 530004, China;College of Computer Science and Electronic Information, Guangxi University, Nanning 530004, China
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 0

Heuristics for large strip packing problems with guillotine patterns: an empirical study

Metaheuristics
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting

INFORMS Journal on Computing
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
Reactive GRASP for the strip-packing problem

Computers and Operations Research
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

Computers and Operations Research
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems

Engineering Applications of Artificial Intelligence
Simple block patterns for the two-dimensional cutting problem

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a heuristic algorithm for the rectangular strip packing problem, where a set of rectangular items are packed orthogonally into a strip of definite width and infinite height, so as to minimize the required height. The items cannot overlap and rotation by 90 degrees is allowed. The solution contains several sections. The algorithm is based on a sequential grouping and value correction procedure that considers multiple candidate solutions. It generates each next section using a subset of the remaining items and then corrects the values of the included items. The algorithm is used to solve 13 groups of benchmark instances. It is able to improve the solution quality for all groups.