1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.author林岱暘en_US
dc.contributor.authorLin, Dai-Yangen_US
dc.contributor.author黃明居en_US
dc.contributor.author黃明居en_US
dc.contributor.authorHwang, Ming-Jiuen_US
dc.contributor.authorHwang, Ming-Jiuen_US
dc.date.accessioned2014-12-12T01:50:38Z-
dc.date.available2014-12-12T01:50:38Z-
dc.date.issued2010en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT079832503en_US
dc.identifier.urihttp://hdl.handle.net/11536/47814-
dc.description.abstract本研究探討目標為最小化等待時間加上處理時間的動態連續船席調配問題，並提出兩個構想以改良過去文獻提出之GRASP演算法，而改良式GRASP演算法和過去文獻提出的GRASP演算法在相同條件之下進行大規模和小規模問題的範例驗證後，發現改良式GRASP演算法能在更短的時間內求得目標值更低的解，且在調配兩百艘船之大規模問題時，更有高達13.65%的改善。zh_TW
dc.description.abstractIn 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.en_US
dc.language.isozh_TWen_US
dc.subject動態連續船席調配問題zh_TW
dc.subject貪婪隨機適應性搜尋zh_TW
dc.subjectGRASPen_US
dc.subjectberth allocation problemen_US
dc.title改良式GRASP演算法求解動態連續船席調配問題zh_TW
dc.titleImproved Greedy Randomized Adaptive Search Procedure for Dynamic Berth Allocation Problemen_US
dc.typeThesisen_US
dc.contributor.department運輸與物流管理學系zh_TW
Appears in Collections:Thesis


Files in This Item:

  1. 250301.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...