Recently, as a means of forming global networks and improving operation efficiency, major air carriers have increasingly entered into alliances with other carriers. Fleet routing and flight scheduling are not only important in individual airline operations, but also affect the alliances. The setting of a good flight schedule can not only enhance allied airline operating performance, but can also be a useful reference for alliance decision-making. In this research, we develop several coordinated scheduling models, which will help the allied airlines solve for the most satisfactory fleet routes and timetables under the alliance. We employ network flow techniques to construct the models. The models are formulated as multiple commodity network flow problems which can be solved using a mathematical programming solver. Finally, to evaluate the models, we perform a case study based on real operating data from two Taiwan airlines. The preliminary results are good, showing that the models could be useful for airline alliances.
|Number of pages||19|
|Journal||Transportation Research Part C: Emerging Technologies|
|State||Published - Aug 2007|
- Fleet routing
- Multiple commodity network flow problem