关键词: 停机位指派, 航班连结树, 贪婪算法

Abstract:

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.

Key words:  gate assignment problem(GAP), flight connecting tree, greedy algorithm