船员
计算机科学
还原(数学)
质量(理念)
多样性(控制论)
运筹学
空格(标点符号)
航空
监督学习
人工智能
机器学习
降低成本
最优化问题
数学优化
数学模型
基线(sea)
工程类
不确定度归约理论
可靠性工程
作者
Ahmet Esat Hızır,Cynthia Barnhart,Vikrant Vaze
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2025-12-23
卷期号:60 (2): 177-196
标识
DOI:10.1287/trsc.2025.0105
摘要
Airlines take a variety of actions to recover schedules of their aircraft, crew, and passengers from operational disruptions. Aircraft are typically recovered first, followed by crew recovery, and then passenger recovery. This paper aims to repair disrupted crew schedules while ensuring the feasibility of previously decided aircraft recovery plans and indirectly accounting for passenger disruption costs. We develop a fast solution approach that effectively combines mixed-integer optimization and supervised machine learning (ML) methods to find high-quality solutions to large-scale recovery problems. Our approach reduces the solution space by adding constraints based on the patterns discovered in the solutions to offline instances. The model with the added constraints is solved using a mixed-integer optimization solver. To account for the fact that the available time for airlines to handle disruptions may vary during the day of operations, our solution approach allows parameter tuning to flexibly match the extent of solution space reduction to the available runtime. This helps the proposed method to effectively navigate the trade-off between solution quality and runtime. Extensive computational experiments with actual flight and crew schedules of a major U.S. airline with more than 2,800 daily flights show that our approach consistently generates solutions of significantly higher quality than benchmarks and is estimated to provide tens of millions of dollars of reduction in annual operating costs. Moreover, our ML models have interpretable structures that are critical to enhance end-user trust in the ML recommendations. Finally, our approach yields solutions that are more robust to uncertainty in delay prediction than those found by direct optimization. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0105 .
科研通智能强力驱动
Strongly Powered by AbleSci AI