In this paper, a new version of the aircraft maintenance routing problem, which is an important component of the airline planning process, is studied. We define the big-cycle aircraft maintenance routing problem on a connection network and formulate it as an asymmetric travelling salesman problem with fleet size and maintenance violation constraints, which takes maintenance resource availability into account. In the connection network, flight legs are represented by nodes and connections between flight legs are denoted by arcs. In our approach, decision variables denote the connections between flight legs. We develop a hybrid solution method for this problem, which combines the Gasimov’s modified subgradient algorithm and the ant colony optimization metaheuristic. The performance of the proposed method, is demonstrated and analyzed through detailed computational experiments. Performances of the proposed method, conventional subgradient algorithm and ant colony optimization algorithm are compared on different test problems. The analysis of the quality of the results demonstrates that the proposed method outperforms the mentioned methods.

本文研究了飞机维修航线问题的新版本，它是航空公司计划过程的重要组成部分。我们在连接网络上定义了大周期飞机的维修路由问题，并将其表述为具有机队规模和维护违规约束的非对称旅行商问题，其中考虑了维护资源的可用性。在连接网络中，飞行支腿用节点表示，飞行支腿之间的连接用弧表示。在我们的方法中，决策变量表示飞行航程之间的联系。我们针对此问题开发了一种混合解决方案方法，该方法结合了Gasimov的改进的次梯度算法和蚁群优化元启发式算法。所提出方法的性能，通过详细的计算实验进行了演示和分析。在不同的测试问题上，比较了所提方法，常规次梯度算法和蚁群优化算法的性能。结果质量的分析表明，所提出的方法优于上述方法。