Three-dimensional packing of items with limited load bearing strength
From MaRDI portal
Publication:2569082
DOI10.1016/J.EJOR.2004.04.037zbMATH Open1083.90033OpenAlexW2080643267MaRDI QIDQ2569082FDOQ2569082
Authors: Eberhard E. Bischoff 
Publication date: 17 October 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.037
Recommendations
- Allowing for weight considerations in container loading
- A heuristic algorithm for three-dimensional container loading problem with non-identical items
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A heuristic for multiple container loading problems
- A comparative evaluation of heuristics for container loading
Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Combinatorial optimization (90C27)
Cites Work
- A Simplex Method for Function Minimization
- 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
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- Heuristics for the container loading problem
- Loading plates with non-identical items
- A tabu search algorithm for weakly heterogeneous container loading problems
- A comparative evaluation of heuristics for container loading
- A Genetic Algorithm for Solving the Container Loading Problem
- A hybrid genetic algorithm for the container loading problem
- Loading Multiple Pallets
- A computer-based heuristic for packing pooled shipment containers
- Applying spatial representation techniques to the container packing problem
- Allowing for weight considerations in container loading
Cited In (35)
- A fast heuristic for a three-dimensional non-convex domain loading problem
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Container loading with multi-drop constraints
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- An integrated approach to the vehicle routing and container loading problems
- A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
- Analysing trade-offs in container loading: combining load plan construction heuristics with agent-based simulation
- Weight distribution in container loading: a case study
- Optimization models for the three-dimensional container loading problem with practical constraints
- The forgotten sons: warehousing systems for brick-and-mortar retail chains
- A quasi-human algorithm for solving the three-dimensional rectangular packing problem
- Modeling close packing of 3D objects
- The disruptive anti-covering location problem
- An efficient placement heuristic for three-dimensional rectangular packing
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- Data structures for higher-dimensional rectilinear packing
- Packing problems
- A tree search method for the container loading problem with shipment priority
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- Heuristics for container loading of furniture
- A data-driven approach for mixed-case palletization with support
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- A novel hybrid tabu search approach to container loading
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A comparative review of 3D container loading algorithms
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A MIP-based slicing heuristic for three-dimensional bin packing
- Neighborhood structures for the container loading problem: a VNS implementation
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- Constraints in container loading -- a state-of-the-art review
- Layer-layout-based heuristics for loading homogeneous items into a single container
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Necessity and complexity of order picking routing optimisation based on pallet loading features
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- A caving degree approach for the single container loading problem
This page was built for publication: Three-dimensional packing of items with limited load bearing strength
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569082)
