A comparative review of 3D container loading algorithms
From MaRDI portal
Publication:2803269
DOI10.1111/itor.12094zbMath1338.90360OpenAlexW2096882197MaRDI QIDQ2803269
Julia A. Bennell, Xiaozhou Zhao, Tolga Bektaş, Kath Dowsland
Publication date: 4 May 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/364226/1/A%2520Comparative%2520Review%2520of%25203D%2520Container%2520Loading%2520Algorithms.pdf
Related Items (21)
Solving a large multicontainer loading problem in the car manufacturing industry ⋮ A data-driven approach for mixed-case palletization with support ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ Extracting maximal objects from three-dimensional solid materials ⋮ The pallet-loading vehicle routing problem with stability constraints ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ Minimizing late deliveries in a truck loading problem ⋮ A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading problem with loading docks ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A mathematical modeling approach to optimize composite parts placement in autoclave ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem ⋮ A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints ⋮ The exact solutions of several types of container loading problems
Cites Work
- Unnamed Item
- Unnamed Item
- A beam search approach to the container loading problem
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- A space-indexed formulation of packing boxes into a larger box
- 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
- 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
- Three-dimensional packings with rotations
- Three-dimensional bin packing problem with variable bin height
- Weight distribution considerations in container loading
- An analytical model for the container loading problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- Effective methods for a container packing operation
- Allowing for weight considerations in container loading
- Packing small boxes into a big box.
- A heuristic for multiple container loading problems
- A global optimization algorithm for the three-dimensional packing problem
- A global search framework for practical three-dimensional packing with variable carton orientations
- MIP-based approaches for the container loading problem with multi-drop constraints
- 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
- 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
- A bottleneck assignment approach to the multiple container loading problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A prototype column generation strategy for the multiple container loading problem
- Neighborhood structures for the container loading problem: a VNS implementation
- Constraints in container loading -- a state-of-the-art review
- 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
- A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
- Three-dimensional packing of items with limited load bearing strength
- 3-D container packing heuristics
- An improved typology of cutting and packing 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
- ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE
- 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
- Heuristics with a new block strategy for the single and multiple containers loading problems
- A Genetic Algorithm for Solving the Container Loading Problem
- A Method for Solving Container Packing for a Single Size of Box
- Applying spatial representation techniques to the container packing problem
- Approximate algorithms for the container loading problem
- Applying genetic algorithms and neural networks to the container loading problem
- The Three-Dimensional Bin Packing Problem
- An AND/OR-graph approach to the container loading problem
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A comparative review of 3D container loading algorithms
