A data-driven approach for mixed-case palletization with support
From MaRDI portal
Publication:2168642
DOI10.1007/S11081-021-09673-5zbMATH Open1498.90186OpenAlexW3198051614MaRDI QIDQ2168642FDOQ2168642
Authors: Paulo R. V. de Carvalho, Samir Elhedhli 
Publication date: 26 August 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-021-09673-5
Recommendations
- A MIP-based slicing heuristic for three-dimensional bin packing
- The pallet loading problem: three-dimensional bin packing with practical constraints
- Improving palletisation efficiency—the theoretical basis and practical application
- A systematic approach for the three-dimensional palletization problem
- An efficient approach for the multi-pallet loading problem
pallet loadingthree-dimensional bin packingdata-driven optimizationmixed-case palletizationvertical support
Cites Work
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Extreme point-based heuristics for three-dimensional bin packing
- Heuristic algorithms for the three-dimensional bin packing problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- A prototype column generation strategy for the multiple container loading problem
- Constraints in container loading -- a state-of-the-art review
- Guided local search for the three-dimensional bin-packing problem
- The Three-Dimensional Bin Packing Problem
- Heuristics for the container loading problem
- MIP-based heuristic for non-standard 3D-packing problems
- An analytical model for the container loading problem
- Three-dimensional packing of items with limited load bearing strength
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A comparative evaluation of heuristics for container loading
- Three-dimensional bin packing problem with variable bin height
- The three-dimensional knapsack problem with balancing constraints
- A space-indexed formulation of packing boxes into a larger box
- A MIP approach for some practical packing problems: balancing constraints and tetris-like items
- A global optimization algorithm for the three-dimensional packing problem
- MIP-based approaches for the container loading problem with multi-drop constraints
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- A comparative review of 3D container loading algorithms
- A MIP-based slicing heuristic for three-dimensional bin packing
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
Cited In (2)
This page was built for publication: A data-driven approach for mixed-case palletization with support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168642)
