MIP-based approaches for the container loading problem with multi-drop constraints
From MaRDI portal
Recommendations
- Container loading with multi-drop constraints
- scientific article; zbMATH DE number 1264414
- A bottleneck assignment approach to the multiple container loading problem
- The multiple container loading cost minimization problem
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Modeling soft unloading constraints in the multi-drop container loading problem
- Optimization models for the three-dimensional container loading problem with practical constraints
Cites work
- A comparative evaluation of heuristics for container loading
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- A heuristic approach to the three-dimensional cargo-loading problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- An Algorithm for Two-Dimensional Cutting Problems
- An AND/OR-graph approach to the container loading problem
- An efficient approach for the multi-pallet loading problem
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An integrated approach to the vehicle routing and container loading problems
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- Container loading with multi-drop constraints
- Load planning for shipments of low density products
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Solving container loading problems by block arrangement
- Three-dimensional container loading models with cargo stability and load bearing constraints
Cited in
(28)- MIP-based approaches for robust storage loading problems with stacking constraints
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- A MIP-based slicing heuristic for three-dimensional bin packing
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- A data-driven approach for mixed-case palletization with support
- A beam search algorithm for the biobjective container loading problem
- Multi-objective vehicle routing and loading with time window constraints: a real-life application
- Order and static stability into the strip packing problem
- Two-dimensional strip packing with unloading constraints
- 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
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Metaheuristics for truck loading in the car production industry
- Container loading with multi-drop constraints
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- scientific article; zbMATH DE number 1264414 (Why is no real title available?)
- A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- Optimization models for the three-dimensional container loading problem with practical constraints
- A large neighbourhood search algorithm for solving container loading problems
- Modeling soft unloading constraints in the multi-drop container loading problem
- The multiple container loading cost minimization problem
- A three-phase algorithm for the three-dimensional loading vehicle routing problem with split pickups and time windows
- Two-phase matheuristic for assignment and truck loading problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
This page was built for publication: MIP-based approaches for the container loading problem with multi-drop constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761749)
