Solving the schedule transition problem using optimization techniques

Abstract

A new algorithm is introduced for effectively solving the airline schedule transition problem, which involves efficiently re-routing aircraft in order to balance the number and the types of aircraft at each station at the beginning of a new schedule with minimum cost. An extensive study was performed on using "pre-switches" - changing aircraft types of certain flights on the last day of the current schedule - and "post-switches" - changing aircraft types of certain flights on the first day of the new schedule - to balance the types of aircraft at each station for a pair of aircraft types. Several possibilities for extension to fleets of more than two aircraft types were examined. Airlines may use this algorithm in order to transition smoothly to the new schedule instead of relying on instincts of schedule analysts.