查詢結果分析
來源資料
頁籤選單縮合
題 名 | 時空網路應用於機門指派問題之研究=A Time-Space Network Model for the Airport Gate Assignment Problem |
---|---|
作 者 | 陳春益; 李宇欣; 盧華安; | 書刊名 | 運輸學刊 |
卷 期 | 10:3=37 1997.09[民86.09] |
頁 次 | 頁1-20 |
分類號 | 557.95 |
關鍵詞 | 機門指派; 多元商品流量問題; 時空網路; 具額外限制式之成本最小化流量問題; 分支定限法; Airport gate assignment; Multicommodity flow problem; Time-space network; Minimum cost flow problem with side constraints; Branch-and-bound algorithm; |
語 文 | 中文(Chinese) |
中文摘要 | 傳統上,機門指派之最佳化模式,大多被構建成整數規劃問題,如應用於實務問 題上,每每成為大型問題而無法快速求解。近來,該問題被定式為多元商品流量問題,遭遇 大型問題演算績效不佳之課題。本研究嘗試運用時空網路協助模式構建,所建模式為具額外 限制式之成本小化流量問題,該額外限制式為變數間之流量對稱等式限制,改善了模式構建 的複雜性。經以分支定限法求解苦干範例與中正機場簡化實例,所得線性規劃之實數解即為 整數最佳解,測試結果亦顯示該模式確能提供合理的指派結果。 |
英文摘要 | The airport gate assignment problem is conventionally modeled as an integer programming problem and is heuristically solved for real-world cases. Recently, it had been formulated as a multicommdity flow problem. However, a real-time algorithm is needed. In this paper, we make use of the time-space network to formulate it as a minimum cost flow problem with side contraints, a set of flow equality constraints. Fruthermore, integer solutions can be obtained at the first phase without branching with the branch-and -bound algorithm in our case studies. The experimental result shows that our model is promising. |
本系統中英文摘要資訊取自各篇刊載內容。