The Elevator Trip Origin-Destination Matrix Estimation Problem

Juha-Matti Kuusinen (), Janne Sorsa () and Marja-Liisa Siikonen ()
Additional contact information
Juha-Matti Kuusinen: KONE Corporation, 02150 Espoo, Finland
Janne Sorsa: KONE Corporation, 02150 Espoo, Finland
Marja-Liisa Siikonen: KONE Corporation, 02150 Espoo, Finland

Transportation Science, 2015, vol. 49, issue 3, 559-576

Abstract: In this paper, we consider the problem of finding the passenger counts for the origin-destination pairs of a particular single transit route called elevator trip. Assuming that passengers first alight and then board a stopping elevator, we can define an elevator trip as successive stops in one direction of travel with passengers inside the elevator. The elevator trip origin-destination passenger counts, i.e., elevator trip origin-destination matrices, estimated for a given time interval can be combined into a building origin-destination matrix that describes the passenger flow between every pair of floors in the building during that interval. The building origin-destination matrices of successive intervals form traffic statistics that can be used to forecast passenger traffic. The forecasts model the uncertainties related to future passengers, and need to be taken into account in elevator dispatching to make robust dispatching decisions in constantly changing traffic conditions. Many methods exist for estimating an origin-destination matrix for a single transit route such as a bus line. These methods estimate average origin-destination passenger counts from observations made during a given time period on the same route. Because an elevator trip is request driven, there may not be two similar elevator trips even within a day. This means that we need to estimate a separate origin-destination matrix for each elevator trip. A natural requirement then is that the estimated origin-destination passenger counts are integer valued. We formulate the elevator trip origin-destination matrix estimation problem as a box-constrained integer least squares problem, and present branch-and-bound-based algorithms for finding all solutions to the problem. The performance of the algorithms with respect to execution time is studied based on numerical experiments. The results show that the formulation and the algorithms are fast enough for solving elevator trip origin-destination matrix estimation problems in a real elevator group control application.

Keywords: elevator traffic; origin-destination matrix; integer least squares (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2013.0509 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:49:y:2015:i:3:p:559-576

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().