| dc.description.abstract | Quay crane scheduling plays a pivotal role in the operations of container terminals,
representing a decision-making process that is inherently marked by uncertainty. This
study explores the integrated scheduling issue involving quay cranes and yard trucks,
specifically examining the operation where a yard truck retrieves containers from a quay
crane, conveys the required containers to the container yard, and subsequently returns to
the quay crane, not laden with exported containers. The objective is to decrease the total
make-span required to complete the unloading and transporting tasks, including traveling
time and travelling distance for all essential containers. The optimization algorithm
combines the genetic algorithm (GA) for conducting global searches with the simulated
annealing (SA) algorithm for local searches. The findings also suggest that the intergrated
method offers clear advantages in terms of reducing vessel completion times and
enhancing the service level of container terminals when compared to solutions based on
expected value | en_US |
