A new heuristic algorithm for rectangle packing

DOI10.1016/J.COR.2005.12.005zbMATH Open1123.90061OpenAlexW1973235702MaRDI QIDQ883288FDOQ883288

Wenqi Huang, Duan-bing Chen, Ruchu Xu

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)

Cites Work

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

Cited In (29)

• New heuristic algorithms for the rectangular $p$-cover problem
• Spatial scheduling optimization algorithm for block assembly in shipbuilding
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• Computational Science – ICCS 2005
• Improved approximation algorithms for rectangle tiling and packing.
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• 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
• Integrated layout design of multi-component system
• An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
• Rectangle packing with a recursive pilot method
• 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
• A least wasted first heuristic algorithm for the rectangular packing problem
• Integrated topology optimization with embedded movable holes based on combined description by material density and level sets
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• An effective quasi-human based heuristic for solving the rectangle packing problem
• 4-block heuristic for the rectangle packing problem
• Use of genetic algorithms for solution of the rectangle packing problem
• Corner occupying theorem for the two-dimensional integral rectangle packing problem
• An efficient deterministic optimization approach for rectangular packing problems
• A caving degree approach for the single container loading problem
• Dynamic reduction heuristics for the rectangle packing area minimization problem
• Title not available (Why is that?)
• Numerical optimization method for packing regular convex polygons
• A new heuristic algorithm for cuboids packing with no orientation constraints
• Optimal packing configuration design with finite-circle method

   Recommendations

• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM 👍 👎
• Computational Science – ICCS 2005 👍 👎
• Use of genetic algorithms for solution of the rectangle packing problem 👍 👎
• An effective quasi-human based heuristic for solving the rectangle packing problem 👍 👎
• 4-block heuristic for the rectangle packing problem 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883288)