EconPapers    
Economics at your fingertips  
 

Real-time algorithms for the bilevel double-deck elevator dispatching problem

Janne Sorsa ()
Additional contact information
Janne Sorsa: KONE Industrial Ltd

EURO Journal on Computational Optimization, 2019, vol. 7, issue 1, No 4, 79-122

Abstract: Abstract Double-deck elevators consist of two elevator cars attached together and, thus, save building core space. In the destination control system (DCS), passengers register their destination floors in the elevator lobbies. In return, the DCS immediately assigns an elevator to each transportation request and signals it to the passenger. Based on the additional information, the DCS is able to increase handling capacity under incoming traffic conditions. However, the double-deck DCS does not yet function optimally in mixed lunch traffic, which consists of incoming, outgoing and interfloor traffic. In this paper, the double-deck DCS is further developed by introducing delayed elevator and deck assignments. With the delayed assignments, the serving elevator or deck of each request can be reassigned to another elevator or deck until the last moment. Such a double-deck DCS can better adapt to emerging requests and, as a result, can improve passenger service quality in lunch traffic dramatically. To enable real-time optimization in an elevator group control system, this paper formulates the double-deck elevator dispatching problem as a bilevel optimization problem and solves the problem fast with a genetic algorithm. Numerical experiments show that the bilevel algorithm outperforms the earlier single-level algorithm in both solution quality and computation times.

Keywords: Bilevel optimization; Genetic algorithm; Elevator dispatching; Destination control; Double-deck elevator; Delayed assignments; 90B08 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s13675-018-0108-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:eurjco:v:7:y:2019:i:1:d:10.1007_s13675-018-0108-8

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/13675

DOI: 10.1007/s13675-018-0108-8

Access Statistics for this article

EURO Journal on Computational Optimization is currently edited by Martine C. Labbé

More articles in EURO Journal on Computational Optimization from Springer, EURO - The Association of European Operational Research Societies
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:eurjco:v:7:y:2019:i:1:d:10.1007_s13675-018-0108-8