Yard crane and truck scheduling: A case study of Tan Cang - Cat Lai terminal

Abstract

Yard truck and yard crane scheduling is a common problem occurred in container terminals that can significantly impact world’s port operation. This thesis will consider the container unloading process and a case study of Tan Cang – Cat Lai Terminal to solve that scheduling problem with the aim to minimize the maximum completion time. The problem is first formulated as an integer programming model and verified with Lingo program. Furthermore, with the use of Matlab coding, a meta-heuristic called Grey Wolf Optimizer (GWO) is implemented based on the algorithm’s discrete version. Data sets collected from the case study will be applied when running code, the outcome of which is then analyzed and compared with the former method to assess their performance. The results show that both can help to find good solutions to the problem and they have their own advantages. GWO algorithm is more applicable and less time-consuming, however it does not output exact solution like Lingo. Keywords: Yard Crane Scheduling, Yard Truck Scheduling, Storage Allocation, Grey Wolf Optimizer (GWO)