A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
From MaRDI portal
Publication:1761795
DOI10.1007/S10479-012-1084-7zbMath1269.90089OpenAlexW1972801990MaRDI QIDQ1761795
Andreas Bortfeldt, Sabine Jungmann
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1084-7
Related Items (8)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A global search framework for practical three-dimensional packing with variable carton orientations ⋮ Order and static stability into the strip packing problem ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ The exact solutions of several types of container loading problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact method for the 2D guillotine strip packing problem
- A hybrid placement strategy for the three-dimensional strip packing problem
- Reactive GRASP for the strip-packing problem
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Weight distribution considerations in container loading
- Guillotineable bin packing: A genetic approach
- 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
- A comparative evaluation of heuristics for container loading
- Heuristics for the container loading problem
- Exhaustive approaches to 2D rectangular perfect packings
- 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
- A heuristic for the three-dimensional strip packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- New heuristic and interactive approaches to 2D rectangular strip packing
This page was built for publication: A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
