MIP-based heuristic for non-standard 3D-packing problems

DOI10.1007/s10288-007-0049-1zbMath1175.90428OpenAlexW2041809965WikidataQ126211791 ScholiaQ126211791MaRDI QIDQ1029557

Giorgio Fasano

Publication date: 13 July 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0049-1

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial aspects of packing and covering (05B40)

Related Items (11)

Modeling close packing of 3D objects ⋮ A data-driven approach for mixed-case palletization with support ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ Packing different cuboids with rotations and spheres into a cuboid ⋮ Optimization of 3D objects layout into a multiply connected domain with account for shortest distances ⋮ Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications

Uses Software

• TOPOS
• MathOptimizer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analytical model for the container loading problem
• An integer-programming-based heuristic for the balanced loading problem
• A 2-exchange heuristic for nesting problems
• \(\Phi\)-functions for complex 2D-objects
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• The two-dimensional bin packing problem with variable bin sizes and costs
• Fast neighborhood search for two- and three-dimensional nesting problems
• The Three-Dimensional Bin Packing Problem
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

This page was built for publication: MIP-based heuristic for non-standard 3D-packing problems