請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/98307完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 孔令傑 | zh_TW |
| dc.contributor.advisor | Ling-Chieh Kung | en |
| dc.contributor.author | 林小喬 | zh_TW |
| dc.contributor.author | Hsiao-Chiao Lin | en |
| dc.date.accessioned | 2025-08-01T16:09:27Z | - |
| dc.date.available | 2025-08-02 | - |
| dc.date.copyright | 2025-08-01 | - |
| dc.date.issued | 2025 | - |
| dc.date.submitted | 2025-07-28 | - |
| dc.identifier.citation | Bolat, B., O. Altun, P. Cortés. 2013. A particle swarm optimization algorithm for optimal car-call allocation in elevator group control systems. Applied Soft Computing 13(5) 2633–2642.
Closs, G.D. 1970. The computer control of passenger traffic in large lift systems. Ph. D. Dissertation, University Manchester . Cortés, P., J. Larrañeta, L. Onieva. 2004. Genetic algorithm for controllers in elevator groups: analysis and simulation during lunchpeak traffic. Applied Soft Computing 4(2) 159–174. Dai, D., J. Zhang, Z. Yin W. Xie, 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, V12–535. Fujino, A., T. Tobita, K. Segawa, K. Yoneda, A. Togawa. 1997. An elevator group control system with floor-attribute control method and system optimization using genetic algorithms. IEEE Transactions on Industrial Electronics 44(4) 546–552. 59 Hanif, M., N. Mohammad. 2022. Performance analysis of particle swarm optimization and genetic algorithm in energy-saving elevator group control system. Proceedings of the International Conference on Big Data, IoT, and Machine Learning: BIM 2021. Springer, 497–511. Koehler, J., D. Ottiger. 2002. An ai-based approach to destination control in elevators. AI Magazine 23(3) 59–59. 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–406. Siikonen, M.-L. 2024. Current and future trends in vertical transportation. European Journal of Operational Research 379(2) 361–372. 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. Sun, J., Q.-C. Zhao, P.B Luh. 2009. Optimization of group elevator scheduling with advance information. IEEE Transactions on Automation Science and Engineering 7(2) 352–363. Tartan, E.O., C. Ciftlikli. 2016. A genetic algorithm based elevator dispatching method for waiting time optimization. IFAC-PapersOnLine 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. 60 Wan, J., K. Lee, H. Shin. 2024. Traffic pattern-aware elevator dispatching via deep reinforcement learning. Advanced Engineering Informatics 61 102497. Zhang, J., J. Tang, Q. Zong, J. Li. 2010. Energy-saving scheduling strategy for elevator group control system based on ant colony optimization. 2010 IEEE Youth Conference on Information, Computing and Telecommunications. IEEE, 37–40. Zheng, J., H.C.T. Thomas, Y. HuaiBing. 2018. Traffic prediction for efficient elevator dispatching. TENCON 2018-2018 IEEE Region 10 Conference. IEEE, 2232–2236. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/98307 | - |
| dc.description.abstract | 本研究探討如何解決並最佳化電梯調度問題,旨在平衡能源效率與乘客服務品質。文獻上大多把最佳化電梯調度問題被歸類為 NP-hard 問題,因為其涉及從眾多可行的電梯運行組合中識別最佳調度方案。
我們研究了一種混合控制系統的效率,該系統可將樓層設定為傳統呼叫或目的地呼叫模式。其目標是最大限度地降低電梯運行能耗成本,並減少長時間等待乘客的有效等待時間。 我們透過求解一系列靜態問題來解決動態電梯調度問題,並利用窮舉演算法和基因演算法進行求解。實驗結果表明,相較於傳統呼叫系統,目的地呼叫系統和混合呼叫系統在大多數情境下,於能耗和有效等待時間方面均表現出更佳的性能。此外,基因演算法在計算成本方面提供了顯著優勢,使其成為實際電梯系統更可行的方案。 我們開發了一個與電梯模擬系統串接的電梯調度系統,以模擬現實世界的運作,證實了我們所提出的方法在實務上的可行性。在利用模擬真實乘客需求進行的動態情境案例研究中,結果顯示我們所提出的基於基因演算法的派遣策略,相較於原本基於規則派遣的方法,在能源消耗和有效等待時間方面均顯著降低。 | zh_TW |
| dc.description.abstract | In this study, we explores optimization strategies for the Elevator Dispatching Problem (EDP), aiming to balance energy efficiency with passenger service quality. The EDP is classified as an NP-hard problem, involving the identification of optimal scheduling solutions from numerous feasible elevator operation combinations.
We investigate the efficiency of a hybrid control system, which sets floors for either conventional or destination call system. The objective is to minimize the total energy consumption cost of the elevators and the effective waiting time of passengers experiencing prolonged waiting periods. Our approach addresses the dynamic EDP by solving a sequence of static problems, utilizing both exhaustive and genetic algorithms. Experimental results indicate that, compared to the All-Conventional call system, both All-Destination and Hybrid call systems tend to achieve better performance in energy consumption and effective waiting time across most scenarios. Moreover, the genetic algorithm offers substantial advantages in computational cost, rendering it a more feasible approach for practical elevator systems. We developed an elevator dispatch system that integrates with an elevator simulation system to replicate real-world operations. Case studies in dynamic scenarios, utilizing simulated real passenger demand, revealed that the proposed GA-based strategy significantly reduces energy consumption and effective waiting time compared to the rule-based method. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2025-08-01T16:09:27Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2025-08-01T16:09:27Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | Contents
誌謝 i 摘要 ii Abstract iii Contents iv List of Figures vii List of Tables viii 1 Introduction 1 1.1 Background and Motivation 1 1.2 Research Objectives 4 1.3 Research Plan 5 2 Literature Review 6 2.1 Static and Dynamic Approaches in EDP 6 2.2 Assignment Evaluation in EDP 8 2.3 Different Objectives of EDP 10 3 Problem Description 12 3.1 Elevator Dispatching Problem 12 3.2 Assumption for Elevator Routing 18 4 Solution Approach 20 4.1 Static Problem Formulation 20 4.2 Solution Structure and Constraint Handling 24 4.3 Algorithms for Solving the Static Problem 27 4.3.1 Exhaustive Algorithm 27 4.3.2 Genetic Algorithm 28 4.4 Performance Evaluation for the Static Problem 30 4.4.1 Experiment Setting 30 4.4.2 Performance in the Exhaustive Algorithm 34 4.4.3 Convergence Analysis of Genetic Algorithm 36 4.4.4 Performance in the Genetic Algorithm 39 4.4.5 Analysis for Computation Cost 41 4.4.6 Analysis for Benefit of Destination Information 42 5 Performance Evaluation 45 5.1 Solution Architecture 45 5.2 Experiment Setting 46 5.3 Experiment Result 49 5.3.1 Performance Compared to Rule-Based Strategy 49 5.3.2 Performance with Different Control Systems 51 6 Implementation of Elevator Dispatching System 53 6.1 System Architecture 53 6.2 Module Interaction 55 7 Conclusion 57 Bibliography 59 | - |
| dc.language.iso | en | - |
| dc.subject | 電梯調度問題 | zh_TW |
| dc.subject | 目的地呼叫系統 | zh_TW |
| dc.subject | 混合呼叫系統 | zh_TW |
| dc.subject | 基因演算法 | zh_TW |
| dc.subject | Genetic Algorithm | en |
| dc.subject | Elevator Dispatching Problem | en |
| dc.subject | Destination Call System | en |
| dc.subject | Hybrid Control System | en |
| dc.title | 結合傳統呼叫系統與目的地呼叫系統之電梯調度最佳化問題 | zh_TW |
| dc.title | Elevator Dispatching Optimization integrating Conventional and Destination Control Systems | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 113-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 黃奎隆;郭佳瑋;余峻瑜 | zh_TW |
| dc.contributor.oralexamcommittee | Kwei-Long Huang;Chia-Wei Kuo;Jiun-Yu Yu | en |
| dc.subject.keyword | 電梯調度問題,目的地呼叫系統,混合呼叫系統,基因演算法, | zh_TW |
| dc.subject.keyword | Elevator Dispatching Problem,Destination Call System,Hybrid Control System,Genetic Algorithm, | en |
| dc.relation.page | 61 | - |
| dc.identifier.doi | 10.6342/NTU202502477 | - |
| dc.rights.note | 同意授權(全球公開) | - |
| dc.date.accepted | 2025-07-29 | - |
| dc.contributor.author-college | 管理學院 | - |
| dc.contributor.author-dept | 資訊管理學系 | - |
| dc.date.embargo-lift | 2025-08-02 | - |
| 顯示於系所單位: | 資訊管理學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-113-2.pdf | 983.15 kB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
