查詢結果分析
來源資料
頁籤選單縮合
題名 | 大型機門指派問題最佳化=Optimization of Large-Scale Gate Assignment Problems |
---|---|
作者 | 顏上堯; 韓復華; 霍俊明; Yan, Shangyao; Han, Fu-hwa; Huo, Cheun-ming; |
期刊 | 工業工程學刊 |
出版日期 | 19980500 |
卷期 | 15:3 1998.05[民87.05] |
頁次 | 頁245-254 |
分類號 | 557.95 |
語文 | chi |
關鍵詞 | 機門指派; 變數產生法; 集合涵蓋問題; 分枝界限法; Gate assignment; Column generation; Set covering problem; Branch and bound; |
中文摘要 | 目前國內機場機門之指派作業多以半人工方式規劃,此方法不僅缺乏系統最佳化 考量,亦難以處理空運中心等大型機場之機門指派問題。以往學者曾用零壹整數規劃方法建 立機門最佳化模式,然其求解方法在面臨大型問題時,通常求解費時且困難。另有學者利用 網路流動技巧構建系統最佳化模式,但其收斂效果仍然欠佳。本研究應用零壹整數規劃方法 建立一機門指派模式,並運用變數產生法及分枝界限法發展一有效的解法,期能幫助當局有 效地規劃大型機場的機門指派作業。 |
英文摘要 | The traditional approach for planning the gate assignment in Taiwan is not based on a systematic analysis. It is ineffective and inefficient to handle large-scale airport assignment problems. In the past, zero-one integer programming techniques have been used to develop models for solving the gate assignment problems. They are generally difficult in handling large-scale problems. Although network models have been employed to efficiently solve for large-scale problems, their convergence is not satisfactory. This paper proposes a zero-one integer programming model and apply the column generation and branch and bound approaches for efficiently and effectively solving large-scale gate assignment problems. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。