Dynamic multi-objective aviation maintenance scheduling: an algorithmic framework

Aviation maintenance scheduling presents complex challenges due to dynamic task arrivals, stochastic service times, and the need to balance competing objectives. To address this, we introduce a novel framework that integrates these factors into a real-time, multi-objective optimization model. Our approach combines mathematical modeling with advanced meta-heuristic algorithms, supported by new theoretical performance guarantees. We evaluate nine algorithms across 810 experimental configurations, demonstrating that our proposed methods achieve statistically significant improvements over baseline scheduling approaches. Among single-objective metrics, Adaptive Tabu Search (ATS) achieves the lowest cost at $13,072 ± $4544, while multi-objective methods provide diverse Pareto fronts with a mean hypervolume of 0.0268 (normalized scale [0, 1]), dominating significantly more of the objective space than comparative methods. The framework demonstrates the potential for significant operational cost reductions and provides a robust theoretical foundation for developing next-generation maintenance scheduling systems.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-02-17
DOI
https://doi.org/10.1038/s41598-026-40304-0
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic multi-objective aviation maintenance scheduling: an algorithmic framework

Chen Lv, Le Qi, Tao Zhang, Yun Wang
Scientific Reports
Vehicle Routing Optimization Methods
article

Dynamic multi-objective aviation maintenance scheduling: an algorithmic framework

Chen Lv, Le Qi, Tao Zhang, Yun Wang
article en

Abstract

Aviation maintenance scheduling presents complex challenges due to dynamic task arrivals, stochastic service times, and the need to balance competing objectives. To address this, we introduce a novel framework that integrates these factors into a real-time, multi-objective optimization model. Our approach combines mathematical modeling with advanced meta-heuristic algorithms, supported by new theoretical performance guarantees. We evaluate nine algorithms across 810 experimental configurations, demonstrating that our proposed methods achieve statistically significant improvements over baseline scheduling approaches. Among single-objective metrics, Adaptive Tabu Search (ATS) achieves the lowest cost at $13,072 ± $4544, while multi-objective methods provide diverse Pareto fronts with a mean hypervolume of 0.0268 (normalized scale [0, 1]), dominating significantly more of the objective space than comparative methods. The framework demonstrates the potential for significant operational cost reductions and provides a robust theoretical foundation for developing next-generation maintenance scheduling systems.

Scientific ReportsVol. 16(1)
Civil Aviation University of China (CN), Air Force Engineering University (CN), PLA Air Force Aviation University (CN), Beihang University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 55%
Vehicle Routing Optimization Methods
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.