基于改进飞蛾扑火算法的机场航班时刻衔接优化  

Time Connection Optimization of Airport Flights Based on Improved Moth-flame Optimization Algorithm

作　　者：严宇 熊静[1] 张文成 刘超 YAN Yu;XIONG Jing;ZHANG Wencheng;LIU Chao(Air Transport College,Shanghai University of Engineering Science,Shanghai 201620,China)

机构地区：[1]上海工程技术大学航空运输学院,上海201620

出　　处：《物流科技》2020年第12期91-94,共4页Logistics Sci-Tech

摘　　要：针对枢纽机场航班的衔接时间问题,提出了一种最小化枢纽机场平均衔接时间的模型。首先通过绕航系数筛选适合中转的城市对,再分析机场运行的限制设置约束,应用改进飞蛾扑火算法求解。仿真结果表明,通过该方法优化的航班时刻表,大大减小了中转航班对的平均衔接时间。Aiming at the problem of connecting time of flights in hub airport,a model to minimize the mean connecting time of hub airport is proposed.First,the city pairs suitable for transit are screened by the deviation coefficient,then the constraints of airport operation are analyzed,and the improved moth-flame optimization algorithm is applied to solve the problem.The simulation results show that the optimized flight schedule can greatly reduce the average connecting time of connecting flight pairs.

关 键 词：飞蛾扑火算法 最小化模型 绕航系数 枢纽机场 

分 类 号：F560[经济管理—产业经济]