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. Keywords:Heuristic Information entropy Ant colony optimization Global search
The Application of Ant Colony Optimization Algorithm in the Flight Landing Scheduling Problem
Applied Mechanics and Materials ; 411-414 ; 2698-2703
2013-09-03
6 pages
Article (Journal)
Electronic Resource
English
Flight landing scheduling method based on improved DQN algorithm
European Patent Office | 2020
|Emission and Flight Time Optimization Model for Aircraft Landing Problem
Transportation Research Record | 2022
|