2021
DOI: 10.1016/j.cie.2021.107190
|View full text |Cite
|
Sign up to set email alerts
|

Double deck elevator group control systems using evolutionary algorithms: Interfloor and lunchpeak traffic analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(14 citation statements)
references
References 37 publications
0
14
0
Order By: Relevance
“…As skyscrapers get higher, reducing the number of shafts needed becomes more important because they eat up valuable interior space on every floor (Figure 5). Double-deck elevators are most useful for applications in very tall buildings, particularly for shuttle services [14,15] . However, the double-deck elevators suffer from some operational challenges.…”
Section: Double-deck Elevatorsmentioning
confidence: 99%
See 1 more Smart Citation
“…As skyscrapers get higher, reducing the number of shafts needed becomes more important because they eat up valuable interior space on every floor (Figure 5). Double-deck elevators are most useful for applications in very tall buildings, particularly for shuttle services [14,15] . However, the double-deck elevators suffer from some operational challenges.…”
Section: Double-deck Elevatorsmentioning
confidence: 99%
“…Equal floor rise could present a limitation; i.e., for local service, double-deck elevators must load and unload two decks simultaneously. Even though traffic is reduced during off-peak hours, both decks will be operating [15,16] .…”
Section: Double-deck Elevatorsmentioning
confidence: 99%
“…The scheduling algorithm has a wide range of applications, not only in elevators but also in computer hard disk, transportation, express transportation, and wireless networks [1][2][3]. The current common elevator scheduling algorithms include FCFS (First Come First Serve), SCAN, LOOk algorithm, SSTF (Shortest Seek Time First), SATF (Shortest Access Time First), etc., [4][5][6][7].…”
Section: Related Workmentioning
confidence: 99%
“…At the first iteration, the elevator is ready to go up and handle the reservation tasks on the first floor, and the initial value of the iterative algorithm satisfies the following relationship: The remaining matrix R (1) =W (1) up , the waiting matrix W As long as the users are not overloaded, the first floor users will be allowed to continue enter.…”
Section: Dynamic Matrix Iterative Optimization Algorithmmentioning
confidence: 99%
See 1 more Smart Citation