請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/95628完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 朱致遠 | zh_TW |
| dc.contributor.advisor | James C. Chu | en |
| dc.contributor.author | 林靖雅 | zh_TW |
| dc.contributor.author | Jing-Ya Lin | en |
| dc.date.accessioned | 2024-09-15T16:11:35Z | - |
| dc.date.available | 2024-09-16 | - |
| dc.date.copyright | 2024-09-14 | - |
| dc.date.issued | 2024 | - |
| dc.date.submitted | 2024-08-13 | - |
| dc.identifier.citation | 1.<2011_The_Recharging_Vehicle_Routing_Problem.pdf>.
2.Schneider, M., A. Stenger, and D. Goeke, The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations. Transportation Science, 2014. 48(4): p. 500-520. 3.Keskin, M. and B. Çatay, Partial recharge strategies for the electric vehicle routing problem with time windows. Transportation research part C: emerging technologies, 2016. 65: p. 111-127. 4.Keskin, M. and B. Çatay, A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. Computers & Operations Research, 2018. 100: p. 172-188. 5.Hiermann, G., et al., The electric fleet size and mix vehicle routing problem with time windows and recharging stations. European Journal of Operational Research, 2016. 252(3): p. 995-1018. 6.Afshar, S., et al., Mobile charging stations for electric vehicles—A review. Renewable and Sustainable Energy Reviews, 2021. 152: p. 111654. 7.Raeesi, R. and K.G. Zografos, The electric vehicle routing problem with time windows and synchronised mobile battery swapping. Transportation Research Part B: Methodological, 2020. 140: p. 101-129. 8.Raeesi, R. and K.G. Zografos, Coordinated routing of electric commercial vehicles with intra-route recharging and en-route battery swapping. European Journal of Operational Research, 2022. 301(1): p. 82-109. 9.Çatay, B. and İ. Sadati, An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping. Computers & Operations Research, 2023. 159: p. 106310. 10.Stackelberg, H.v., Theory of the market economy. 1952. 11.Land, A. and A. Doig, An automatic method of solving discrete programming problems. econometrica. v28. 1960. 12.Kelley, J., James E, The cutting-plane method for solving convex programs. Journal of the society for Industrial and Applied Mathematics, 1960. 8(4): p. 703-712. 13.Bard, J.F., Practical bilevel optimization: algorithms and applications. Vol. 30. 2013: Springer Science & Business Media. 14.Zeng, B. and Y. An, Solving bilevel mixed integer program by reformulations and decomposition. Optimization online, 2014: p. 1-34. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/95628 | - |
| dc.description.abstract | 隨著全球暖化問題日益嚴重,各國政府紛紛制定嚴格的減碳目標和環境法規,以減少溫室氣體排放。燃油車作為主要排放源之一,正逐漸被電動車取代。近年來,電動車的市場占有率確實逐年增長,成為汽車市場的重要組成部分。而因其具備的長期經濟效益和環境影響減少的優勢,電動車在物流配送領域的應用也日益增加。
然而電動車受到行駛里程的限制,再加上現有的充電基礎設施的不足,物流公司使用電動車進行配送時可能會為了充電而額外增加旅行成本及時間。而新的技術移動式充電車能隨時隨地的移動來為電動車充電,提供更靈活的充電選擇,因此本研究將引入移動式充電車技術於電動卡車物流配送問題中。 根據移動式充電服務的提供者,本研究探討了兩種情境:一為物流公司擁有並自行調度移動式充電車隊;二為物流公司委託專業移動式充電服務公司提供充電服務。在第一種情境下,建立了利用移動式充電之電動卡車配送問題,以最小化營運成本為目標,探討移動式充電車在物流配送中的效益。在第二種情境下,通過建立雙層最佳化模型,深入探討物流公司與移動式充電服務公司之間的合作機制及其成本效益。為了有效解決雙層混合整數規劃問題,本研究使用CCG演算法求解,並通過案例測試以及與傳統迭代方法比較,以驗證所提模型的合理性與實用性。 研究結果顯示引入移動式充電車,能有效降低物流公司營運成本並服務更多顧客,並且讓電動卡車的路徑選擇上更有彈性。而CCG演算法也可以在一定時間內求得較迭代方法更好的解,並且是雙層最佳化的精確解。 | zh_TW |
| dc.description.abstract | With the growing concerns in modern societies regarding greenhouse gas emissions and climate change, many countries have made commitments to reduce emissions. As an alternative to internal combustion vehicles (ICVs), the adoption rate of electric vehicles (EVs) has been increasing annually. Consequently, the use of EVs in the logistics and distribution sector is also on the rise. However, range anxiety, long recharge durations, and insufficient recharging infrastructure still restrain the wider adoption of EVs in the sector.
To address these issues, the new technology of mobile charging stations (MCS) can provide flexible charging options by moving to charge EVs anytime and anywhere. Therefore, this study introduces MCS technology into the Electric Vehicle Routing Problem with Time Windows (EVRPTW). Based on the provision of mobile charging services, this study explores two scenarios: one where logistics companies own and operate their own fleet of mobile charging stations, and another where they outsource charging services to professional MCS companies. In the first scenario, we develop a model for EVRPTW utilizing mobile charging stations with the objective of minimizing operational costs, thereby examining the benefits of MCS in logistics distribution. In the second scenario, we establish a bilevel optimization model to deeply investigate the cooperation mechanisms and cost efficiencies between logistics companies and MCS companies. To effectively solve the bilevel mixed-integer programming problem, this study employs iterative methods and develops a Column-and-Constraint Generation Algorithm. Case studies are conducted to validate the proposed model's reasonableness and practicality. The results show that the introduction of mobile charging stations can significantly reduce logistics companies' operational costs and serve more customers while providing greater flexibility in electric vehicle routing. Additionally, the Column-and-Constraint Generation Algorithm can achieve better solutions within a reasonable time compared to iterative methods, providing exact solutions for bilevel optimization. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2024-09-15T16:11:35Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2024-09-15T16:11:35Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | 口試委員審定書 I
誌謝 II 中文摘要 III ABSTRACT IV 目次 VI 圖次 VIII 表次 IX 第ㄧ章 緒論 1 1.1 研究背景與動機 1 1.2 研究目的 2 1.3 研究流程 3 第二章 文獻回顧 5 2.1 帶時間窗的電動卡車路線規劃問題 5 2.2 移動式充電服務應用於運輸與物流 7 2.3 雙層混合整數規劃問題之求解方法 8 2.4 小結 9 第三章 研究方法 11 3.1 問題描述 11 3.2 利用移動式充電車之電動卡車配送路線規劃問題 15 3.2.1數學符號 15 3.2.2目標式 17 3.2.3限制式 18 3.3 電動卡車路線與移動式充電服務之雙層最佳化問題:傳統迭代方法 21 3.3.1 迭代方法說明與流程圖 21 3.3.2 數學符號 22 3.3.3 目標式 25 3.3.4 限制式 26 3.4 電動卡車路線與移動式充電服務之雙層最佳化問題:CCG演算法 29 3.4.1 數學符號 30 3.4.2 目標式 33 3.4.3 限制式 34 3.4.4 雙層最佳化問題之通式 40 3.4.5 CCG演算法步驟說明 41 3.4.6 CCG演算法流程圖 44 第四章 案例測試與分析 46 4.1 情境假設與參數設定 46 4.2 案例測試 48 4.2.1 利用移動式充電車之電動卡車配送路線規劃問題 48 4.2.2電動卡車路線與移動式充電服務之雙層最佳化問題 53 第五章 結論與建議 62 5.1 結論 62 5.2 建議 62 參考文獻 64 | - |
| dc.language.iso | zh_TW | - |
| dc.subject | 電動車 | zh_TW |
| dc.subject | 物流配送 | zh_TW |
| dc.subject | 移動式充電 | zh_TW |
| dc.subject | 雙層最佳化模型 | zh_TW |
| dc.subject | 重構與分解演算法 | zh_TW |
| dc.subject | 最佳化 | zh_TW |
| dc.subject | Logistics Distribution | en |
| dc.subject | Mobile Charging | en |
| dc.subject | Electric Vehicle (EV) | en |
| dc.subject | Bi-level Optimization | en |
| dc.subject | Column-and-Constraint Generation Algorithm (CCG) | en |
| dc.subject | Mathematical Programming | en |
| dc.title | 電動卡車路線與移動式充電服務之雙層最佳化問題 | zh_TW |
| dc.title | Bi-level Optimization of Electric Vehicle Routing with Mobile Charging Services | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 112-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 沈宗緯;水敬心;坂井勝哉 | zh_TW |
| dc.contributor.oralexamcommittee | Chung-Wei Shen;Chin-Sum Shui;Katsuya Sakai | en |
| dc.subject.keyword | 移動式充電,電動車,物流配送,最佳化,雙層最佳化模型,重構與分解演算法, | zh_TW |
| dc.subject.keyword | Mobile Charging,Electric Vehicle (EV),Bi-level Optimization,Column-and-Constraint Generation Algorithm (CCG),Mathematical Programming,Logistics Distribution, | en |
| dc.relation.page | 64 | - |
| dc.identifier.doi | 10.6342/NTU202404195 | - |
| dc.rights.note | 同意授權(限校園內公開) | - |
| dc.date.accepted | 2024-08-14 | - |
| dc.contributor.author-college | 工學院 | - |
| dc.contributor.author-dept | 土木工程學系 | - |
| dc.date.embargo-lift | 2029-08-12 | - |
| 顯示於系所單位: | 土木工程學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-112-2.pdf 未授權公開取用 | 2.89 MB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
