A block-based layer building approach for the 2D guillotine strip packing problem
From MaRDI portal
Publication:297057
DOI10.1016/j.ejor.2014.04.020zbMath1339.90291OpenAlexW2014459551MaRDI QIDQ297057
Lijun Wei, Tian Tian, Wenbin Zhu, Andrew E. B. Lim
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.020
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (9)
A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Heuristic for the rectangular strip packing problem with rotation of items
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Characterization and modelling of guillotine constraints
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A recursive algorithm for constrained two-dimensional cutting problems
- Guillotineable bin packing: A genetic approach
- Exact algorithms for the guillotine strip cutting/packing problem.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- A reference length approach for the 3D strip packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A prototype column generation strategy for the multiple container loading problem
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-Dimensional Finite Bin-Packing Algorithms
- 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
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
This page was built for publication: A block-based layer building approach for the 2D guillotine strip packing problem
