基于蚁群协同算法的图权值停机位分配模型

停机位分配关系到整个机场系统的运行,是机场地面作业的核心部分。根据不同航班占用停机位的时间冲突约束,将航班之间的冲突关系表示成图的权值0-1,基于停机位、航班类型的匹配约束和得到的图的权值,运用蚁群协调算法,在保证不存在停机位分配冲突约束的前提下,以最少数量航班被分配到远停机位和旅客到停机位总行走时间最小为目标函数,对航班进行停机位分配。对枢纽机场进行停机位分配,并与遗传算法在停机位分配上的应用做比较,表明蚁群协调算法在停机位分配上的应用从运行时间和实验结果都明显好于遗传算法,验证了算法的合理性,这一算法可作为机场停机位分配的参考。

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

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.