Using an Ant Colony Optimization algorithm to solve a project scheduling problem

Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Franklin Johnson ◽  
Fernando Paredes
2013 ◽  
Vol 411-414 ◽  
pp. 2698-2703
Author(s):  
Xiao Rong Feng ◽  
Xing Jie Feng ◽  
Dong Liu

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


2014 ◽  
Vol 19 (12) ◽  
pp. 3599-3619 ◽  
Author(s):  
Paweł B. Myszkowski ◽  
Marek E. Skowroński ◽  
Łukasz P. Olech ◽  
Krzysztof Oślizło

Sign in / Sign up

Export Citation Format

Share Document