Table of Content

Open AccessOpen Access


Research on Flight First Service Model and Algorithms for the Gate Assignment Problem

Jiarui Zhang1, Gang Wang2,*, Siyuan Tong1

1 Graduate School, Air Force Engineering University, Xi’an, 710051, China.
2 Air and Missile Defense College, Air Force Engineering University, Xi’an, 710051, China.
* Corresponding Author: Gang Wang. Email:

Computers, Materials & Continua 2019, 61(3), 1091-1104.


Aiming at the problem of gate allocation of transit flights, a flight first service model is established. Under the constraints of maximizing the utilization rate of gates and minimizing the transit time, the idea of “first flight serving first” is used to allocate the first time, and then the hybrid algorithm of artificial fish swarm and simulated annealing is used to find the optimal solution. That means the fish swarm algorithm with the swallowing behavior is employed to find the optimal solution quickly, and the simulated annealing algorithm is used to obtain a global optimal allocation scheme for the optimal local region. The experimental data show that the maximum utilization of the gate is 27.81% higher than that of the “first come first serve” method when the apron is not limited, and the hybrid algorithm has fewer iterations than the simulated annealing algorithm alone, with the overall passenger transfer tension reducing by 1.615; the hybrid algorithm has faster convergence and better performance than the artificial fish swarm algorithm alone. The experimental results indicate that the hybrid algorithm of fish swarm and simulated annealing can achieve higher utilization rate of gates and lower passenger transfer tension under the idea of “first flight serving first”.


Cite This Article

J. Zhang, G. Wang and S. Tong, "Research on flight first service model and algorithms for the gate assignment problem," Computers, Materials & Continua, vol. 61, no.3, pp. 1091–1104, 2019.


This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 3704


  • 913


  • 0


Share Link