Pre-processing a container yard under limited available time
From MaRDI portal
Publication:2664376
Recommendations
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem
- An optimization model for the container pre-marshalling problem
- Yard crane scheduling for container storage, retrieval, and relocation
- A mathematical formulation and efficient heuristics for the dynamic container relocation problem
- Research on the model and heuristic algorithm of container relocation problem
Cites work
- A biased random-key genetic algorithm for the container pre-marshalling problem
- A branch and bound approach for large pre-marshalling problems
- A heuristic for retrieving containers from a yard
- A local-search based heuristic for the unrestricted block relocation problem
- A mathematical formulation and complexity considerations for the blocks relocation problem
- A mathematical formulation and efficient heuristics for the dynamic container relocation problem
- A multi-heuristic approach for solving the pre-marshalling problem
- A new effective unified model for solving the pre-marshalling and block relocation problems
- A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
- A tree search procedure for the container pre-marshalling problem
- An efficient ant colony optimization algorithm for the blocks relocation problem
- An exact algorithm for the unrestricted block relocation problem
- An improved mathematical formulation for the blocks relocation problem
- An optimization model for the container pre-marshalling problem
- Container relocation problem with time windows for container departure
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Integer programming models for the pre-marshalling problem
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- New insights on the block relocation problem
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- Solving the container relocation problem by an improved greedy look-ahead heuristic
- Storage yard operations in container terminals: literature overview, trends, and research directions
- Yard crane scheduling for container storage, retrieval, and relocation
Cited in
(12)- A feature-extraction-based lightweight convolutional and recurrent neural networks adaptive computing model for container terminal liner handling volume forecasting
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem
- An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes
- On the integration of the parallel stack loading problem with the block relocation problem
- A beam search algorithm for minimizing crane times in premarshalling problems
- Optimizing the number of deployed yard cranes in a container terminal
- Scheduling ASC and AGV considering direct, buffer, and hybrid modes for transferring containers
- A constraint programming approach for the premarshalling problem
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
- Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
- The container premarshalling problem under limited crane time: a constraint programming approach
- Container pre-Marshalling problem under the same-group exclusive strategy
This page was built for publication: Pre-processing a container yard under limited available time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664376)
