Improved Greedy Randomized Adaptive Search Procedure for Dynamic Berth Allocation Problem
碩士 === 國立交通大學 === 運輸科技與管理學系 === 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 GR...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/36720720849296426359 |