The problem of determining a schedule for a traffic system such as an airline system that requires a minimum number of vehicles is formulated as a special-type assignment problem. Two proposed solution algorithms are presented and demonstrated on the past examples, for both fixed departure times and variable ones within a given time tolerance. The conclusion is that the algorithm can be applied to solve a large scale problem with considerable efficiency and simplicity. The method is then applied to Australian Domestic Airline System for flight scheduling (1969) and fleet planning (1980). (Author)
The Airline Minimum Fleet Problem
1974
93 pages
Report
Keine Angabe
Englisch
Distributionally robust airline fleet assignment problem
DataCite | 2019
|Online Contents | 1996
Online Contents | 1994
Engineering Index Backfile | 1961
|Online Contents | 1993