Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/44552
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNguyen, Minh Khoi.-
dc.date.accessioned2011-06-02T04:36:52Z-
dc.date.available2011-06-02T04:36:52Z-
dc.date.copyright2011en_US
dc.date.issued2011-
dc.identifier.urihttp://hdl.handle.net/10356/44552-
dc.description.abstractNumber 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.en_US
dc.format.extent81 p.en_US
dc.language.isoenen_US
dc.rightsNanyang Technological University-
dc.subjectDRNTU::Engineering::Computer science and engineeringen_US
dc.titleCircle packing algorithms for optimizing space usage in anchoragesen_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorHuang Shell Yingen_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.description.degreeBachelor of Engineering (Computer Science)en_US
item.fulltextWith Fulltext-
item.grantfulltextrestricted-
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)
Files in This Item:
File Description SizeFormat 
SCE10-0074.pdf
  Restricted Access
1.77 MBAdobe PDFView/Open

Google ScholarTM

Check

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