Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints

DOI10.1016/j.dam.2015.09.012zbMath1358.90119OpenAlexW1755315633MaRDI QIDQ729798

Enrico Pietrobuoni, Michele Monaci, Andrea Lodi

Publication date: 22 December 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.012

zbMATH Keywords

computational experimentsheuristic algorithmstwo-dimensional packingguillotine cuts

Mathematics Subject Classification ID

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

Related Items

A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints, An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Minimum tiling of a rectangle by squares, A beam search approach to solve the convex irregular bin packing problem with guillotine guts, An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem, Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems

Cites Work

• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• An agent-based approach to the two-dimensional guillotine bin packing problem
• Exact algorithms for the two-dimensional guillotine knapsack
• Models and bounds for two-dimensional level packing problems
• 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
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Multistage Cutting Stock Problems of Two and More Dimensions