论文部分内容阅读
飞机排班是航空运输生产计划的重要环节,对航空公司的正常运营和整体效益有着决定性影响;飞机排班通常构建为大规模整数规划问题,是航空运筹学研究的重要课题,构建的模型属于严重退化的NP-Hard问题.在考虑对多种机型的飞机进行排班时,大大增加了问题的复杂性.针对航空公司实际情况,建立多种机型的飞机排班模型;为实现模型的有效求解,提出了基于约束编程的动态列生成算法;即用约束编程快速求解航班连线(航班串)并计算航班串简约成本,动态选择列集并与限制主问题进行迭代.最后,利用国内某航空公司干线航班网络实际数据验证模型和算法的有效性.
Aircraft scheduling is an important part of air transport production planning and has a decisive impact on the normal operation and overall profitability of airlines. Aircraft scheduling is usually constructed as a large-scale integer programming problem, which is an important issue in the research of aviation operations research. The model is Severely degraded NP-Hard problem.Considering the complexity of the problem when considering aircraft scheduling for a variety of aircraft models.According to the actual situation of airlines, the establishment of a variety of models of aircraft scheduling model; in order to achieve the model , This paper proposes a dynamic algorithm based on constrained programming, which is to use constraint programming to solve the flight connection (flight string) quickly and calculate the cost of flight string concisely, to dynamically select a set of columns and to iterate over the restriction of the main problem.Finally, The Validation of Validation Models and Algorithms for the Actual Data of a Domestic Airline Flight Route Network.