An improved heuristic algorithm for 2D rectangle packing area minimization problems with central rectangles

2017 ◽  
Vol 66 ◽  
pp. 1-16 ◽  
Author(s):  
Lei Wu ◽  
Xue Tian ◽  
Jixu Zhang ◽  
Qi Liu ◽  
Wensheng Xiao ◽  
...  
Keyword(s):  
Heuristic Algorithm ◽  
Rectangle Packing ◽  
Minimization Problems ◽  
Area Minimization

An adaptive selection approach for the 2D rectangle packing area minimization problem

Omega ◽  
2018 ◽  
Vol 80 ◽  
pp. 22-30 ◽  
Author(s):  
Lijun Wei ◽  
Wenbin Zhu ◽  
Andrew Lim ◽  
Qiang Liu ◽  
Xin Chen
Keyword(s):  
Minimization Problem ◽  
Adaptive Selection ◽  
Rectangle Packing ◽  
Area Minimization ◽  
Selection Approach

A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM

2007 ◽  
Vol 24 (04) ◽  
pp. 463-478 ◽  
Author(s):  
DUANBING CHEN ◽  
WENQI HUANG
Keyword(s):  
Heuristic Algorithm ◽  
Heuristic Algorithms ◽  
Packing Problem ◽  
Industrial Applications ◽  
Rectangle Packing ◽  
Simulated Annealing Genetic Algorithm ◽  
Rectangular Container ◽  
Glass Cutting ◽  
Integrated Performance ◽  
Rectangle Packing Problem

The constrained rectangle-packing problem is the problem of packing a subset of rectangles into a larger rectangular container, with the objective of maximizing the layout value. It has many industrial applications such as shipping, wood and glass cutting, etc. Many algorithms have been proposed to solve it, for example, simulated annealing, genetic algorithm and other heuristic algorithms. In this paper a new heuristic algorithm is proposed based on two strategies: the rectangle selecting strategy and the rectangle packing strategy. We have applied the algorithm to 21 smaller, 630 larger and other zero-waste instances. The computational results demonstrate that the integrated performance of the algorithm is rather satisfying and the algorithm developed is fairly efficient for solving the constrained rectangle-packing problem.

Sign in / Sign up

Export Citation Format

Share Document