• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2011, Vol. 33 ›› Issue (9): 151-156.

• 论文 • Previous Articles     Next Articles

A Stands Assignment Model Based on the Ant Colony Collaborative  Algorithm of Graph’s Weight

DING Jianli1,2,LI Xiaoli1,2,LI Quanfu1   

  1. (1.School of Computer Science and Technology,Civil Aviation University of China,Tianjin 300300;2.Information Technology Research Base,Civil Aviation Administration of China,Tianjin 300300,China)
  • Received:2010-10-08 Revised:2010-12-28 Online:2011-09-25 Published:2011-09-25

Abstract:

Stands assignment relates to the operation of the airport system,which is the core of airport ground operations. Taking stands time occupied by different flights as the constraint conflict, the conflict relationship among flights is  expressed as the weight of graph 01. Based on the stands, the constraint of flight types and the obtained graph’s weight, an ant colony collaborative algorithm is used to assign stands. With the ant colony collaborative algorithm, the stands assignment conflict is  avoided, the minimum number of flights assigned to distant stands and the minimum total time of the passengers to the stands are  set as the objective function. Taking the assigning stands for a hub airport as an example, compared with the genetic algorithm in the application of the stand assignment, it shows that the ant colony collaborative algorithm in the application of the stand assignment is significantly better than the genetic algorithm from the run time to the test results. It verifies the rationality of the algorithm ,and the algorithm can be used as a reference of the airport stands assignment.

Key words: stand assignment;graph’s weight;ant colony collaborative algorithm;hub airports