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

DOI10.1007/S10288-007-0049-1MaRDI QIDQ1029557zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• Solving Non-standard Packing Problems by Global Optimization and Heuristics
• scientific article; zbMATH DE number 2050783
• Heuristic algorithms for the three-dimensional bin packing problem
• The Three-Dimensional Bin Packing Problem

Cites work

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

Cited in

(14)

• Packing different cuboids with rotations and spheres into a cuboid
• A fast heuristic for a three-dimensional non-convex domain loading problem
• A global optimization point of view to handle non-standard object packing problems
• Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
• Approximated solutions to a 3D-packing MIP model by a non-linear approach
• Benchmarking nonlinear optimization software in technical computing environments
• Optimized object packings using quasi-phi-functions
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• Optimization models for the three-dimensional container loading problem with practical constraints
• Modeling close packing of 3D objects
• A data-driven approach for mixed-case palletization with support
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• Exploiting packing components in general-purpose integer programming solvers
• Solving Non-standard Packing Problems by Global Optimization and Heuristics

Describes a project that uses

Uses Software

• MathOptimizer
• TOPOS

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

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