碩士 / 國立交通大學 / 運輸與物流管理學系 / 102 / Berth allocation, the first operation when vessels arrive at a port, which determines the assignment of the berths to the calling vessels. It is one of the major container port optimization problems. From both the port operator’s and the ocean carriers’ perspective, minimization of the time a ship spends at berth is a key goal of port operations.
With the rapid development of container transport industry, container terminal systems have become more and more busy. Some measures and facilities are taken to improve the container throughput, such as Mega Ship, Mega Crane, Deep water Port, Automatic Container Terminal, Mobile Port. Increasing container ship size can save time and costs. However, this trend is affected by the global shipping market prosperity and economy of scale. Under this trend, the international carriers, port operators and the maritime industries are facing new opportunities and challenges.This deals with the transshipment transport problem in a container terminal arising from the usage of Mega Ship. This research introduces the berth allocation problem considering transshipment of ship to ship and formulates a mathematical model with Mega-Ships and different number of Quay Cranes in berth. For dealing with berth allocation problem, the “optimal model of consolidation decision for berth allocation problem”, based on Mixed Integer Programming (MIP), is constructed to testing samples. The conclusion of the analysis, has shown, when the berth found enough resources, berth utilization will vary, so for shipping companies to use high-efficiency berth is an important issue.
| Identifer | oai:union.ndltd.org:TW/102NCTU5423008 |
| Date | January 2014 |
| Creators | 謝昌瀚 |
| Contributors | 陳穆臻 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 49 |
Page generated in 0.0194 seconds