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

DOI10.1007/S10288-010-0133-9zbMATH Open1213.90153OpenAlexW2050975710MaRDI QIDQ538281FDOQ538281

Authors: Serena di Muro, F. Mosca, Claudio Sterle, Maurizio Boccia, Antonio Sforza 

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

Recommendations

• A heuristic algorithm for three-dimensional container loading problem with non-identical items
• A heuristic approach to the three-dimensional cargo-loading problem
• A heuristic for the three-dimensional strip packing problem
• A particular approach for the three-dimensional packing problem with additional constraints
• A heuristic for multiple container loading problems

zbMATH Keywords

3D loadingtrunk problem

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) Discrete location and assignment (90B80)

Cites Work

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

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

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