A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
From MaRDI portal
Publication:632697
DOI10.1016/j.cor.2010.12.013zbMath1208.90143OpenAlexW1993399041MaRDI QIDQ632697
Krzysztof Fleszar, Christoforos Charalambous
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.013
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (12)
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts ⋮ 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 ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
Cites Work
- Recent advances on two-dimensional bin packing problems
- An agent-based approach to the two-dimensional guillotine bin packing problem
- A lower bound for the non-oriented two-dimensional bin packing problem
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
This page was built for publication: A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
