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
Integrating simulation and optimization to schedule loading operations in container terminals
Computers and Operations Research
Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information
Advanced Engineering Informatics
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
Embedding simulation in optimization algorithms will incur computational costs. For NP-hard problems the computational costs of the embedded simulation in the optimization algorithm are likely to be substantial. YC dispatching is NP-hard. So it is very important to be able to minimize simulation costs in YC dispatching algorithms. In the optimization algorithm for yard crane dispatching published, simulation of YC operations of the entire (partial) sequence of YC jobs are carried out each time the tardiness of a (partial) sequence needs to be evaluated. In this paper we study two approaches to reduce simulation costs in these embedded simulations in the optimization algorithm. Experimental results show that one approach significantly reduces the computational time of the optimization algorithm. We also analyze the reasons for the other approach which fails to reduce the computational time.