Research on Airport Gate Allocation Problem Based on NSGA-II Algorithm

The Airport Gate Allocation Problem (AGAP) is a key problem in the daily operation of modern air transport industry. In view of the situation that the passenger flow of an airline in the existing terminal T of an airport has reached the saturation state, in order to cope with the future development, a satellite Hall s is added. On the basis of the goal of maximizing flight allocation and relieving passenger transfer tension, the overall planning and allocation of all boarding gates of T and s are carried out. To solve this problem, this paper constructs a multi-objective constraint model. In this paper, NSGA-II algorithm is selected as the solution algorithm. In order to speed up the convergence speed of the algorithm, a set of initial solutions is generated by using the matching algorithm based on first come first served. Finally, the TOPSIS method is used to select the compromise solution which satisfies the decision makers from a set of Pareto fronts obtained by NSGA-II algorithm. This paper uses the data provided by the competition to carry out the experiment, and analyzes and displays the results of the experiment.