A fast heuristic for a three-dimensional non-convex domain loading problem

DOI10.1007/S10288-010-0133-9zbMath1213.90153OpenAlexW2050975710MaRDI QIDQ538281

Claudio Sterle, Serena di Muro, Francesco Mosca, Aantonio Sforza, Maurizio Boccia

Publication date: 25 May 2011

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

Full work available at URL: https://doi.org/10.1007/s10288-010-0133-9

zbMATH Keywords

3D loadingtrunk problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
• A new heuristic algorithm for cuboids packing with no orientation constraints
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• MIP-based heuristic for non-standard 3D-packing problems
• Weight distribution considerations in container loading
• An analytical model for the container loading problem
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• A tabu search algorithm for weakly heterogeneous container loading problems
• Packing small boxes into a big box.
• An efficient approach for the multi-pallet loading problem
• A typology of cutting and packing problems
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• \(\Phi\)-functions for complex 2D-objects
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• Neighborhood structures for the container loading problem: a VNS implementation
• Mathematical modeling of interactions of primary geometric 3D objects
• Three-dimensional packing of items with limited load bearing strength
• An improved typology of cutting and packing problems
• A Maximal-Space Algorithm for the Container Loading Problem
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• PACKING A TRUCK — NOW WITH A TWIST!
• A Genetic Algorithm for Solving the Container Loading Problem
• A Method for Solving Container Packing for a Single Size of Box
• Construction of a Φ-function for two convex polytopes
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• Algorithms - ESA 2003
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: A fast heuristic for a three-dimensional non-convex domain loading problem