Comparison of yard crane scheduling algorithms

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 p...

Full description

Saved in:
Bibliographic Details
Main Author: Low, Yihang.
Other Authors: Huang Shell Ying
Format: Final Year Project
Language:English
Published: 2012
Subjects:
Online Access:http://hdl.handle.net/10356/48639
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-48639
record_format dspace
spelling sg-ntu-dr.10356-486392023-03-03T20:46:23Z Comparison of yard crane scheduling algorithms Low, Yihang. Huang Shell Ying School of Computer Engineering Centre for Advanced Information Systems DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity 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. Bachelor of Engineering (Computer Science) 2012-05-04T07:52:52Z 2012-05-04T07:52:52Z 2012 2012 Final Year Project (FYP) http://hdl.handle.net/10356/48639 en Nanyang Technological University 45 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
spellingShingle DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Low, Yihang.
Comparison of yard crane scheduling algorithms
description 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.
author2 Huang Shell Ying
author_facet Huang Shell Ying
Low, Yihang.
format Final Year Project
author Low, Yihang.
author_sort Low, Yihang.
title Comparison of yard crane scheduling algorithms
title_short Comparison of yard crane scheduling algorithms
title_full Comparison of yard crane scheduling algorithms
title_fullStr Comparison of yard crane scheduling algorithms
title_full_unstemmed Comparison of yard crane scheduling algorithms
title_sort comparison of yard crane scheduling algorithms
publishDate 2012
url http://hdl.handle.net/10356/48639
_version_ 1759857914342801408