Constraints in container loading -- a state-of-the-art review
DOI10.1016/j.ejor.2012.12.006zbMath1317.90172OpenAlexW2048325170MaRDI QIDQ2355797
Andreas Bortfeldt, Gerhard Wäscher
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.12.006
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (77)
Uses Software
Cites Work
- A distributed global optimization method for packing problems
- An AND/OR-graph approach to the container loading problem
- Loading Multiple Pallets
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- Cylinder packing by simulated annealing
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- A hybrid genetic algorithm for the container loading problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing congruent hyperspheres into a hypersphere
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Routing problems with loading constraints
- A novel hybrid tabu search approach to container loading
- Dynamic multi-dimensional bin packing
- A hybrid placement strategy for the three-dimensional strip packing problem
- The multiple container loading cost minimization problem
- A tree search method for the container loading problem with shipment priority
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- An efficient placement heuristic for three-dimensional rectangular packing
- Stability aspects of pallet loading
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- An integrated approach to the vehicle routing and container loading problems
- Two- and three-dimensional parametric packing
- Layer-layout-based heuristics for loading homogeneous items into a single container
- 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
- A particular approach for the three-dimensional packing problem with additional constraints
- Multi-dimensional bin packing problems with guillotine constraints
- Translational packing of arbitrary polytopes
- Three-dimensional packings with rotations
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Heuristics for container loading of furniture
- Weight distribution considerations in container loading
- Loading plates with non-identical items
- An analytical model for the container loading problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- Integrated container loading software for pulp and paper industry
- On the effectivity of gradient methods for cutting stock problems
- Allowing for weight considerations in container loading
- Cube packing.
- Packing small boxes into a big box.
- Packing of various radii solid spheres into a parallelepiped.
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- An efficient approach for the multi-pallet loading problem
- A global optimization algorithm for the three-dimensional packing problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- A comparative evaluation of heuristics for container loading
- A computer-based heuristic for packing pooled shipment containers
- Load planning for shipments of low density products
- New lower bounds for the three-dimensional finite bin packing problem
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- Heuristic algorithms for the three-dimensional bin packing problem
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- A bottleneck assignment approach to the multiple container loading problem
- Conservative scales in packing problems
- Packing of unequal spheres and automated radiosurgical treatment planning
- Neighborhood structures for the container loading problem: a VNS implementation
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- A caving degree approach for the single container loading problem
- Minimizing the object dimensions in circle and sphere packing problems
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
- Three-dimensional packing of items with limited load bearing strength
- 3-D container packing heuristics
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A heuristic for the three-dimensional strip packing problem
- A 3D-BPP approach for optimising stowage plans and terminal productivity
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A General Purpose Algorithm for Three-Dimensional Packing
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Container loading with multi-drop constraints
- On Three-Dimensional Packing
- Solving the single-container loading problem by a fast heuristic method
- An asymptotic approximation algorithm for 3D-strip packing
- Heuristics with a new block strategy for the single and multiple containers loading problems
- A multi-start random constructive heuristic for the container loading problem
- An Efficient Algorithm for Solving the Container Loading Problem
- Practical Considerations of the Pallet-Loading Problem
- A heuristic approach to the three-dimensional cargo-loading problem
- A Genetic Algorithm for Solving the Container Loading Problem
- Heuristic algorithms for on-line packing in three dimensions
- A Method for Solving Container Packing for a Single Size of Box
- On-line packing with boxes of different sizes
- Interactive ILP procedures for stacking optimization for the 3D palletization problem
- A three-dimensional pallet loading method for single-size boxes
- Applying spatial representation techniques to the container packing problem
- A systematic approach for the three-dimensional palletization problem
- Approximate algorithms for the container loading problem
- Applying genetic algorithms and neural networks to the container loading problem
- 3D random stacking of weakly heterogeneous palletization problems
- The Three-Dimensional Bin Packing Problem
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
This page was built for publication: Constraints in container loading -- a state-of-the-art review