Approximate algorithms for the container loading problem
From MaRDI portal
Recommendations
Cited in
(21)- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- The exact solutions of several types of container loading problems
- A blockchain-based framework to optimize shipping container flows in the hinterland
- The multiple container loading cost minimization problem
- A heuristic algorithm for container loading of pallets with infill boxes
- Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study
- A matheuristic framework for the three-dimensional single large object placement problem with practical constraints
- scientific article; zbMATH DE number 1264414 (Why is no real title available?)
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- A heuristic for multiple container loading problems
- A tabu search algorithm for weakly heterogeneous container loading problems
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A comparative review of 3D container loading algorithms
- Neighborhood structures for the container loading problem: a VNS implementation
- Constraints in container loading -- a state-of-the-art review
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Approximate dynamic programming for container stacking
- A caving degree approach for the single container loading problem
- A new heuristic algorithm for cuboids packing with no orientation constraints
- A parallel hybrid local search algorithm for the container loading problem
This page was built for publication: Approximate algorithms for the container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4468894)
