An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

DOI10.1016/j.cor.2009.09.011zbMath1178.90284OpenAlexW2027366366MaRDI QIDQ2654397

Yan Fu, Duan-bing Chen, Ming-Sheng Shang, Jing-Fa Liu

Publication date: 15 January 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.09.011

zbMATH Keywords

heuristic algorithmcaving degreecorner-occupying actionrectilinear block packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ A new heuristic algorithm for the circular packing problem with equilibrium constraints

Cites Work

• An exact algorithm for generating homogeneous T-shape cutting patterns
• A new heuristic algorithm for rectangle packing
• A recursive algorithm for constrained two-dimensional cutting problems
• Heuristics for the container loading problem
• Two-dimensional packing problems: a survey
• An effective quasi-human based heuristic for solving the rectangle packing problem
• Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM

This page was built for publication: An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem