Theoretical and Natural Science
- The Open Access Proceedings Series for Conferences
Theoretical and Natural Science
Vol. 31, 07 March 2024
Open
Access | Article
Dynamic planning of office building elevator scheduling
* Author to whom correspondence should be addressed.
Abstract
Every morning rush hour is the most crowded time for elevators in office buildings, and many office workers will be late because they can't wait for the elevator. How to reasonably call the existing elevator resources has become a problem we need to pay attention to. In this paper, we will discuss the modeling of elevator scheduling optimization problem for office buildings. In this paper, the background and significance of the research is firstly explained, and then the elevator group linkage control system is briefly understood and analyzed, and the evaluation indexes are determined according to its multi-objective and diversified characteristics, and then the group control method focusing on making the elevator run time the shortest is adopted, and the principle of the ratio of elevator running period/total running time equal to the number of passengers transported/total passengers transported by the elevator in one cycle is followed to compare several common elevator running methods, and the results are summarized in the following table. Common elevator operation methods are compared, the most effective way to arrive at, and finally use dynamic programming to solve the partition point, to establish the optimal scheme of elevator scheduling for the office building division. Since it is not possible to expand the elevator in the office building, reducing the number of stops of each elevator to shorten the time required for the elevator to carry passengers becomes the most feasible method. After comparing the common elevator operation methods, it can be found that zoning can shorten the final average arrival time of passengers more than no zoning. That is, the elevators in an office building are divided into different zones, and each zone has a designated elevator serving a designated floor segment. In order to solve the floor segment allocation problem, the shortest path algorithm is used in this paper. The paper concludes with a summary and future outlook of the resulting optimization model.
Keywords
Dynamic Programming, Data Sifting, Exhaustive Law, Shortest Paths
References
1. De Jong, Jeroen Leonard. "Heuristics in dynamic scheduling: a practical framework with a case study in elevator dispatching." (2012).
2. Feng, Qiang, et al. "Dynamic scheduling of carrier aircraft based on improved ant colony algorithm under disruption and strong constraint." 2017 Second International Conference on Reliability Systems Engineering (ICRSE). IEEE, 2017.
3. Nikovski, Daniel, and Matthew Brand. "Decision-Theoretic Group Elevator Scheduling." ICAPS. Vol. 3. 2003.
4. Ahn, Sungyong, Soyoon Lee, and Hyokyung Bahn. "A smart elevator scheduler that considers dynamic changes of energy cost and user traffic." Integrated Computer-Aided Engineering 24.2 (2017): 187-202.
5. Luh, Peter B., Bo Xiong, and Shi-Chung Chang. "Group elevator scheduling with advance information for normal and emergency modes." IEEE Transactions on Automation Science and Engineering 5.2 (2008): 245-258.
Data Availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open Access Instruction).
- Volume Title
- Proceedings of the 3rd International Conference on Computing Innovation and Applied Physics
- ISBN (Print)
- 978-1-83558-317-3
- ISBN (Online)
- 978-1-83558-318-0
- Published Date
- 07 March 2024
- Series
- Theoretical and Natural Science
- ISSN (Print)
- 2753-8818
- ISSN (Online)
- 2753-8826
- DOI
- 10.54254/2753-8818/31/20240776
- Copyright
- 07 March 2024
- Open Access
- This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited