带受限位移约束的遗传算法及飞机调度应用研究  

Genetic Algorithm Based on Constraint Position Shifting for Aircraft Landing Problem

作　　者：马卫民[1,2] 杨文娟[1] 徐博[2,3] 

机构地区：[1]西安工业大学经济管理学院,陕西西安710021 [2]同济大学经济与管理学院,上海200092 [3]上海理工大学管理学院,200093

出　　处：《工业工程与管理》2015年第5期151-156,165,共7页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(71071113,71161016);全国优秀博士论文作者专项资金资助项目(200782);高等学校博士学科点专项科研基金资助项目(20100072110011);上海市哲学社会科学规划课题资助项目(2010BZH003);中央高校基本科研业务费专项资金资助项目

摘　　要：飞机着陆调度问题作为机场跑道调度中的重要问题,其有效解决对于提高跑道容量和运行效率具有重要的意义。为解决该问题,提出基于受限位移约束的遗传算法(CPS-GA)。该算法利用遗传算法较好的鲁棒性和高效的求解效率来实现调度的高效性和实时性,并加入受限位移约束确保调度的可操作性和公平性。仿真结果表明,与经典的先到先服务(FCFS)调度方法相比,该算法能有效减少飞机的队列完成时间和总延误时间,且具有较好的收敛性。在着陆飞机数量较多时,仍能在较短时间内取得不错的解,从而对于繁忙机场的空中交通流量管理具有理论借鉴意义。The effective solution aircraft landing scheduling problem has a great significance for improving the capacity and the operation efficiency of the runway.In order to solve this problem,a CPS-GA strategy,which is constructed by agenetic algorithm（GA）based on constrained position shifting（CPS）,is proposed.This new strategy is efficient not only due to the strong robustness and high solving efficiency of GA,but also due to that CPS ensures maneuverability of scheduling and the fairness among airlines.The numerical study is conducted to verify the efficiency of CPS-GA algorithm.It proves that CPS-GA is more effective in reducing the makespan of sequence and aircraft delays than FCFS,a classical scheduling strategy.Moreover,it gives a reasonable solution in a short time even when the number of aircrafts is large.CPS-GA can improve the runway throughput of a busy airport to some extent.At the same time,it meets the requirement of real-time scheduling.The convergence of the algorithm is also analyzed,which is proved good.

关 键 词：受限位移约束(CPS) 遗传算法 飞机着陆调度 

分 类 号：V351.11[航空宇航科学与技术—人机与环境工程]