本文基于现实情况中航空公司调整航班的一些原则,提出单架飞机受短时间干扰后的航班调整问题,把最大航班延误时间最小化作为问题的目标,以航班在时间和空间上的衔接作为约束,建立数学模型,并根据问题的一些特点,分析出在受干扰飞机所在机场进行调整就能得到最优解,然后设计了二分搜索匹配算法,并证明该算法能够找到最优解,最后通过案例验证了算法的有效性。
Based on some principles of airlines flight rescheduling, this paper presents an flight rescheduling problem under little disruption of single aircraft. The objective of the problem is minimization of the maximal flight delay time. The constraints of the problem include connection of time and space between flights with the same aircraft. A mathematical model is then established. It is analyzed that optimal solution can be obtained after rescheduling at the airport where disruption happens according to features of the problem. Binary search-maximal matching algorithm is designed to solve the problem and the algorithm is proved to be optimum. A case study is given to illustrate the algorithm finally.