Soft actor-critic facilitated algorithm for maintenance optimization considering reliability

This paper studies a maintenance optimization problem considering reliability for the engines equipped on a fleet of airplanes. During operations, engines inevitably encounter the risk of in-flight alerts, which can significantly impact maintenance decisions and flight scheduling. Therefore, we formulate a mathematical model to jointly optimize flight-to-engine assignments, the timing of shop visits, and the depth of modular maintenance based on in-flight alert reliability analysis. To solve this comprehensive optimization problem, we propose a soft actor-critic (SAC) facilitated algorithm. The algorithm integrates a graph attention network based dual stabilization strategy to accelerate convergence, alongside an improved SAC method incorporated with a reward shaping mechanism to further enhance computational efficiency. Experimental results demonstrate that the proposed algorithm reduces the computational time by 34% compared to the traditional column generation method. Finally, we derive several managerial insights for airline operations. For instance, constructing flight portfolios with moderate heterogeneity can balance engine flight hour and flight cycle consumption to extend operational time between maintenance events, and given the uneven degradation across engine modules, differentiated flight assignments prevent simultaneous shop visits, thereby reducing total maintenance costs.

Authors

Institutions

Publication Details

Journal
IISE Transactions
Published
2026-08-20
DOI
https://doi.org/10.1080/24725854.2026.2720882
Primary Topic
Reliability and Maintenance Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Soft actor-critic facilitated algorithm for maintenance optimization considering reliability

Lu Zhen, Jiawen Hu, Jianyi Zhao
IISE Transactions
Reliability and Maintenance Optimization
article

Soft actor-critic facilitated algorithm for maintenance optimization considering reliability

Lu Zhen, Jiawen Hu, Jianyi Zhao
article en

Abstract

This paper studies a maintenance optimization problem considering reliability for the engines equipped on a fleet of airplanes. During operations, engines inevitably encounter the risk of in-flight alerts, which can significantly impact maintenance decisions and flight scheduling. Therefore, we formulate a mathematical model to jointly optimize flight-to-engine assignments, the timing of shop visits, and the depth of modular maintenance based on in-flight alert reliability analysis. To solve this comprehensive optimization problem, we propose a soft actor-critic (SAC) facilitated algorithm. The algorithm integrates a graph attention network based dual stabilization strategy to accelerate convergence, alongside an improved SAC method incorporated with a reward shaping mechanism to further enhance computational efficiency. Experimental results demonstrate that the proposed algorithm reduces the computational time by 34% compared to the traditional column generation method. Finally, we derive several managerial insights for airline operations. For instance, constructing flight portfolios with moderate heterogeneity can balance engine flight hour and flight cycle consumption to extend operational time between maintenance events, and given the uneven degradation across engine modules, differentiated flight assignments prevent simultaneous shop visits, thereby reducing total maintenance costs.

IISE Transactions
Shanghai University (CN)
Openalex Percentile: Top 10%
Reliability and Maintenance Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.