This project is to solve the fleet scheduling problem for a large airline. This requires matching each fight in a schedule to a plane in the fleet that will fly the scheduled flight on a particular day. This thesis shows how to use the network flow model of a flight schedule in order to find the smallest fleet required to fly a schedule without dropping any flights. This is done by pruning the whole network to a smaller set of more relevant arcs. It is also the goal of the project to perform these tasks without requiring a large powerful computer or workstation.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Evolving efficient airline schedules


    Beteiligte:

    Erscheinungsdatum :

    2000


    Format / Umfang :

    59 pages , 3411285 byte , 3411041 byte


    Anmerkungen:

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
    Includes bibliographical references (p. 59).


    Medientyp :

    Hochschulschrift


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Optimized Schedules for Airline Routes

    Chang, Sze-Wei | Online Contents | 2004


    Optimized Schedules for Airline Routes

    Chang, S.-W. / Schonfeld, P. | British Library Online Contents | 2004


    Evaluating airline delays : the role of airline networks, schedules, and passenger demands

    Zhu, Ying, S.M. Massachusetts Institute of Technology | DSpace@MIT | 2009

    Freier Zugriff