<p>The Aircraft Maintenance Routing Problem (AMRP) involves assigning aircraft to the sequence of flights regarding maintenance considerations. This study proposes a bi-objective mixed integer model for cost minimization and fair assignment of aircraft to the flights taking into account their age and efficiency. The proposed model uses flight hours, the number of take-offs, and successive duty days passed from the last maintenance operation as the threshold values to initiate maintenance operations. Despite previous researches, the threshold values in this paper are not necessarily the same for all aircraft and are determined after performing the last maintenance operation as a non-deterministic parameter. To address the uncertainty, a robust optimization approach is used. Moreover, NSGA-II is employed as the solution method. To evaluate the efficiency of the solution technique, 31 test instances of various sizes are solved using the epsilon constraint method and the NSGA-II. The NSGA-II optimality gap does not exceed 0.07% for small and medium-sized problems. Meanwhile, the CPU time of large-scale problems has been improved by over 98%. The model is verified using a real-world case.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A condition-based maintenance strategy for the aircraft routing problem to cost minimization and fair assignment of aircraft: a robust optimization approach

  • Hiwa Esmaeilzadeh,
  • Alireza Rashidi Komijan,
  • Hamed Kazemipoor,
  • Mohammad Fallah,
  • Reza Tavakkoli-Moghaddam

摘要

The Aircraft Maintenance Routing Problem (AMRP) involves assigning aircraft to the sequence of flights regarding maintenance considerations. This study proposes a bi-objective mixed integer model for cost minimization and fair assignment of aircraft to the flights taking into account their age and efficiency. The proposed model uses flight hours, the number of take-offs, and successive duty days passed from the last maintenance operation as the threshold values to initiate maintenance operations. Despite previous researches, the threshold values in this paper are not necessarily the same for all aircraft and are determined after performing the last maintenance operation as a non-deterministic parameter. To address the uncertainty, a robust optimization approach is used. Moreover, NSGA-II is employed as the solution method. To evaluate the efficiency of the solution technique, 31 test instances of various sizes are solved using the epsilon constraint method and the NSGA-II. The NSGA-II optimality gap does not exceed 0.07% for small and medium-sized problems. Meanwhile, the CPU time of large-scale problems has been improved by over 98%. The model is verified using a real-world case.