A Very Large-Scale Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model

The fleet assignment model (FAM) for an airline assigns fleet types to the set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. A through connection at a station is a connection between an arrival flight and a departure flight at the station, both of which have the same fleet type assigned to them that ensures that the same plane flies both legs. Typically, passengers are willing to pay a premium for through connections. The through assignment model (TAM) identifies a set of profitable throughs between arrival and departure flights flown by the same fleet type at each station to maximize the through benefits. The through assignment model is usually solved after obtaining the solution from a fleet assignment model. In this current sequential approach, the through assignment model cannot change the fleeting in order to get a better through assignment, and the fleet assignment model does not take into account the through benefits. The goal of the combined through and fleet assignment model (ctFAM) is to come up with a fleeting and through assignment that achieves the maximum combined benefit of the integrated model. We give a mixed integer programming formulation of ctFAM that is too large to be solved to optimality or near-optimality within allowable time for the data obtained by a major US airline. We thus focus on neighborhood search algorithms for solving ctFAM, in which we start with the solution obtained by the previous sequential approach (that is, solving FAM first and followed by TAM) and improve it successively. Our approach is based on generalizing the swap-based neighborhood search approach of Talluri [1996] for FAM which proceeds by swapping the fleet assignment of two flight paths flown by two different plane types that originate and terminate at the same stations and the same times. An important feature of our approach is that the size of the neighborhood defined by us is very large; hence the suggested algorithm falls in the category of Very Large-Scale Neighborhood (VLSN) Search Algorithms. Another important feature of our approach is that we use integer programming to identify improved neighbors. We provide computational results which indicate that the neighborhood search approach for ctFAM provides substantial savings over the sequential approach of solving FAM and TAM