RLEM: Deep Reinforcement Learning Ensemble Method for Aircraft Recovery Problem

Efficient flight scheduling is crucial to properly allocate airline resources, but even the best flight schedule has to face unexpected delays and disruptions. The ability to recover from such disruptions is essential for airlines to minimize the negative impact on their revenue and reputation. In this context, machine learning-based methods can be used to identify suitable recovery methods as unexpected events occur. Reinforcement learning approaches are especially promising since they extract suitable solutions much more efficiently than conventional optimization and meta-heuristics methods and provide timely rescheduling capabilities for airlines, which translates into reduced capital and reputation losses. However, current works either do not leverage deep learning or focus on simple scenarios that do not fully entail real-world complexities, resulting in limited efficiency or sub-optimal solutions. In this paper, we propose an ensemble of two deep learning approaches: Deep Double Q-Learning (DDQL) and Advantage Actor-Critic (A2C). The models aim to minimize the total delays caused by disruptions by swapping aircraft and delaying flights as recovery options. We perform experiments with a benchmark dataset and a real-world airline dataset, showing that our method is effective in providing a significant reduction of delays caused by disruptions.

Authors

Publication Details

Published
2024-12-15
DOI
https://doi.org/10.1109/bigdata62323.2024.10826050
Citations
1
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RLEM: Deep Reinforcement Learning Ensemble Method for Aircraft Recovery Problem

Kamil Faber, Marcin Pietroń, Michał Karwatowski, Dominik Żurek et al.
1 citations
Reinforcement Learning in Robotics
0.35
article

RLEM: Deep Reinforcement Learning Ensemble Method for Aircraft Recovery Problem

Kamil Faber, Marcin Pietroń, Michał Karwatowski, Dominik Żurek, Szymon Piórkowski
article en
1 citations

Abstract

Efficient flight scheduling is crucial to properly allocate airline resources, but even the best flight schedule has to face unexpected delays and disruptions. The ability to recover from such disruptions is essential for airlines to minimize the negative impact on their revenue and reputation. In this context, machine learning-based methods can be used to identify suitable recovery methods as unexpected events occur. Reinforcement learning approaches are especially promising since they extract suitable solutions much more efficiently than conventional optimization and meta-heuristics methods and provide timely rescheduling capabilities for airlines, which translates into reduced capital and reputation losses. However, current works either do not leverage deep learning or focus on simple scenarios that do not fully entail real-world complexities, resulting in limited efficiency or sub-optimal solutions. In this paper, we propose an ensemble of two deep learning approaches: Deep Double Q-Learning (DDQL) and Advantage Actor-Critic (A2C). The models aim to minimize the total delays caused by disruptions by swapping aircraft and delaying flights as recovery options. We perform experiments with a benchmark dataset and a real-world airline dataset, showing that our method is effective in providing a significant reduction of delays caused by disruptions.

Affordable and clean energy
Openalex Percentile: Top 30%
Reinforcement Learning in Robotics
0.35
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.