Solving the robust container pre-marshalling problem
From MaRDI portal
Recommendations
- A branch and bound approach for large pre-marshalling problems
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- A feasibility-based heuristic for the container pre-marshalling problem
- A branch and price procedure for the container premarshalling problem
- Robust optimization for premarshalling with uncertain priority classes
Cited in
(16)- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- A feasibility-based heuristic for the container pre-marshalling problem
- Integer programming models for the pre-marshalling problem
- Robust storage assignment in stack- and queue-based storage systems
- Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
- Robust optimization for premarshalling with uncertain priority classes
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem
- An exact algorithm for the block relocation problem with a stowage plan
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- A multi-heuristic approach for solving the pre-marshalling problem
- A branch and bound approach for large pre-marshalling problems
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A tree search procedure for the container pre-marshalling problem
- A constraint programming approach for the premarshalling problem
- Container pre-Marshalling problem under the same-group exclusive strategy
- An optimization model for the container pre-marshalling problem
This page was built for publication: Solving the robust container pre-marshalling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680086)
