A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
From MaRDI portal
Publication:1015322
DOI10.1016/J.DISOPT.2008.11.002zbMATH Open1159.90527OpenAlexW2058477004MaRDI QIDQ1015322FDOQ1015322
Authors: Nthabiseng Ntene, J. H. van Vuuren 
Publication date: 7 May 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2008.11.002
Recommendations
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- scientific article; zbMATH DE number 4059096
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- A block-based layer building approach for the 2D guillotine strip packing problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- An improved typology of cutting and packing problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A near-optimal solution to a two-dimensional cutting stock problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Two-dimensional packing problems: a survey
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- An exact approach to the strip-packing problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Title not available (Why is that?)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Recent advances on two-dimensional bin packing problems
- Packing problems
- A 2.5 times optimal algorithm for packing in two dimensions
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- Online strip packing with modifiable boxes
- Evaluation of algorithms for one-dimensional cutting
- Title not available (Why is that?)
Cited In (18)
- Exact solution techniques for two-dimensional cutting and packing
- 2DPackLib: a two-dimensional cutting and packing library
- Title not available (Why is that?)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Metaheuristics for truck loading in the car production industry
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Upper bounds for heuristic approaches to the strip packing problem
- Triple-solution approach for the strip packing problem with two-staged patterns
- On contiguous and non-contiguous parallel task scheduling
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- New heuristic and interactive approaches to 2D rectangular strip packing
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Order and static stability into the strip packing problem
Uses Software
This page was built for publication: A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015322)
