摘要
本文将航班串的飞机指派问题归结为车辆路径问题,考虑连续航班串之间衔接时间、衔接机场的约束、每架飞机的总飞行时间约束,建立了带有飞行时间约束的车辆路径问题的混合整数规划模型。构造了蚁群系统算法,引入基于排序的蚂蚁系统和最大最小蚂蚁系统算法的信息素更新策略。选取某航空公司7组初始航班串集合进行测试,并对算法中的重要参数进行了分析。实验结果表明,本文设计的模型和算法可以有效地减少连续航班串之间的总衔接时间,在可接受的计算时间内获得满意解。
The domestic airlines are relatively small in comparison with the international airlines. Airlines used to make the flight plans using simple and rough methods. The competition among the airlines became stronger with the expansion of airlines, and the opening of the air transportation market. Therefore, flight-planning management becomes more important. Aircraft assigning problem （AAP） is to assign planes to the proper flight reasonably in order to make full use of the fleet resources. Good flight planning can not only ensure the safety and punctuality of flights, but also improve the utilization rate of fleets and decrease the cost of operation and maintenance so as to maximize the economic benefits of the airlines.
出处
《管理工程学报》
CSSCI
北大核心
2012年第2期148-155,共8页
Journal of Industrial Engineering and Engineering Management
基金
国家自然科学基金资助项目(71171126,61170095)
上海市哲学社会科学规划资助项目(2011BGL015)
上海市自然科学基金资助项目(09ZR1420400,09ZR1403000)
关键词
飞机指派
航班串
蚁群算法
车辆路径问题
aircraft assigning
flight string
ant colony optimization （ACO）
vehicle routing problem （VRP）
