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
Integrating simulation and optimization to schedule loading operations in container terminals
Computers and Operations Research
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
Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information
Advanced Engineering Informatics
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 hierarchical scheme for yard crane (YC) workload management in container terminals. We also propose a time partitioning algorithm and a space partitioning algorithm for deploying YCs to handle changing job arrival patterns in a row of yard blocks. The main differences between our approach and most of the methods in literature are (1) the average vehicle job waiting time instead of the number of jobs is used to balance YC workload and to evaluate the quality of a partition, (2) the YC working zone assignment is not in units of yard blocks and our space partitioning algorithm generates more flexible divisions of the workload from all blocks, and (3) the YC deployment frequency is not fixed but is decided by our time partitioning algorithm with the objective of minimizing average vehicle waiting times. The scheme combines simulation and optimization to achieve our objective for a row of yard blocks. Experimental results show that the proposed binary partitioning algorithm TP2 makes substantial improvements in job waiting times over the basic partitioning scheme and another existing algorithm (Ng, W. C. 2005. Crane scheduling in container yards with intercrane interference. Eur. J. Oper. Res.164(1) 64--78) in all tested job arrival scenarios.