航班进场调度的改进捕食搜索算法

为高效解决航班进场调度问题,采用以航班总延误时间最小为目标的规划模型,设计了一种改进的捕食搜索算法.区别于传统捕食搜索算法,新算法采用变化的局部搜索和全局搜索限制,从而避免陷入局部最优和解的退化.为测试新算法解决航班进场调度问题的性能,采用10架航班和双跑道数据进行仿真验证,并与传统捕食搜索算法和遗传算法进行比较.结果表明,新算法在最优解的获得率和计算时间上均优于传统捕食搜索算法和遗传算法.

INNOVATIVE PREDATORY SEARCH ALGORITHM FOR AIRCRAFT ARRIVAL SEQUENCING AND SCHEDULING PROBLEMS

To solve aircraft arrival sequencing and scheduling problems, and improve the typical predatory search algorithm(PSA), an innovative PSA is developed. The new PSA uses variable constraints of local search and global search to avoid falling into local optimal solutions and the degeneration of solutions. To test the performance of new PSA, a case study with ten arriving flights and two runways is performed. Test results show that the new PSA performs much better than typical PSA and genetic algorithm(GA) in the aspects of the rate of gaining optimal solutions and the computational time.