AbstractUsing a Markov Chain Monte Carlo optimization algorithm and a computer simulation, the passenger ordering that minimizes the time required to board an airplane is found. The model assumes that the time a passenger requires to load luggage makes is the dominant contribution to the time needed to completely fill the aircraft. The optimal boarding strategy may reduce the time required to board an airplane by a factor of four or more depending on the dimensions of the aircraft. Some of the salient features of the optimal boarding method are discussed along with practical modifications to the optimum.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal boarding method for airline passengers


    Contributors:

    Published in:

    Publication date :

    2008-01-01


    Size :

    5 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Optimal boarding method for airline passengers

    Steffen, J. H. | Online Contents | 2008


    EARLY BOARDING OF PASSENGERS IN AUTONOMOUS VEHICLES

    NEMEC PHILIP / HUBERT RENAUD-ROLAND / HERBACH JOSHUA SETH et al. | European Patent Office | 2018

    Free access

    EARLY BOARDING OF PASSENGERS IN AUTONOMOUS VEHICLES

    NEMEC PHILIP / HUBERT RENAUD-ROLAND / HERBACH JOSHUA SETH et al. | European Patent Office | 2022

    Free access

    EARLY BOARDING OF PASSENGERS IN AUTONOMOUS VEHICLES

    NEMEC PHILIP / HUBERT RENAUD-ROLAND / HERBACH JOSHUA SETH et al. | European Patent Office | 2021

    Free access

    Early boarding of passengers in autonomous vehicles

    NEMEC PHILIP / HUBERT RENAUD-ROLAND / HERBACH JOSHUA SETH et al. | European Patent Office | 2019

    Free access