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

Assignment formulation for the Elevator Dispatching Problem with destination control and its performance analysis

Author

Listed:
  • Ruokokoski, Mirko
  • Sorsa, Janne
  • Siikonen, Marja-Liisa
  • Ehtamo, Harri

Abstract

This paper studies the Elevator Dispatching Problem arising in destination controls. In many of the presented methods to the problem a routing aspect is not considered; decision variables specify only request-to-elevator assignments and the service order of the requests is determined by applying a heuristic rule called the collective control principle. However, quality of this approach is rarely investigated. In this paper the approach is compared with a formulation defining explicitly the elevator routes. The average waiting time as well as average journey time are used as objective functions in the comparisons. Computational experiments with the former objective function on random instances arising during light and normal traffic conditions indicate that both approaches very often produce the same solution while with the latter one the situation is the opposite. Some well-known traffic patterns are also analyzed to identify cases in which the optimal solutions of these approaches are equal.

Suggested Citation

  • Ruokokoski, Mirko & Sorsa, Janne & Siikonen, Marja-Liisa & Ehtamo, Harri, 2016. "Assignment formulation for the Elevator Dispatching Problem with destination control and its performance analysis," European Journal of Operational Research, Elsevier, vol. 252(2), pages 397-406.
    • Handle: RePEc:eee:ejores:v:252:y:2016:i:2:p:397-406
    DOI: 10.1016/j.ejor.2016.01.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716000485
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.01.019?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.

    References listed on IDEAS

    as
    1. Tanaka, Shunji & Uraguchi, Yukihiro & Araki, Mituhiko, 2005. "Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm," European Journal of Operational Research, Elsevier, vol. 167(2), pages 574-587, December.
    2. Tanaka, Shunji & Uraguchi, Yukihiro & Araki, Mituhiko, 2005. "Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part I. Formulation and simulations," European Journal of Operational Research, Elsevier, vol. 167(2), pages 550-573, December.
    3. Mirko Ruokokoski & Harri Ehtamo & Panos M. Pardalos, 2015. "Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 750-780, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Janne Sorsa, 2019. "Real-time algorithms for the bilevel double-deck elevator dispatching problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(1), pages 79-122, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shunji Tanaka & Daiki Hoshino & Masashi Watanabe, 2016. "Group control of multi-car elevator systems without accurate information of floor stoppage time," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 461-494, September.
    2. Janne Sorsa, 2019. "Real-time algorithms for the bilevel double-deck elevator dispatching problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(1), pages 79-122, March.

    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:252:y:2016:i:2:p:397-406. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.