IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v317y2024i3p748-761.html
   My bibliography  Save this article

Let the fast passengers wait: Boarding an airplane takes shorter time when passengers with the most bin luggage enter first

Author

Listed:
  • Erland, Sveinung
  • Bachmat, Eitan
  • Steiner, Albert

Abstract

Airlines usually organize the passenger queue by letting certain groups of passengers enter the airplane in a specific order. The total boarding time of such airplane boarding policies can be estimated and compared by a Lorentzian metric based on the one used in Einstein’s theory of relativity. The metric accounts for aisle-clearing times that depend on the passengers’ queue positions, in particular when passengers in the back of the queue with increasing probability will have to wait for already seated aisle or middle seat passengers to rise up and let the others pass to a seat closer to the window. We provide closed-form expressions for the asymptotic total boarding time when the number of passengers is large, and prove that the best queue ordering with low congestion is according to decreasing luggage-handling time. The effect of seat interference amplifies the previously shown superiority of slow first vs. random boarding and fast first. That this ranking of policies also holds for realistic congestion is illustrated by both analytical methods and simulations, and parameters are taken from empirical data. However, the result is non-trivial, as the ranking shifts for unrealistically high congestion. Based on the analytical results, we demonstrate that the slow-first policy can be improved by dividing the passengers into more than two groups based on their number of bin luggage items, and let the slowest groups with the most luggage items enter the queue first.

Suggested Citation

  • Erland, Sveinung & Bachmat, Eitan & Steiner, Albert, 2024. "Let the fast passengers wait: Boarding an airplane takes shorter time when passengers with the most bin luggage enter first," European Journal of Operational Research, Elsevier, vol. 317(3), pages 748-761.
  • Handle: RePEc:eee:ejores:v:317:y:2024:i:3:p:748-761
    DOI: 10.1016/j.ejor.2022.12.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722009754
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2022.12.027?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:317:y:2024:i:3:p:748-761. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.