碩士 / 國立交通大學 / 運輸科技與管理學系 / 99 / In this research, Dynamic Berth Allocation Problem of Continuous berth (BAPC) is studied to minimize the weighted processing time and waiting time. Two ideas to improve the GRASP algorithm which proposed by previous literature are addressed, and the modified GRASP algorithm could find better solution than the original in same conditions within less computing time, and when allocate the large scale problem 200 vessels, the improved algorithm could get 13.65% improvement.
| Identifer | oai:union.ndltd.org:TW/099NCTU5423016 |
| Date | January 2011 |
| Creators | Lin, Dai-Yang, 林岱暘 |
| Contributors | Hwang, Ming-Jiu, Hwang, Ming-Jiu, 黃明居, 黃明居 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 45 |
Page generated in 0.0014 seconds