碩士 / 國立高雄應用科技大學 / 電子工程系 / 100 / To reduce ship waiting time is the critical problem for shipping companies and port authorities. If the ship waiting time is too long, not only increase the costs for waiting, but also affect the schedules of the shipping companies to arrange shipping schedules. For port authorities, the numbers of berths are more, the operation cost is higher. To enhance the utilization of berth and get to high business volume in the existing the number of berths, is port authorities’ goals continuing to strive.
The berth allocation problem can be regarded as an optimization problem that schedules the Wharfing time and location for cargo ships to minimize the waiting time and loading/unloading time.
This paper compares the various algorithms for berth allocation to Kaohsiung existing berths and the ship into port daily forecast data simulated by comparing the results of the best algorithms, not only getting a better berth dispatch results, but also reducing the ship waiting time , improving the utilization of berth, reducing the operation cost and upgrading the quality of port services.
| Identifer | oai:union.ndltd.org:TW/100KUAS8393034 |
| Date | January 2012 |
| Creators | Yan-Chih Yeh, 葉彥志 |
| Contributors | Tsong-Yi Chen, 陳聰毅 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 96 |
Page generated in 0.0116 seconds