TY - JOUR
T1 - Measuring node importance in air transportation systems
T2 - On the quality of complex network estimations
AU - Wandelt, Sebastian
AU - Xu, Yifan
AU - Sun, Xiaoqian
N1 - Publisher Copyright:
© 2023 Elsevier Ltd
PY - 2023/12
Y1 - 2023/12
N2 - Throughout the last two decades, many studies have used complex network analysis techniques to estimate the importance of airports for airline operations. Various node importance measures were exploited to obtain a ranking of airports for a given airline, to quantify the overall criticality for the airline at hand. However, neither of these measures have been evaluated against a realistic reference baseline. In this study, we propose a mixed-integer program formulation for an airline recovery baseline under node disruptions. Given the intrinsic complexity, we devise a variable neighborhood search heuristic to compute near-optimal solutions for real-size airline networks. We use the optimization-based recovery model to compare against the existing node importance methods in the literature, for a set of real airline operational schedules. Our experiments show that the existing simplifications based on complex networks often underestimate the effect of node failures and that there exist significant ranking mismatches especially for top-ranked nodes. We believe that our work helps to better assess the role of airports in airline networks, not only on the way towards providing a scalable operation-focused solution to the problem, but also by giving an empirical estimation regarding the quality of complex network abstractions used prevalently in the literature.
AB - Throughout the last two decades, many studies have used complex network analysis techniques to estimate the importance of airports for airline operations. Various node importance measures were exploited to obtain a ranking of airports for a given airline, to quantify the overall criticality for the airline at hand. However, neither of these measures have been evaluated against a realistic reference baseline. In this study, we propose a mixed-integer program formulation for an airline recovery baseline under node disruptions. Given the intrinsic complexity, we devise a variable neighborhood search heuristic to compute near-optimal solutions for real-size airline networks. We use the optimization-based recovery model to compare against the existing node importance methods in the literature, for a set of real airline operational schedules. Our experiments show that the existing simplifications based on complex networks often underestimate the effect of node failures and that there exist significant ranking mismatches especially for top-ranked nodes. We believe that our work helps to better assess the role of airports in airline networks, not only on the way towards providing a scalable operation-focused solution to the problem, but also by giving an empirical estimation regarding the quality of complex network abstractions used prevalently in the literature.
KW - Airlines
KW - Comparison
KW - Networks
KW - Robustness
UR - https://www.scopus.com/pages/publications/85169570304
U2 - 10.1016/j.ress.2023.109596
DO - 10.1016/j.ress.2023.109596
M3 - 文章
AN - SCOPUS:85169570304
SN - 0951-8320
VL - 240
JO - Reliability Engineering and System Safety
JF - Reliability Engineering and System Safety
M1 - 109596
ER -