一种机场终端区飞机排序问题的蚁群算法研究

飞机排序问题（ASP）属于NP难问题，解决比较困难.本文首先将ASP表示成一个特殊的车间作业调度问题（JSP），以减少着陆飞机队列完成时间为优化目标，设计了求解ASP的蚁群算法.通过正交试验确定了ASP蚁群算法的最佳性能参数组合.通过比较FCFS调度方法和ASP蚁群算法对不同航班队列的排序结果验证了ASP蚁群算法求解问题的可行性和求解效果.结果表明，ASP蚁群算法优于FCFS调度方法，可以使着陆队列完成时间减少约14%.ASP蚁群算法的CPU时间较短，可以在合理的时间内求解出合适的飞机队列，为实时在线的自动化交通管制提供了支持.

An ant colony algorithm for an aircraft sequencing problem in the airport terminal area

An aircraft sequencing problem(ASP) is a non-deterministic polynomial hard(NP-hard) problem,which is hard to resolve.The ASP was treated as a particular job-shop scheduling problem(JSP),and an ant colony algorithm(ACA) for the ASP was designed with the objective of minimizing the makespan of landing airplanes.The orthogonal test was employed to study the optimal parameters of the ACA for the ASP.The efficiency and reliability of the ACA for the ASP was investigated by comparing the sequencing results of FCFS method for different numbers of landing aircraft.The ACA for the ASP is proved to be better than FCFS,which can decrease the makespan of landing airplanes by 14%.The ACA of the ASP can obtain a satisfactory solution with shorter CPU time,which can provide support for real-time automatic air traffic management.