A comparative review of 3D container loading algorithms
From MaRDI portal
Recommendations
- An Efficient Algorithm for Solving the Container Loading Problem
- Approximate algorithms for the container loading problem
- Constraints in container loading -- a state-of-the-art review
- A tree search algorithm for solving the container loading problem
- A heuristic for multiple container loading problems
Cites work
- 3-D container packing heuristics
- A 3D-BPP approach for optimising stowage plans and terminal productivity
- A beam search approach to the container loading problem
- A bottleneck assignment approach to the multiple container loading problem
- A caving degree approach for the single container loading problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A comparative evaluation of heuristics for container loading
- A computer-based heuristic for packing pooled shipment containers
- A general purpose algorithm for three-dimensional packing
- A Genetic Algorithm for Solving the Container Loading Problem
- A global optimization algorithm for the three-dimensional packing problem
- A global search framework for practical three-dimensional packing with variable carton orientations
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- A heuristic for multiple container loading problems
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- A heuristic for the three-dimensional strip packing problem
- A hybrid genetic algorithm for the container loading problem
- A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
- A hybrid placement strategy for the three-dimensional strip packing problem
- A linear programming approach for the three-dimensional bin-packing problem
- A maximal-space algorithm for the container loading problem
- A Method for Solving Container Packing for a Single Size of Box
- A new heuristic algorithm for cuboids packing with no orientation constraints
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A novel hybrid tabu search approach to container loading
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A particular approach for the three-dimensional packing problem with additional constraints
- A prototype column generation strategy for the multiple container loading problem
- A space-indexed formulation of packing boxes into a larger box
- A tree search algorithm for solving the container loading problem
- A tree search method for the container loading problem with shipment priority
- Allowing for weight considerations in container loading
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- An analytical model for the container loading problem
- An AND/OR-graph approach to the container loading problem
- An efficient placement heuristic for three-dimensional rectangular packing
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An improved typology of cutting and packing problems
- Applying genetic algorithms and neural networks to the container loading problem
- Applying spatial representation techniques to the container packing problem
- Approximate algorithms for the container loading problem
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- Constraints in container loading -- a state-of-the-art review
- Container loading with multi-drop constraints
- Dynamic multi-dimensional bin packing
- Effective methods for a container packing operation
- Extreme point-based heuristics for three-dimensional bin packing
- Guided local search for the three-dimensional bin-packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Heuristics for the container loading problem
- Heuristics with a new block strategy for the single and multiple containers loading problems
- scientific article; zbMATH DE number 21364 (Why is no real title available?)
- Load planning for shipments of low density products
- MIP-based approaches for the container loading problem with multi-drop constraints
- Multi-dimensional bin packing problems with guillotine constraints
- Neighborhood structures for the container loading problem: a VNS implementation
- New lower bounds for the three-dimensional finite bin packing problem
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- On the three-dimensional container packing problem under home delivery service
- Packing small boxes into a big box.
- Solving container loading problems by block arrangement
- The multiple container loading cost minimization problem
- The Three-Dimensional Bin Packing Problem
- Three-dimensional bin packing problem with variable bin height
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Three-dimensional packing of items with limited load bearing strength
- Three-dimensional packings with rotations
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- Weight distribution considerations in container loading
Cited in
(39)- Solving a large multicontainer loading problem in the car manufacturing industry
- A MIP-based slicing heuristic for three-dimensional bin packing
- 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
- A data-driven approach for mixed-case palletization with support
- Minimizing late deliveries in a truck loading problem
- The exact solutions of several types of container loading problems
- Constraints in container loading -- a state-of-the-art review
- 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
- A mathematical modeling approach to optimize composite parts placement in autoclave
- Approximate algorithms for the container loading problem
- Multi-variant optimization algorithm for three dimensional container loading problem
- Container packing problem with balance constraints
- An efficient method for the three-dimensional container loading problem by forming box sizes
- 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
- 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
- Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
- A two-phase constructive algorithm for the single container mix-loading problem
- A fast optimization approach for a complex real-life 3D multiple bin size bin packing problem
- On the multiple optimal solutions and patterns of the pallet loading problem
- Mathematical modeling and heuristic solutions for container loading and routing problem: a case study in a cable manufacturing company
- A block-building constraint programming model for the container loading problem
- A three-dimensional multiple containers loading approach considering weak heterogeneous containers for multiple customers
- Static stability versus packing efficiency in online three-dimensional packing problems: a new approach and a computational study
- Two-phase matheuristic for assignment and truck loading problems
- A tetris beam search algorithm for the distributor's pallet loading problem
- A tree search-based heuristic for the three-dimensional single container loading problem
- Standing on a common ground: a comparison of static stability approaches for pallet loading
- Integrated optimization of pallet selection and truck loading with multiple pallet sizes under axle weight and stability constraints
- From historical templates to hints: selecting effective initializations for the rack-loading problem
This page was built for publication: A comparative review of 3D container loading algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803269)
