基于航班连结树的机场停机位指派问题研究

Research on the gate assignment problem in airport based on the flight connecting tree

分析了机场停机位指派的基本约束和附加约束,以航班延误和停机位空闲时间总和最小为目标函数,构建机场停机位指派模型,提出停机位航班连接树的概念和构造方法,设计指派模型的贪婪算法,最后将该算法应用于一个算例。计算结果表明基于航班连结树的机场停机位指派可以有效简化模型复杂度,提高求解效率。

The basic constraints and additional constraints were analyzed,and the model of the gate assignment was built through minimizing the sum of flight delay and idle time of the gate as the object function.Based on presenting the concept of the flight connection tree and its construction method,the greedy algorithm was designed.Finally,an example was analyzed to demonstrate the application of this algorithm.The results proved that a gate assignment method based on the flight connecting tree could effectively simplify complexity of the model,and improved solving efficiency.