A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem

DOI10.1016/j.disopt.2008.11.002zbMath1159.90527OpenAlexW2058477004MaRDI QIDQ1015322

Jan H. van Vuuren, Nthabiseng Ntene

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

zbMATH Keywords

strip packing problemlevel algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (14)

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 goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ On contiguous and non-contiguous parallel task scheduling ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Metaheuristics for truck loading in the car production industry ⋮ Order and static stability into the strip packing problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ 2DPackLib: a two-dimensional cutting and packing library

Uses Software

• Visual Basic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent advances on two-dimensional bin packing problems
• A 2.5 times optimal algorithm for packing in two dimensions
• Packing problems
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Evaluation of algorithms for one-dimensional cutting
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• Two-dimensional packing problems: a survey
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• An improved typology of cutting and packing problems
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• An Exact Approach to the Strip-Packing Problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• An Algorithm for Two-Dimensional Cutting Problems
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• Online strip packing with modifiable boxes

This page was built for publication: A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem