飞机航线和机组配对：法国航空公司更新的算法
Aircraft routing and crew pairing: updated algorithms at Air France
摘要：
飞机航路规划和机组配对问题的目的是建立一个航空公司的飞机和机组分别操作的航班航段序列。考虑到它们对航空公司运营成本的影响，几十年来人们一直在广泛研究这两个问题。我们的目标是为法航的这两个问题提供可靠且易于维护的框架。我们提出了简单的方法来处理法国航空公司目前的设置。对于路由，我们介绍了一个紧凑的MIP制定，可以解决目前的MIP求解器在最多几分钟内，即使在法航最大的情况。关于船员配对，我们提供了一个标准的方法来模拟列发电定价子问题内的一个新的资源约束的最短路径框架最近推出的第一作者。该框架利用路径资源的边界来丢弃部分解，提高了求解速度。由此产生的方法能够解决最优法航最大的情况。最近的文献集中在集成飞机路由和机组配对问题。作为一个侧面的结果，我们已经能够解决接近最优的大型工业实例的综合问题，通过结合上述算法在一个简单的切割生成方法。
英文摘要：
Aircraft routing and crew pairing problems aims at building the sequences of flight legs operated respectively by airplanes and by crews of an airline. Given their impact on airlines operating costs, both have been extensively studied for decades. Our goal is to provide reliable and easy to maintain frameworks for both problems at Air France. We propose simple approaches to deal with Air France current setting. For routing, we introduce a compact MIP formulation that can be solved by current MIP solvers in at most a few minutes even on Air France largest instances. Regarding crew pairing, we provide a standard methodology to model the column generation pricing subproblem within a new resource constrained shortest path framework recently introduced by the first author. This new framework, which can be used as a black-box, leverages on bounds on paths' resource to discard partial solutions and speed-up the resolution. The resulting approach enables to solve to optimality Air France largest instances. Recent literature has focused on integrating aircraft routing and crew pairing problems. As a side result, we have been able to solve to near optimality large industrial instances of the integrated problem by combining the aforementioned algorithms within a simple cut generating method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
