loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Juha-Matti Kuusinen ; Mirko Ruokokoski ; Janne Sorsa and Marja-Liisa Siikonen

Affiliation: KONE Corporation, Finland

Keyword(s): Elevator traffic, Origin-destination Matrix, Linear Programming, Branch-and-bound.

Related Ontology Subjects/Areas/Topics: Applications ; Artificial Intelligence ; e-Business ; Enterprise Information Systems ; Industrial Engineering ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Linear Programming ; Logistics ; Mathematical Modeling ; Methodologies and Technologies ; Network Optimization ; Operational Research ; Optimization ; OR in Transportation ; Pattern Recognition ; Software Engineering ; Symbolic Systems

Abstract: Elevator group control dispatches elevators to passengers’ calls in a dynamic environment where new calls constantly emerge. At the moment of making a dispatching decision, it is not known when and at which floors new passengers will register new calls, what is the number of passengers waiting behind these and existing calls, and what are their destinations. Robust dispatching decisions require that future passenger traffic is forecast based on the realized passenger flow in a building. The problem is that this flow cannot be directly measured. It can, however, be estimated by finding the passenger counts for the origins and destinations of every elevator trip occurring in a building. An elevator trip consists of successive stops in one direction of travel with passengers inside the elevator. We formulate the elevator trip origin-destination matrix estimation problem as a minimum cost network flow problem. We also present a branch-and-bound algorithm for finding all solutions to the problem and study its performance based on numerical experiments. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.238.138.162

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kuusinen, J.; Ruokokoski, M.; Sorsa, J. and Siikonen, M. (2013). Linear Programming Formulation of the Elevator Trip Origin-destination Matrix Estimation Problem. In Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-8565-40-2; ISSN 2184-4372, SciTePress, pages 298-303. DOI: 10.5220/0004338502980303

@conference{icores13,
author={Juha{-}Matti Kuusinen. and Mirko Ruokokoski. and Janne Sorsa. and Marja{-}Liisa Siikonen.},
title={Linear Programming Formulation of the Elevator Trip Origin-destination Matrix Estimation Problem},
booktitle={Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - ICORES},
year={2013},
pages={298-303},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004338502980303},
isbn={978-989-8565-40-2},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - ICORES
TI - Linear Programming Formulation of the Elevator Trip Origin-destination Matrix Estimation Problem
SN - 978-989-8565-40-2
IS - 2184-4372
AU - Kuusinen, J.
AU - Ruokokoski, M.
AU - Sorsa, J.
AU - Siikonen, M.
PY - 2013
SP - 298
EP - 303
DO - 10.5220/0004338502980303
PB - SciTePress