Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
From MaRDI portal
Publication:339606
DOI10.1016/j.cor.2012.07.016zbMath1349.90856OpenAlexW2076474300MaRDI QIDQ339606
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.016
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (15)
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 ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
Cites Work
- Unnamed Item
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Recent advances on two-dimensional bin packing problems
- An agent-based approach to the two-dimensional guillotine bin packing problem
- Guillotineable bin packing: A genetic approach
- Heuristic algorithms for the multiple knapsack problem
- A lower bound for the non-oriented two-dimensional bin packing problem
- Justification and RCPSP: a technique that pays
- 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
- 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: Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
