Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/16861
Title: Investigation into a berth allocation strategy for a container terminal
Authors: Ang, Valencia
Keywords: DRNTU::Engineering::Industrial engineering::Operations research
Issue Date: 2009
Abstract: High demand of high speed and volume transportation in globalization has dramatically increased needs in transportation. Among all transportation methods, container shipping is the most utilized method for international trading due to its safety, convenience, and high volume per cost value. Under this situation, all terminal port that long for withstand in this competition should not only have a strategic location, high port capacity, and resources. They also need to pursue efficient and optimal operation, competitive edge, and maintain their customers’ satisfaction. Concerning these circumstances, numerous research projects have been performed with their own approach and focus. This project proposes a semi-continuous berth allocation problem. Several simulations were conducted for assessment and comparison of the proposed models. The conducted simulations were based on some factors, which include consideration of handling time factor, consideration of prioritizing optimum berth location, variation of Section length with uniform sections length or irregular length, and variation of handling time factors. Factors such as total handling time and average of individual service time were gathered and analyzed. The effect to utilization and number of handled vessel distribution between berth sections was also observed and compared between several simulation cases.
URI: http://hdl.handle.net/10356/16861
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
mB013.pdf
  Restricted Access
1.94 MBAdobe PDFView/Open

Google ScholarTM

Check

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