A new heuristic algorithm for rectangle packing

DOI10.1016/J.COR.2005.12.005zbMath1123.90061OpenAlexW1973235702MaRDI QIDQ883288

Wenqi Huang, Ruchu Xu, Duan-bing Chen

Publication date: 4 June 2007

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

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

zbMATH Keywords

heuristic algorithmrectangle packingcaving degreecorner-occupying action

Mathematics Subject Classification ID

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

Related Items (21)

A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ A caving degree approach for the single container loading problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem ⋮ Corner occupying theorem for the two-dimensional integral rectangle packing problem ⋮ Rectangle packing with a recursive pilot method ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Integrated topology optimization with embedded movable holes based on combined description by material density and level sets ⋮ Integrated layout design of multi-component system ⋮ A new heuristic algorithm for cuboids packing with no orientation constraints ⋮ Spatial scheduling optimization algorithm for block assembly in shipbuilding ⋮ Numerical optimization method for packing regular convex polygons ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ Optimal packing configuration design with finite-circle method ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ An efficient deterministic optimization approach for rectangular packing problems

Cites Work

• An analytical model for the container loading problem
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An effective quasi-human based heuristic for solving the rectangle packing problem
• Two personification strategies for solving circles packing problem
• The two-dimensional bin packing problem with variable bin sizes and costs
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing

This page was built for publication: A new heuristic algorithm for rectangle packing