IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-33482-0_75.html

Boarding of Finite-Size Passengers to an Airplane

In: Traffic and Granular Flow '15

Author

Listed:
  • Jevgenijs Kaupužs

    (Institute of Mathematical Sciences and Information Technologies, University of Liepaja)

  • Reinhard Mahnke

    (Institute of Physics, Rostock University)

  • Hans Weber

    (Luleå University of Technology, Department of Physics)

Abstract

AnKaupužs, Jevgenijs airplane boarding model, introduced earlier by Hemmer and Frette, is considered. In this model, N passengersMahnke, Reinhard have reserved seats, but enterWeber, Hans the airplane in arbitrary order. Here we focus on the blocking relations between passengers. The total boarding time is equal to the longest blocking sequence, represented by a line, connecting points of the two-dimensional q versus r scatter plot. Here, $$q=i/N$$ q = i / N and $$r=j/N$$ r = j / N , i and j being sequential numbers of passengers in the queue and their seat numbers, respectively. Such blocking sequences have been studied theoretically by Bachmat. We have developed an algorithm for numerical simulation of the longest blocking sequences, and have compared the results with analytical predictions for $$N \rightarrow \infty $$ N → ∞ .

Suggested Citation

  • Jevgenijs Kaupužs & Reinhard Mahnke & Hans Weber, 2016. "Boarding of Finite-Size Passengers to an Airplane," Springer Books, in: Victor L. Knoop & Winnie Daamen (ed.), Traffic and Granular Flow '15, pages 597-604, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-33482-0_75
    DOI: 10.1007/978-3-319-33482-0_75
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:sprchp:978-3-319-33482-0_75. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.