Bidirectional best-fit heuristic for orthogonal rectangular strip packing
From MaRDI portal
Publication:2267317
DOI10.1007/s10479-009-0642-0zbMath1184.90131MaRDI QIDQ2267317
Publication date: 1 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0642-0
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A skyline heuristic for the 2D rectangular packing and strip packing problems, A squeaky wheel optimisation methodology for two-dimensional strip packing, A reference length approach for the 3D strip packing problem, Order and static stability into the strip packing problem, An improved best-fit heuristic for the orthogonal strip packing problem
Cites Work
- Unnamed Item
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Reactive GRASP for the strip-packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- The trim-loss and assortment problems: A survey
- Cutting stock problems and solution procedures
- Packing problems
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Exhaustive approaches to 2D rectangular perfect packings
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing 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
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Orthogonal Packings in Two Dimensions
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- New heuristic and interactive approaches to 2D rectangular strip packing
