A new heuristic recursive algorithm for the strip rectangular packing problem
From MaRDI portal
Publication:2489283
DOI10.1016/j.cor.2005.01.009zbMath1086.90068OpenAlexW2167690750MaRDI QIDQ2489283
Ansheng Deng, Yan Kang, Defu Zhang
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.009
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (22)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ An exact method for the 2D guillotine strip packing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A reference length approach for the 3D strip packing problem ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Reactive GRASP for the strip-packing problem ⋮ A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem ⋮ Heuristic algorithm for a cutting stock problem in the steel bridge construction ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
Cites Work
- Unnamed Item
- Packing problems
- On genetic algorithms for the packing of polygons
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- On the two-dimensional knapsack problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Heuristics for the container loading problem
- Two-dimensional packing problems: a survey
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Two-Dimensional Finite Bin-Packing Algorithms
- Approximation schemes for covering and packing problems in image processing and VLSI
This page was built for publication: A new heuristic recursive algorithm for the strip rectangular packing problem
