The application of Ant colony optimization algorithm in the flight landing scheduling problem

Flights landing scheduling problem is an NP-hard problem, the article presents an Ant colony optimization algorithm based on dynamic calculation of the heuristic information to solve a single runway flights landing scheduling problem. The algorithm has better global search ability and relatively fast convergence rate. The experimental results show that compared with traditional first come first serve, genetic algorithm and particle swarm algorithm, this method can quickly give the better flight approach and landing order to help controllers make efficient aircraft scheduling policy and reduce flight delays.