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)


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    The Airline Minimum Fleet Problem


    Beteiligte:
    H. Q. Danh (Autor:in)

    Erscheinungsdatum :

    1974


    Format / Umfang :

    93 pages


    Medientyp :

    Report


    Format :

    Keine Angabe


    Sprache :

    Englisch




    Distributionally robust airline fleet assignment problem

    Silva, Marco / Poss, Michael | DataCite | 2019


    World airline fleet

    Online Contents | 1996


    Airline Fleet List

    Online Contents | 1994


    Airline fleet planning

    Wilkinson, K.G. | Engineering Index Backfile | 1961


    Airline fleet list

    Online Contents | 1993