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

DOI10.1016/J.DAM.2015.09.012MaRDI QIDQ729798zbMATH OpenOpenAlexFDO

Authors Andrea Lodi, Michele Monaci, Enrico Pietrobuoni

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 experimentsguillotine cutsheuristic algorithmstwo-dimensional packing

Mathematics Subject Classification ID

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

Recommendations

• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
• An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
• An exact method for the 2D guillotine strip packing problem

Cites work

• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• A set-covering-based heuristic approach for bin-packing problems
• An agent-based approach to the two-dimensional guillotine bin packing problem
• An improved typology of cutting and packing problems
• Exact algorithms for the two-dimensional guillotine knapsack
• Exact solution of the two-dimensional finite bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Models and algorithms for three-stage two-dimensional bin packing
• Models and bounds for two-dimensional level packing problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Two-Dimensional Finite Bin-Packing Algorithms
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Cited in

(14)

• An agent-based approach to the two-dimensional guillotine bin packing problem
• 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
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
• Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems
• 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
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• scientific article; zbMATH DE number 1488076 (Why is no real title available?)
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Tight approximation algorithms for 2D guillotine strip packing
• On guillotine separable packings for the two-dimensional geometric knapsack problem
• Multi-dimensional bin packing problems with guillotine constraints

This page was built for publication: Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q729798)