Multiple fleet aircraft schedule recovery following hub closures

This paper presents three multi-commodity network-type models for determini ng a recovery schedule for all aircraft operated by a large carrier followi ng a hub closure. The first is a pure network with side constraints, the se cond is a generalized network, and the third is a pure network with side co nstraints in which the time horizon is discretized, Each model allows for c ancellations, delays, ferry flights, and substitution between fleets and su bfleets. In the first two cases, the objective is to maximize a "profit" fu nction which includes an incentive to maintain as much of the original airc raft routings as possible. In the third case, the objective is to minimize the sum of cancellation and delay costs. After comparing solution quality and computation times for each of the thre e models, the first was seen to outperform the others and was singled out f or further analysis. Results for a comprehensive set of scenarios are prese nted along with ideas for continuing work. (C) 2001 Elsevier Science Ltd. A ll rights reserved.