A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
From MaRDI portal
Publication:1752837
Recommendations
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- A heuristic for multiple container loading problems
- Solving a large multicontainer loading problem in the car manufacturing industry
- An efficient method for the three-dimensional container loading problem by forming box sizes
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
Cites work
- A beam search approach to the container loading problem
- A comparative review of 3D container loading algorithms
- A Genetic Algorithm for Solving the Container Loading Problem
- A hybrid genetic algorithm for the container loading problem
- A maximal-space algorithm for the container loading problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A tabu search algorithm for weakly heterogeneous container loading problems
- A tree search method for the container loading problem with shipment priority
- An improved typology of cutting and packing problems
- Applying spatial representation techniques to the container packing problem
- Constraints in container loading -- a state-of-the-art review
- Extreme point-based heuristics for three-dimensional bin packing
- Guided local search for the three-dimensional bin-packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Loading plates with non-identical items
- SCIP: solving constraint integer programs
- Solving container loading problems by block arrangement
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- The multiple container loading cost minimization problem
- The Three-Dimensional Bin Packing Problem
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Two-dimensional packing problems: a survey
Cited in
(24)- A heuristic for multiple container loading problems
- Solving a large multicontainer loading problem in the car manufacturing industry
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
- Adaptive large neighborhood search for solving the circle bin packing problem
- 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
- Minimizing late deliveries in a truck loading problem
- Inbound and outbound flow integration for cross-docking operations
- The exact solutions of several types of container loading problems
- Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer
- Multi-dimensional commodity covering for tariff selection in transportation
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- The multiple container loading problem with preference
- An efficient method for the three-dimensional container loading problem by forming box sizes
- Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
- A large neighbourhood search algorithm for solving container loading problems
- The multiple container loading problem with loading docks
- A block-building constraint programming model for the container loading problem
- A three-dimensional multiple containers loading approach considering weak heterogeneous containers for multiple customers
- A tree search-based heuristic for the three-dimensional single container loading problem
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
This page was built for publication: A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752837)
