CAJ | 학술논문

本文将航班串的飞机指派问题归结为车辆路径问题,考虑连续航班串之间衔接时间、衔接机场的约束、每架飞机的总飞行时间约束,建立了带有飞行时间约束的车辆路径问题的混合整数规划模型。构造了蚁群系统算法,引入基于排序的蚂蚁系统和最大最小蚂蚁系统算法的信息素更新策略。选取某航空公司7组初始航班串集合进行测试,并对算法中的重要参数进行了分析。实验结果表明,本文设计的模型和算法可以有效地减少连续航班串之间的总衔接时间,在可接受的计算时间内获得满意解。
본문장항반천적비궤지파문제귀결위차량로경문제,고필련속항반천지간함접시간、함접궤장적약속、매가비궤적총비행시간약속,건립료대유비행시간약속적차량로경문제적혼합정수규화모형。구조료의군계통산법,인입기우배서적마의계통화최대최소마의계통산법적신식소경신책략。선취모항공공사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.