The multiple container loading problem with preference
From MaRDI portal
Recommendations
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- The multiple container loading cost minimization problem
- Multiple Container Packing: A Case Study of Pipe Packing
- A heuristic for multiple container loading problems
- A bottleneck assignment approach to the multiple container loading problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A Genetic Algorithm for Solving the Container Loading Problem
- A bottleneck assignment approach to the multiple container loading problem
- A caving degree approach for the single container loading problem
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A hybrid genetic algorithm for the container loading problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A parallel hybrid local search algorithm for the container loading problem
- A prototype column generation strategy for the multiple container loading problem
- A tree search algorithm for solving the container loading problem
- A tree search method for the container loading problem with shipment priority
- An AND/OR-graph approach to the container loading problem
- An efficient approach for the multi-pallet loading problem
- An efficient placement heuristic for three-dimensional rectangular packing
- An improved typology of cutting and packing problems
- 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
- Heuristics for the container loading problem
- Neighborhood structures for the container loading problem: a VNS implementation
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Solving container loading problems by block arrangement
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- The Three-Dimensional Bin Packing Problem
- The multiple container loading cost minimization problem
Cited in
(15)- A beam search algorithm for the biobjective container loading problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Formalizing spatial configuration optimization problems with the use of a special function class
- 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
- The multiple container loading cost minimization problem
- Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
- Minimizing late deliveries in a truck loading problem
- Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
- The exact solutions of several types of container loading problems
- A heuristic algorithm for container loading of pallets with infill boxes
- scientific article; zbMATH DE number 1264414 (Why is no real title available?)
- A two-phase approach for single container loading with weakly heterogeneous boxes
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
This page was built for publication: The multiple container loading problem with preference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320625)
