AbstractsComputer Science

The airline schedule planning process is an important component of airline operations, and it involves considerably complex problems. This research focuses on the aircraft routing phase. We introduce the concept of robustness in aircraft routing problems, and find solutions that can stand uncertainty. We categorize the delays in flight operations into two components – independent delay and propagated delay. In the data driven approach, independent delay can be regarded as constant, but propagated delay can be worked on. An example of aircraft swap is given to show that aircraft routing can potentially reduce the flight delays. To solve robust aircraft routing problems, we propose a list of formulations. They are in three categories – Lan, Clarke, Barnhart’s approach, chance-constrained programming approach, and extreme value approach. We conduct experiments with two airline networks – a 50-flight network and a 165-flight network. The K-fold cross validation approach is incorporated into aircraft routing problems to eliminate overfitting. According to the three evaluation metrics – on time performance, average total propagated delay and passenger disruptions, several good formulations are identified, which are recommended for airline schedule planners. We also explain the reasons behind the solution differences. Advisors/Committee Members: Lavanya, Marla (advisor).