Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 管理學院
  3. 資訊管理學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/99234
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor孔令傑zh_TW
dc.contributor.advisorLing-Chieh Kungen
dc.contributor.author楊佳芊zh_TW
dc.contributor.authorJia-Cian Yangen
dc.date.accessioned2025-08-21T16:55:12Z-
dc.date.available2025-08-22-
dc.date.copyright2025-08-21-
dc.date.issued2025-
dc.date.submitted2025-08-05-
dc.identifier.citationBednarz, A. 2010. Time spent waiting for elevators? 16 years for NYC office workers. NETWORKWORLD. https://www.networkworld.com, retrieved on 2024/12/3.
Dai, D., J. Zhang, W. Xie, Z. Yin, Y. Zhang. 2010. Elevator group-control policy with destination registration based on hybrid genetic algorithms. 2010 International Conference on Computer Application and System Modeling (ICCASM 2010), vol. 12. IEEE, Taiyuan, 535–538.
Kuusinen, J.-M., J. Sorsa, M.-L. Siikonen. 2015. The elevator trip origin-destination matrix estimation problem. Transportation Science 49(3) 559–576.
Prisco, J. 2019. A short history of the elevator. CNN Style. https://edition.cnn.com/ style/article/short-history-of-the-elevator, retrieved on 2024/12/3.
Ruokokoski, M., J. Sorsa, M.-L. Siikonen, H. Ehtamo. 2016. Assignment formulation for the elevator dispatching problem with destination control and its performance analysis. European Journal of Operational Research 252(2) 397–402.
Sorsa, J., H. Ehtamo, J.-M. Kuusinen, M. Ruokokoski, M.-L. Siikonen. 2018. Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control. Optimization Letters 12 171–185.
Tartan, E. O., C. Ciftlikli. 2016. A genetic algorithm based elevator dispatching method for waiting time optimization. International Federation of Automatic Control 49(3) 424–429.
Tyni, T., J. Ylinen. 2006. Evolutionary bi-objective optimisation in the elevator car routing problem. European Journal of Operational Research 169(3) 960–977.
Utgoff, P. E., M. E. Connell. 2012. Real-time combinatorial optimization for elevator group dispatching. IEEE Transactions on Systems, Man, and Cybernetics 42(1) 130– 146.
Vodopija, A., J. Stork, T. Bartz-Beielstein, B. Filipič. 2022. Elevator group control as a constrained multiobjective optimization problem. Applied Soft Computing 115 108277.
Wu, Y., S. Tanaka. 2020. A mixed-integer programming approach to group control of elevator systems with destination hall call registration. 2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, Singapore, Singapore, 26–31.
-
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/99234-
dc.description.abstract電梯派車系統面臨的核心挑戰在於外部呼叫資訊的不確定性,傳統的電梯派車方法僅能依據乘客按下的上行或下行按鈕進行派車,無法準確掌握等候乘客的實際人數以及其目的地樓層。這種資訊不足的情況可能導致電梯到達時發現等候乘客人數超出容量限制,或是無法有效規劃行程路線,進而造成額外的電梯派遣需求與更長的等候時間。隨著建築物樓層數量的增加及乘客流量模式的多樣化,傳統派車演算法的效率有限,因此需要發展能夠整合乘客流量估計與即時派車決策的智慧化電梯派車系統。

本研究提出一個整合性框架,結合人流資訊估計與最佳化派車演算法來解決上述問題。在人流資訊估計的部分,我們實作並比較了多種方法來估計乘客的數量和目的地,包括簡單頻率法、MV10 演算法 (Utgoff and Connell, 2012) 和隨機建模 (Sorsa et al., 2018) 等等。在派車決策的部分,我們建構了一個多目標最佳化模型,以最小化大於閾值的乘客等待時間與電梯能耗為目標,並採用基因演算法求解不同交通情境下的電梯派車問題。

實驗結果證實,當乘客需求呈現高變異性或集中分布特性時,估計方法展現出最顯著的效益,特別是在乘客的起點非常集中的情境下,簡單頻率法能將估計誤差從 8.294 降低至 0.650。比較不同估計方法時,MV10 演算法在資料稀少的初期階段表現較為穩定,而簡單頻率法在累積充足歷史資料後具有較佳的準確性。使用真實資料的實驗進一步驗證了歷史資料初始化的重要性:使用 28 天的資料訓練估計模型,並根據資料量動態切換估計方法,目標式值優於傳統無估計方法,證明了整合即時人流資訊估計的派車系統在實際應用中的有效性與實用價值。
zh_TW
dc.description.abstractThe core challenge faced by elevator dispatching systems lies in the uncertainty of outer call information. Traditional elevator dispatching methods can only assign elevators based on passengers pressing up or down buttons, without accurately knowing the actual number of waiting passengers or their destination floors. This lack of information may lead to situations where elevators arrive to find that the number of waiting passengers exceeds capacity limits, or fail to effectively coordinate elevator routing, resulting in additional dispatches and increased waiting times. With an increasing number of floors in buildings and greater variability in passenger flow patterns, the limitations of traditional dispatching algorithms become increasingly evident. Therefore, it is essential to develop intelligent elevator dispatching systems that integrate passenger flow estimation with real-time dispatch decisions.

This study proposes an integrated framework that combines traffic flow estimation with optimized dispatching algorithms to address the aforementioned challenges. In terms of flow estimation, we implement and compare multiple methods for estimating the numbers and destinations of passengers, including the naive frequency method, the MV10 algorithm (Utgoff and Connell, 2012), and stochastic modeling approaches (Sorsa et al., 2018). For dispatching decisions, we construct a multi-objective optimization model aiming to minimize passenger waiting time exceeding a threshold and elevator energy consumption. The genetic algorithm is employed to solve elevator dispatching problems under various traffic scenarios.

Experimental results confirm that when passenger demand exhibits high variability or concentrated distribution characteristics, estimation methods demonstrate the most significant benefits, particularly in scenarios where passenger origins are highly concentrated, where the naive frequency method can reduce estimation error from 8.294 to 0.650. When comparing different estimation methods, the MV10 algorithm performs more stably during early stages with sparse data, while the naive frequency method achieves better accuracy after accumulating sufficient historical data. The case study using real data further validates the importance of historical data initialization: when using 28 days of data to train the estimator and adopting a strategy that dynamically switches estimation methods based on data volume, it outperforms the traditional non-estimation approach in objective values. These findings demonstrate the effectiveness and practical value of integrating real-time flow estimation into elevator dispatch systems.
en
dc.description.provenanceSubmitted by admin ntu (admin@lib.ntu.edu.tw) on 2025-08-21T16:55:12Z
No. of bitstreams: 0
en
dc.description.provenanceMade available in DSpace on 2025-08-21T16:55:12Z (GMT). No. of bitstreams: 0en
dc.description.tableofcontents誌謝 i
摘要 ii
Abstract iii
Contents v
List of Figures viii
List of Tables ix
1 Introduction 1
1.1 Background and motivation 2
1.2 Research objectives 5
1.3 Research plan 6
2 Literature Review 8
2.1 Elevator dispatching problem (EDP) without flow estimation 8
2.2 Flow estimation 10
3 Problem Description 13
3.1 Terminology 13
3.2 Flow estimation 14
3.2.1 The naive frequency method 15
3.2.2 MV10 15
3.2.3 Stochastic modeling 16
3.2.4 Expected estimation result 17
3.2.5 Other methods not used in this study 18
3.3 Elevator dispatching problem (EDP) 18
4 Solution Approach 25
4.1 System architecture 25
4.2 Flow estimation integration 27
4.2.1 Destination estimation 28
4.2.2 Number estimation 32
4.2.3 Hybrid estimation 35
4.2.4 Assumptions made without estimation 37
4.3 Dispatching optimization 38
4.3.1 Static elevator dispatching problem (EDP) 38
4.3.2 Genetic algorithm (GA) 39
5 Numerical Experiments 44
5.1 Experimental design 44
5.1.1 Factors affecting elevator dispatch performance 46
5.1.2 Elevator system configuration 47
5.1.3 Scenario generation 48
5.1.4 Scenario categories 50
5.2 Static elevator dispatching problem (EDP) performance 52
5.3 Flow estimation comparison 54
5.3.1 Destination estimation performance 54
5.3.2 Number estimation performance 58
6 Case Study 62
6.1 Real data overview and simulation introduction 62
6.2 Dynamic experiment 64
6.3 Dynamic experiment using historical data 67
7 Conclusion and Future Directions 76
7.1 Conclusion 76
7.2 FutureDirections 78
Bibliography 81
-
dc.language.isoen-
dc.subject人流資訊估計zh_TW
dc.subject電梯派車zh_TW
dc.subject即時最佳化zh_TW
dc.subject基因演算法zh_TW
dc.subjectGenetic algorithmen
dc.subjectReal-time optimizationen
dc.subjectTraffic flow estimationen
dc.subjectElevator dispatchingen
dc.title整合外叫人流資訊估計與派車決策之電梯派車最佳化問題zh_TW
dc.titleIntegration of Outer Call Flow Estimation and Dispatching Decisions for the Elevator Dispatching Optimization Problemen
dc.typeThesis-
dc.date.schoolyear113-2-
dc.description.degree碩士-
dc.contributor.oralexamcommittee郭佳瑋;余峻瑜;黃奎隆zh_TW
dc.contributor.oralexamcommitteeChia-Wei Kuo;Jiun-Yu Yu;Kwei-Long Huangen
dc.subject.keyword電梯派車,人流資訊估計,基因演算法,即時最佳化,zh_TW
dc.subject.keywordElevator dispatching,Traffic flow estimation,Genetic algorithm,Real-time optimization,en
dc.relation.page82-
dc.identifier.doi10.6342/NTU202502475-
dc.rights.note同意授權(全球公開)-
dc.date.accepted2025-08-08-
dc.contributor.author-college管理學院-
dc.contributor.author-dept資訊管理學系-
dc.date.embargo-lift2025-08-22-
顯示於系所單位:資訊管理學系

文件中的檔案:
檔案 大小格式 
ntu-113-2.pdf2.84 MBAdobe PDF檢視/開啟
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved