考量到達時間不確定性 之短期登機門指派問題

隨著航空業的發展，航空公司為了應付需求增加的狀況，必須增加班次，使得機場航班班表的密集度提升，航班於登機門之平均作業時間也相對縮短，登機門的平均閒置時間亦減少。如果遇上氣候不佳或是突發狀況導致航班延誤，勢必會衍生班表巨大的變動，造成機場運作的混亂及旅客極大的不便。因此，本研究發展一個完善的「短期」登機門指派模式以及有效的求解方法，對於維持機場服務品質有極大的助益。它使用於突發狀況發生後，以短時間有效解決問題為主，通常並以儘量不變更原訂班表為前提。本研究所聚焦短期的登機門指派問題，考量登機門指派的限制，以及航班到達時間的不確定性，以臨時登機門變動數以及總延遲時間為最小化的目標，建構最佳化模式。研究的重點之一在於考量到達時間不確定性，以隨機情境模擬其不確定性，並發展隨機規劃模式求解。本研究將利用最佳化的技術，設計啟發式演算法，用以求解大型問題。透過數值測試結果所示，隨機規劃在本研究之問題上擁有一定的價值，而啟發式演算法的近似解在各類型例題下，皆有5%以下的與最佳解之差距，能夠在短時間提供登機門指派之規劃者有效的決策輔助。

關鍵字

登機門指派；隨機規劃；啟發式解法；班機到達不確定性

並列摘要

With the development of the civil aviation industry, airlines need to increase their flight frequencies to deal with the increased demand, leading to a high density of flight schedules at airports. The average operation time of the flights at the gates, as well as the average gate idle time, is expected to be shortened. In case of flight delays due to poor weather or unexpected situations, gate operations and flight schedules will inevitably be greatly impacted, and serious inconvenience is incurred for travelers. Therefore, a sophisticated model, as well as an efficient solution algorithm, for the gate assignment decision problem under possible disruption is crucial for the airports from the aspect of service quality and operation efficiency. It can help effectively handle an unexpected situation within a short period of time and limit the change of the original gate assignment to the minimal. This study focuses on the short-term gate assignment decision, considering the basic relationship between flights and gates and the arrival time uncertainty associated with the flights. The objective is to minimize the number of gate changes and the total delay time of the flights. One of the key issues is the study is to take the flight arrival time uncertainty into account. Random scenarios are used to simulate the associated uncertainty and a stochastic programming (SP) model has been developed to generate the gate assignment decision. This study also has designed the suitable solution methods, based on some optimization techniques to handle large-scale problems. Based on the numerical experiment, the value of stochastics programming in this study is considerable. In addition, the gap between optimal solution and approximate solution in the tests of both problem sizes are within 5%, suggesting an acceptable solution quality. It is expected that this study will provide the instant decision support needed by the airport operations of gate assignment planning.

並列關鍵字

Gate Assignment ； Heuristic Algorithm ； Flight Arrival Uncertainty ； Stochastic Programming

參考文獻

Abdelghany, A., Abdelghany, K., (2009). Modeling Application in the Airline Industry. Ashgate Publishing Group. Pp. 122-128.

Google Scholar

Babic, O., Teodorovic, D., Tošic, V., (1984). Aircraft stand assignment to minimize walking. J. Transp. Eng. Vol. 110 (1), pp. 55–66.

Google Scholar

Bihr, R.A., (1990). A conceptual solution to the aircraft gate assignment problem using 0, 1 linear programming. Comput. Indus. Eng. Vol. 19 (1), pp. 280–284.