A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
From MaRDI portal
Publication:2803262
DOI10.1111/itor.12111zbMath1338.90350OpenAlexW2006365317MaRDI QIDQ2803262
Michaël Schyns, Sabine Limbourg, Célia Paquay
Publication date: 4 May 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://orbi.uliege.be/handle/2268/159225
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Related Items (21)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ The airline container loading problem with pickup and delivery ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ A data-driven approach for mixed-case palletization with support ⋮ Unnamed Item ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization ⋮ A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority ⋮ The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading problem with loading docks ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ The air cargo load planning problem -- a consolidated problem definition and literature review on related problems ⋮ 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 ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ Three-stage heuristic algorithm for three-dimensional irregular packing problem ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
Cites Work
- The three-dimensional knapsack problem with balancing constraints
- A particular approach for the three-dimensional packing problem with additional constraints
- Weight distribution considerations in container loading
- An analytical model for the container loading problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Packing small boxes into a big box.
- An efficient approach for the multi-pallet loading problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Constraints in container loading -- a state-of-the-art review
- An improved typology of cutting and packing problems
- A General Purpose Algorithm for Three-Dimensional Packing
- Optimal aircraft load balancing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A Genetic Algorithm for Solving the Container Loading Problem
- Balanced Loading
- An Algorithm for Two-Dimensional Cutting Problems
- The Three-Dimensional Bin Packing Problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
