改良式GRASP演算法求解動態連續船席調配問題

標題:	改良式GRASP演算法求解動態連續船席調配問題 Improved Greedy Randomized Adaptive Search Procedure for Dynamic Berth Allocation Problem
作者:	林岱暘 Lin, Dai-Yang 黃明居黃明居 Hwang, Ming-Jiu Hwang, Ming-Jiu 運輸與物流管理學系
關鍵字:	動態連續船席調配問題;貪婪隨機適應性搜尋;GRASP;berth allocation problem
公開日期:	2010
摘要:	本研究探討目標為最小化等待時間加上處理時間的動態連續船席調配問題，並提出兩個構想以改良過去文獻提出之GRASP演算法，而改良式GRASP演算法和過去文獻提出的GRASP演算法在相同條件之下進行大規模和小規模問題的範例驗證後，發現改良式GRASP演算法能在更短的時間內求得目標值更低的解，且在調配兩百艘船之大規模問題時，更有高達13.65%的改善。 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.
URI:	http://140.113.39.130/cdrfb3/record/nctu/#GT079832503 http://hdl.handle.net/11536/47814
顯示於類別：	畢業論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。