Pages that link to "Item:Q342512"
From MaRDI portal
The following pages link to A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512):
Displayed 15 items.
- The bounded beam search algorithm for the block relocation problem (Q1634080) (← links)
- An exact algorithm for the unrestricted block relocation problem (Q1652624) (← links)
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm (Q1694329) (← links)
- Integer programming models for the pre-marshalling problem (Q1755240) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- Robust optimization for premarshalling with uncertain priority classes (Q2189929) (← links)
- An exact algorithm for the block relocation problem with a stowage plan (Q2315632) (← links)
- Deep learning assisted heuristic tree search for the container pre-marshalling problem (Q2333140) (← links)
- A branch and bound approach for large pre-marshalling problems (Q2424778) (← links)
- Pre-processing a container yard under limited available time (Q2664376) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- Optimizing the number of deployed yard cranes in a container terminal (Q5883816) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)
- Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem (Q6164614) (← links)