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