查詢結果分析
來源資料
頁籤選單縮合
題 名 | 機門指派最佳化之研究=Optimization of Gate Assignment |
---|---|
作 者 | 顏上堯; 張家銘; | 書刊名 | 中國土木水利工程學刊 |
卷 期 | 9:3 1997.09[民86.09] |
頁 次 | 頁491-500 |
分類號 | 557.95 |
關鍵詞 | 機門指派; 時空網路; 多重貨物網路流動問題; 拉氏鬆弛法; Gate assignment; Time-space network; Multi-commodity network flow problem; Lagrangian relaxation; |
語 文 | 中文(Chinese) |
中文摘要 | 目前國內機場機門的指派作業仍多以人工方式規劃,此方式除了難以應付複雜之決策外, 又缺乏系統性最佳化考量。以往學界雖曾利用零壹整數規劃方法,建立機門最佳化指派模式,然此 法在面臨大型問題時,通常求解費時且困難。本研究嘗試利用網路流動技巧構建一系統性最佳化模 式,期能幫助當局有效的規劃機場的機門指派作業。在數學上,此模式可定式為多重貨物網路流動 問題。本研究利用拉氏鬆弛法暨次梯度法,連同一最短路徑法及一拉氏啟發解法,發展一有效的求 解演算法,以求解模式。為測試此模式之效果,本研究以中正國際機場之班表為例,進行一實例分 析,測試效果良好。 |
英文摘要 | The traditional approach for planning the gate assignment in Taiwan is not based on a systematic analysis. It is ineffective and inefficient, especially when the air transportation is growing rapidly. Although the zero-one integer programming techniques have been applied to solving the gate assignment problems, they are generally difficult in handling large-scale problems. This paper employs network flow techniques in developing a systematic model that is useful to the airport authorities for assigning flights to gates efficiently. The model is formulated as a multi-commodity network flow problem. An algorithm, based on the Lagrangian relaxation and subgradient methods, coupled with a shortest path algorithm and a Lagrangian heuristic, is developed to solve the problem. To test the model in practice, a case study of the operation of the Chiang Chiek-Shek Airport has been performed. |
本系統中英文摘要資訊取自各篇刊載內容。