An algorithm with performance guarantee for the online container relocation problem
From MaRDI portal
Publication:1751771
Recommendations
- An average-case asymptotic analysis of the container relocation problem
- Research on the model and heuristic algorithm of container relocation problem
- A mathematical formulation and efficient heuristics for the dynamic container relocation problem
- Solving the container relocation problem by an improved greedy look-ahead heuristic
- Optimizing pre-processing and relocation moves in the stochastic container relocation problem
Cites work
- A heuristic rule for relocating blocks
- A mathematical formulation and complexity considerations for the blocks relocation problem
- A mathematical formulation and efficient heuristics for the dynamic container relocation problem
- A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
- A tree search procedure for the container relocation problem
- Advanced methods for container stacking
- An average-case asymptotic analysis of the container relocation problem
- An improved mathematical formulation for the blocks relocation problem
- An investigation of IDA* algorithms for the container relocation problem
- An optimization model for the container pre-marshalling problem
- Applying the corridor method to a blocks relocation problem
- scientific article; zbMATH DE number 1688603 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- Models and algorithms for shuffling problems in steel plants
- Online rules for container stacking
- Storage space allocation models for inbound containers in an automatic container terminal
- The assignment of storage locations to containers for a container stack
- Tree search for the stacking problem
Cited in
(13)- The bounded beam search algorithm for the block relocation problem
- An exact algorithm for the unrestricted block relocation problem
- Online and offline container purchasing and repositioning problem
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
- An average-case asymptotic analysis of the container relocation problem
- An efficient ant colony optimization algorithm for the blocks relocation problem
- New integer programming models for slab stack shuffling problems
- An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
- On-line scheduling of empty containers
- scientific article; zbMATH DE number 1522930 (Why is no real title available?)
- Optimizing the number of deployed yard cranes in a container terminal
- Approximate dynamic programming for container stacking
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
This page was built for publication: An algorithm with performance guarantee for the online container relocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751771)
