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

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Standard

Assignment formulation for the Elevator Dispatching Problem with destination control and its performance analysis. / Ruokokoski, Mirko; Sorsa, Janne; Siikonen, Marja Liisa; Ehtamo, Harri.

julkaisussa: European Journal of Operational Research, Vuosikerta 252, Nro 2, 16.07.2016, s. 397–406.

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Harvard

APA

Vancouver

Author

Ruokokoski, Mirko ; Sorsa, Janne ; Siikonen, Marja Liisa ; Ehtamo, Harri. / Assignment formulation for the Elevator Dispatching Problem with destination control and its performance analysis. Julkaisussa: European Journal of Operational Research. 2016 ; Vuosikerta 252, Nro 2. Sivut 397–406.

Bibtex - Lataa

@article{7bc588b7fc6f4562936d73752e5059c4,
title = "Assignment formulation for the Elevator Dispatching Problem with destination control and its performance analysis",
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.",
keywords = "Assignment formulation, Collective control, Destination control, Elevator dispatching problem, Linear programming",
author = "Mirko Ruokokoski and Janne Sorsa and Siikonen, {Marja Liisa} and Harri Ehtamo",
year = "2016",
month = "7",
day = "16",
doi = "10.1016/j.ejor.2016.01.019",
language = "English",
volume = "252",
pages = "397–406",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "2",

}

RIS - Lataa

TY - JOUR

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

AU - Ruokokoski, Mirko

AU - Sorsa, Janne

AU - Siikonen, Marja Liisa

AU - Ehtamo, Harri

PY - 2016/7/16

Y1 - 2016/7/16

N2 - 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.

AB - 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.

KW - Assignment formulation

KW - Collective control

KW - Destination control

KW - Elevator dispatching problem

KW - Linear programming

UR - http://www.scopus.com/inward/record.url?scp=84956856800&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2016.01.019

DO - 10.1016/j.ejor.2016.01.019

M3 - Article

VL - 252

SP - 397

EP - 406

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -

ID: 6778237