An optimal routing algorithm for a transfer crane in port container terminals

This paper focuses on how to optimally route transfer cranes in a container yard during loading operations of export containers at port terminals. Decision variables are the number of containers that a transfer crane picks up at each yard-bay and the sequence of yard-bays that a transfer crane visits during a loading operation. This routing problem is formulated as a mixed integer program. The objective function of the formulation is to minimize the total container handling time of a transfer crane, which includes setup time at each yard-bay and travel time between yard-bays. Based on the mixed integer program, an optimizing algorithm is developed.