A MIP-based slicing heuristic for three-dimensional bin packing
From MaRDI portal
Publication:1686545
DOI10.1007/S11590-017-1154-5zbMath1386.90124OpenAlexW2621226977MaRDI QIDQ1686545
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
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
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 ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ The exact solutions of several types of container loading problems
Uses Software
Cites Work
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- A space-indexed formulation of packing boxes into a larger box
- Multi-dimensional bin packing problems with guillotine constraints
- Three-dimensional bin packing problem with variable bin height
- An analytical model for the container loading problem
- Optimal facility layout design
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- A global optimization algorithm for the three-dimensional packing problem
- MIP-based approaches for the container loading problem with multi-drop constraints
- 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
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Three-dimensional packing of items with limited load bearing strength
- An improved typology of cutting and packing problems
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A comparative review of 3D container loading algorithms
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- A Genetic Algorithm for Solving the Container Loading Problem
- The Three-Dimensional Bin Packing Problem
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
This page was built for publication: A MIP-based slicing heuristic for three-dimensional bin packing
