MIP-based approaches for the container loading problem with multi-drop constraints
From MaRDI portal
Publication:1761749
DOI10.1007/s10479-011-0942-zzbMath1251.90324OpenAlexW2052751981WikidataQ57719460 ScholiaQ57719460MaRDI QIDQ1761749
Leonardo Junqueira, Reinaldo Morabito
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0942-z
combinatorial optimizationmathematical modelingcutting and packing problemsmulti-drop constraintsthree-dimensional container loading
Related Items (21)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ A global optimization approach for solving three-dimensional open dimension rectangular packing problems ⋮ Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ A data-driven approach for mixed-case palletization with support ⋮ A beam search algorithm for the biobjective container loading problem ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ Metaheuristics for truck loading in the car production industry ⋮ Two-dimensional strip packing with unloading constraints ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Order and static stability into the strip packing problem ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions ⋮ Weight distribution in container loading: a case study ⋮ 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 ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints
Cites Work
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- An integrated approach to the vehicle routing and container loading problems
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- An efficient approach for the multi-pallet loading problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A comparative evaluation of heuristics for container loading
- Load planning for shipments of low density products
- Solving container loading problems by block arrangement
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- Container loading with multi-drop constraints
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A heuristic approach to the three-dimensional cargo-loading problem
- An Algorithm for Two-Dimensional Cutting Problems
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- An AND/OR-graph approach to the container loading problem
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
This page was built for publication: MIP-based approaches for the container loading problem with multi-drop constraints
