An efficient deterministic heuristic for two-dimensional rectangular packing
From MaRDI portal
Publication:1762123
DOI10.1016/j.cor.2011.08.005zbMath1251.90321OpenAlexW2007771215MaRDI QIDQ1762123
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.005
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)
Related Items (17)
Dynamic reduction heuristics for the rectangle packing area minimization problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ An action-space-based global optimization algorithm for packing circles into a square container ⋮ A memetic algorithm to pack unequal circles into a square ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules ⋮ A quasi-Newton-based floorplanner for fixed-outline floorplanning ⋮ Rectangle packing with a recursive pilot method ⋮ Spatial scheduling optimization algorithm for block assembly in shipbuilding ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ The maximum diversity assortment selection problem ⋮ Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
Cites Work
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- An efficient placement heuristic for three-dimensional rectangular packing
- A provably efficient algorithm for dynamic storage allocation
- Reactive GRASP for the strip-packing problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- On genetic algorithms for the packing of polygons
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- 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
- An effective quasi-human based heuristic for solving the rectangle packing problem
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- An Application of Bin-Packing to Multiprocessor Scheduling
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
This page was built for publication: An efficient deterministic heuristic for two-dimensional rectangular packing
