IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-20009-0_40.html
   My bibliography  Save this book chapter

Improved Destination Call Elevator Control Algorithms for Up Peak Traffic

In: Operations Research Proceedings 2010

Author

Listed:
  • Benjamin Hiller

    (Zuse Institute Berlin)

  • Torsten Klug

    (Zuse Institute Berlin)

  • Andreas Tuchscherer

    (Zuse Institute Berlin)

Abstract

We consider elevator control algorithms for destination call systems, where passengers specify the destination floor when calling an elevator. In particular, we propose a number of extensions to our algorithm BI [4] aimed to improve the performance for high intensity up peak traffic, which is the most demanding traffic situation. We provide simulation results comparing the performance achieved with these extensions and find that one of them performs very well under high intensity traffic and still satisfactorily at lower traffic intensities.

Suggested Citation

  • Benjamin Hiller & Torsten Klug & Andreas Tuchscherer, 2011. "Improved Destination Call Elevator Control Algorithms for Up Peak Traffic," Operations Research Proceedings, in: Bo Hu & Karl Morasch & Stefan Pickl & Markus Siegle (ed.), Operations Research Proceedings 2010, pages 251-256, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-20009-0_40
    DOI: 10.1007/978-3-642-20009-0_40
    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 search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stefan Heinz & Jörg Rambau & Andreas Tuchscherer, 2014. "Computational bounds for elevator control policies by large scale linear programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(1), pages 87-117, February.

    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:oprchp:978-3-642-20009-0_40. 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.