Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals
Transportation Science
Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations
Transportation Science
Interblock Crane Deployment in Container Terminals
Transportation Science
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Performing A* Search for Yard Crane Dispatching in Container Terminals
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
A simulation based hybrid algorithm for yard crane dispatching in container terminals
Winter Simulation Conference
A three-level hierarchical workload management scheme for yard cranes in container terminals
ICCL'11 Proceedings of the Second international conference on Computational logistics
| Hi-index | 0.00 |
We propose a new YC workload partitioning scheme which employs dynamic data driven simulations to conduct what-if experiments in container terminals. Both the optimal partition of the workload in a row of yard blocks and the optimal dispatching sequences for individual YCs are achieved. The practical consideration of the safety constraints is included. A dynamic programming (DP) approach is used to avoid re-computation. An efficient two stage workload partition algorithm (TSWP) is proposed which successfully reduces the number of full what-if simulations while maintaining solution optimality. An effective lower bound (LB) generator with adjustable LB accuracy is designed in supporting the TSWP algorithm. Experimental results show that the TSWP algorithm outperforms the pure DP approach in all tested scenarios and takes less than 1 part per thousand computational time of the DP approach.