Aircraft maintenance routing problem model and metaheuristic algorithm

In recent years, with the rapid development of civil air transport industry, aircraft maintenance routing problem (AMRP) research has been paid more and more attention. Firstly, this paper proposes an AMRP model that considers both the remaining legal flying time and the remaining legal flying days of aircrafts. Secondly, a hybrid metaheuristic algorithm (GA-CA) based on genetic algorithm and compressed annealing algorithm is proposed to solve the problem. Finally, we carried out two sets of experiments and results showed that the proposed algorithm can obtain high quality solutions in a short time.