Please use this identifier to cite or link to this item:
Title: Comparison of yard crane scheduling algorithms
Authors: Low, Yihang.
Keywords: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Issue Date: 2012
Abstract: Yard cranes (YCs) are integral parts of a container terminal system. It is desirable to find algorithms which can produce an optimal sequence for a set of jobs to be served by yard crane. This problem of yard crane scheduling has been widely studied and various algorithms have been developed. This project aimed to study six of these algorithms to compare the quality of solutions produced and the time taken for the algorithms to be executed. The algorithms were implemented in C#. Various measurement metrics, most importantly waiting time of the jobs and execution time of the algorithms, were collected. The results were processed in R and an analysis was made in order to quantify the quality differences and execution time differences of the algorithms. It was discovered that the heuristic algorithms (Nearest Neighbour, Shortest Completion-time Job First and Partial Sequence Search) produced solutions of only slightly worse quality than the optimal one found by A*, but at a far small execution time cost.
Schools: School of Computer Engineering 
Research Centres: Centre for Advanced Information Systems 
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
1.01 MBAdobe PDFView/Open

Page view(s)

Updated on Jun 16, 2024

Download(s) 50

Updated on Jun 16, 2024

Google ScholarTM


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