Please use this identifier to cite or link to this item:
Title: Yard crane dispatching to minimize job tardiness in container terminals
Authors: Lim, Wei Lin.
Keywords: DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering
Issue Date: 2012
Abstract: Singapore had been ranked as the top container port in the world since year 2005 but it was overtaken by Shanghai in year 2010. With the increasing number of global cargo flows and competition between countries, the container terminal operation in Singapore must be efficient enough to handle the increased workload and provide good services to customers. This project aims to help in reducing vessel turnaround time by looking at the YC dispatching problem which is to minimize vehicle job tardiness. It is to ensure that vehicles are able to leave yard blocks at the required times according to vehicle schedule so as to minimize the QCs waiting time for a vehicle. MTA* and MT-RBA* are proposed in this project in finding an optimal solution with dynamic computation of the YC job service times which helps reduce the future job service time in a dispatching sequence. Both algorithms are then evaluated against EDD and SCJF. From this project, it was found that MTA* and MT-RBA* have outperformed EDD and SCJF in finding the optimal job sequences and the computational time for MT-RBA* to find the optimal solution take only a few seconds.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
2.44 MBAdobe PDFView/Open

Page view(s) 50

checked on Oct 29, 2020

Download(s) 50

checked on Oct 29, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.