Circle packing algorithms for optimizing space usage in anchorages

Number of Vessel Arrivals to Singapore is increasing fast; it can cause the Singapore anchorage system to be overloaded. As a result, there is need of new algorithms for allocating vessels more efficiently and this is the focus of this project. By using the software Singapore Anchorage System Simula...

Full description

Saved in:
Bibliographic Details
Main Author: Nguyen, Minh Khoi.
Other Authors: Huang Shell Ying
Format: Final Year Project
Language:English
Published: 2011
Subjects:
Online Access:http://hdl.handle.net/10356/44552
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-44552
record_format dspace
spelling sg-ntu-dr.10356-445522023-03-03T20:52:33Z Circle packing algorithms for optimizing space usage in anchorages Nguyen, Minh Khoi. Huang Shell Ying School of Computer Engineering DRNTU::Engineering::Computer science and engineering Number of Vessel Arrivals to Singapore is increasing fast; it can cause the Singapore anchorage system to be overloaded. As a result, there is need of new algorithms for allocating vessels more efficiently and this is the focus of this project. By using the software Singapore Anchorage System Simulator, we will try to model the real Singapore anchorage system. Based on this model, we will evaluate the utilizations, the running times and the acceptance rates of the newly designed algorithms for allocating vessels. Our experiments show that the algorithms with size priority and following the Wallpack rule perform very well; the algorithms without advance booking perform well at low levels of Vessel Arrivals when the algorithms with advance booking perform well at high levels of Vessel Arrivals. According to this result, we are able to design more efficient algorithms based on Wallpack rule with size priority. Bachelor of Engineering (Computer Science) 2011-06-02T04:36:52Z 2011-06-02T04:36:52Z 2011 2011 Final Year Project (FYP) http://hdl.handle.net/10356/44552 en Nanyang Technological University 81 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
spellingShingle DRNTU::Engineering::Computer science and engineering
Nguyen, Minh Khoi.
Circle packing algorithms for optimizing space usage in anchorages
description Number of Vessel Arrivals to Singapore is increasing fast; it can cause the Singapore anchorage system to be overloaded. As a result, there is need of new algorithms for allocating vessels more efficiently and this is the focus of this project. By using the software Singapore Anchorage System Simulator, we will try to model the real Singapore anchorage system. Based on this model, we will evaluate the utilizations, the running times and the acceptance rates of the newly designed algorithms for allocating vessels. Our experiments show that the algorithms with size priority and following the Wallpack rule perform very well; the algorithms without advance booking perform well at low levels of Vessel Arrivals when the algorithms with advance booking perform well at high levels of Vessel Arrivals. According to this result, we are able to design more efficient algorithms based on Wallpack rule with size priority.
author2 Huang Shell Ying
author_facet Huang Shell Ying
Nguyen, Minh Khoi.
format Final Year Project
author Nguyen, Minh Khoi.
author_sort Nguyen, Minh Khoi.
title Circle packing algorithms for optimizing space usage in anchorages
title_short Circle packing algorithms for optimizing space usage in anchorages
title_full Circle packing algorithms for optimizing space usage in anchorages
title_fullStr Circle packing algorithms for optimizing space usage in anchorages
title_full_unstemmed Circle packing algorithms for optimizing space usage in anchorages
title_sort circle packing algorithms for optimizing space usage in anchorages
publishDate 2011
url http://hdl.handle.net/10356/44552
_version_ 1759856387832152064