A MIP-based slicing heuristic for three-dimensional bin packing
From MaRDI portal
Publication:1686545
DOI10.1007/S11590-017-1154-5zbMATH Open1386.90124OpenAlexW2621226977MaRDI QIDQ1686545FDOQ1686545
Fatma Gzara, Samir Elhedhli, Yi Feng Yan
Publication date: 15 December 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1154-5
Recommendations
- A data-driven approach for mixed-case palletization with support
- The pallet loading problem: three-dimensional bin packing with practical constraints
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A systematic approach for the three-dimensional palletization problem
- A particular approach for the three-dimensional packing problem with additional constraints
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- An improved typology of cutting and packing problems
- Extreme point-based heuristics for three-dimensional bin packing
- Heuristic algorithms for the three-dimensional bin packing 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
- Guided local search for the three-dimensional bin-packing problem
- A maximal-space algorithm for the container loading problem
- The Three-Dimensional Bin Packing Problem
- An analytical model for the container loading problem
- Optimal facility layout design
- 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
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- A Genetic Algorithm for Solving the Container Loading Problem
- Three-dimensional bin packing problem with variable bin height
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- Multi-dimensional bin packing problems with guillotine constraints
- A space-indexed formulation of packing boxes into a larger box
- A global optimization algorithm for the three-dimensional packing problem
- MIP-based approaches for the container loading problem with multi-drop constraints
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- A comparative review of 3D container loading algorithms
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem
Cited In (5)
- The exact solutions of several types of container loading problems
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem
- A data-driven approach for mixed-case palletization with support
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
Uses Software
This page was built for publication: A MIP-based slicing heuristic for three-dimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686545)
