A decision support framework for multi-fleet routing and multi-stop flight scheduling

Fleet routing and flight scheduling are important in airline carrier operations. Ineffective and inefficient fleet routing and flight scheduling will result in a substantial loss of profits. This research aims at developing a framework to help carriers adjust their draft timetables and fleet routes, when market demand conditions are expected to change in the near future. The framework is based on a basic model, constructed as a multi-fleet time-space network from which several strategic models are developed, to help carriers in fleet routing and flight scheduling. These models are formulated as multiple commodity network flow problems. The Lagrangian relaxation accompanied by the network simplex method, a Lagrangian heuristic and a modified sub-gradient method are suggested to solve the problems. A flow decomposition algorithm is also suggested in order to trace every aircraft route. To show how to apply this framework in the real world, a case study regarding the international operations of a major Taiwan airline was performed. The results show that, the framework would be useful for actual operations.

[1]  Jephthah A. Abara,et al.  Applying Integer Linear Programming to the Fleet Assignment Problem , 1989 .

[2]  Dusan Teodorovic,et al.  Multicriteria Model to Determine Flight Frequencies on an Airline Network under Competitive Conditions , 1989, Transp. Sci..

[3]  Boon Chai Lee,et al.  Routing problem with service choices , 1986 .

[4]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[5]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[6]  Ahmad I. Jarrah,et al.  A Decision Support Framework for Airline Flight Cancellations and Delays , 1993, Transp. Sci..

[7]  R. W. Simpson,et al.  Scheduling and routing models for airline systems , 1969 .

[8]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[9]  Warren B. Powell,et al.  A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy , 1989, Transp. Sci..

[10]  Warren Hyman,et al.  Commercial airline scheduling technique , 1968 .

[11]  Amos Levin.  Some fleet routing and scheduling problems for air transportation systems , 1969 .

[12]  Amos Levin.  Scheduling and Fleet Routing Models for Transportation Systems , 1971 .

[13]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[14]  Dušan Teodorović,et al.  Optimal dispatching strategy on an airline network after a schedule perturbation , 1984 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  M M Etschmaier,et al.  AIRCRAFT SCHEDULING : THE STATE OF THE ART , 1984 .

[17]  Shangyao Yan,et al.  Intermodal pricing using network flow techniques , 1995 .

[18]  Warren B. Powell,et al.  Shipment Routing Algorithms with Tree Constraints , 1992, Transp. Sci..