碩士 / 國立交通大學 / 運輸科技與管理學系 / 100 / The focus of this study is the Berth Allocation Problem (BAP), which determines the assignment of the berths to the calling ships. Given the dynamic information of the ship arrival times, the objective of the dynamic BAP is to minimize the total service times, defined as the sum of the waiting times and handling times, for all calling ships. In particular, the handling time is assumed to be berth-dependent and thus affected by the berth assignment decision. Owing to the nature of the sequencing decision problem associated with the BAP, this study chooses the Ant Colony Optimization (ACO), which has some inherited advantages over other meta-heuristics due to its sequential framework for the searching process and the solution building procedure. This study designs an ant-based algorithm to generate the ship assignment sequence, by which a greedy heuristic assigns a berth to a ship and determines the berthing window by considering its arrival time and the berth-dependent handling time. In the numerical experiment, the developed algorithm is compared with a solution algorithm based on Lagrangian Relaxation in the literature. It is found that the developed ant-based algorithm is promising with respect to the solution quality for the dynamic BAP.
| Identifer | oai:union.ndltd.org:TW/100NCTU5423003 |
| Date | January 2012 |
| Creators | Chen, Yian, 陳儀安 |
| Contributors | Huang, KuanCheng, 黃寬丞 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 32 |
Page generated in 0.0092 seconds