A heuristic for solving large bin packing problems in two and three dimensions

DOI10.1007/s10100-010-0184-1zbMath1339.90353OpenAlexW2086224008MaRDI QIDQ300728

Andreas Bortfeldt, Daniel Mack

Publication date: 28 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-010-0184-1

zbMATH Keywords

heuristicsbin packingSBSBPPsingle bin-size bin packing problemsingle stock-size cutting stock problemSSSCSP

Mathematics Subject Classification ID

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

Related Items

Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ A hybrid algorithm for constrained order packing ⋮ A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ The cutting stock problem applied to the hardening process in an automotive spring factory ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A two-stage packing problem procedure ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem

Uses Software

• TSpack

Cites Work

• Unnamed Item
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• A lower bound for the non-oriented two-dimensional bin packing problem
• A heuristic for multiple container loading problems
• An efficient approach for the multi-pallet loading problem
• Approximation algorithm for the oriented two-dimensional bin packing problem
• Heuristics for the container loading problem
• Heuristic algorithms for the three-dimensional bin packing problem
• A bottleneck assignment approach to the multiple container loading problem
• An improved typology of cutting and packing problems
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• A greedy search for the three-dimensional bin packing problem: the packing static stability case
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• The Three-Dimensional Bin Packing Problem
• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• Handbook of metaheuristics