進階搜尋


   電子論文尚未授權公開,紙本請查館藏目錄
(※如查詢不到或館藏狀況顯示「閉架不公開」,表示該本論文不在書庫,無法取用。)
系統識別號 U0026-2808201816042400
論文名稱(中文) 於互聯車環境下以動態共乘派遣演算法提升自駕計程車的效率
論文名稱(英文) A Dynamically Carpooling Dispatching Algorithm for Improving Efficiency of Self-Driving Taxis in the Connected Vehicles Environment
校院名稱 成功大學
系所名稱(中) 電腦與通信工程研究所
系所名稱(英) Institute of Computer & Communication
學年度 106
學期 2
出版年 107
研究生(中文) 鍾旭成
研究生(英文) Hsu-Cheng Chung
電子信箱 dreamcreater123@gmail.com
學號 Q36054099
學位類別 碩士
語文別 英文
論文頁數 37頁
口試委員 指導教授-斯國峰
口試委員-焦惠津
口試委員-高嘉宏
中文關鍵字 動態共乘系統  智慧運輸系統  計程車派遣  合作式派遣機制  互聯車環境 
英文關鍵字 Dynamic ridesharing systems  intelligent transportation systems (ITS)  taxi dispatch schedule  cooperative dispatch mechanism  connected vehicles (CV) 
學科別分類
中文摘要 於大都市的尖峰時段,數量有限的計程車難以應付龐大的乘客需求。此時部分乘客必須等待附近空閒的計程車,導致乘客耗費較多的等車時間。共乘方案利用計程車上剩餘的座位有效紆解計程車數量不足之問題。然而,大多數以前的共乘研究僅著重於預約式共乘機制或計程車站點共乘,為了滿足現今實際的使用需求,本篇論文提出動態計程車派遣演算法以提升單位時間內乘客服務量,並同時減少計程車的行車距離。本論文發展之方法在共乘乘客可接受之條件下,儘可能減少計程車之繞道距離。實驗模擬結果顯示,於高乘客需求下,共乘策略相較於傳統非共乘模式獲得以下益處: (1) 提升單位時間之服務率; (2) 減少空車率; (3) 節省乘客等車時間; (4) 減少計程車服務乘客之總行駛距離。
英文摘要 In peak hours of major cities, the high demand of passenger ride requests is difficult to be relieved by the limited number of taxis. Passengers spend a lot of time on waiting idle taxis. To solve this problem, the ridesharing offers the opportunity to make more efficient use of vehicles. With the ridesharing strategy, a passenger can save his or her waiting time if a taxi is on the passenger's way and the taxi has available seats. Most of the previous schemes of the taxi-sharing are concentrated on either the ride reservation of carpooling or the fixed-point taxi station ridesharing. This paper develops a real-time taxi ridesharing dispatch method that aims to increase the traffic throughput and reduce the total travel distance of the taxis. The method specifically targets ridesharing systems on a status of high passenger demands. The developed mechanism for the taxis in the connected vehicles environment includes (i) planning routes with the reduced detour; (ii) dispatching the recommended taxi to clients; (iii) carrying passengers continuously. With the detour distance of the taxis, which is approved by the passengers, the efficiency of the ridesharing system increases significantly. Moreover, the high passenger demands can be relieved in peak hours. In this thesis, the approach is applied in Manhattan and simulated with SUMO. Compared to the non-sharing taxi environment, the solution improves the number of served passengers, reduces the empty car rate, saves 30.93\% of the total travel time of passengers, and reduces 11.81\% travel distance of the taxis.
論文目次 1 Introduction ............1
2 Related Work .............5
3 Dynamically Carpooling Dispatching Algorithm .....8
3.1 System Structure ...........8
3.2 Dynamically Carpooling Dispatching Algorithm ......10
3.2.1 Preprocess Phase .........10
3.2.2 Inference Phase ..........12
3.2.3 Dispatch Phase ..........19
4 Simulation .............21
4.1 Simulation Setting ..........21
4.1.1 Simulator ...........21
4.1.2 Road Network ...........22
4.1.3 Parameters ..........23
4.2 Performance ............25
4.2.1 Average Waiting Time of Passengers ......27
4.2.2 Average Riding Time of Passengers .......27
4.2.3 Average Travel Time of Passengers .......28
4.2.4 Average Riding Distance of Passengers .....29
4.2.5 The Number of Taxis is Needed .......29
4.2.6 Service Rate of Taxis .........30
4.2.7 The Total Driving Distance of Taxis for Serving Passengers ..31
5 Conclusion and Future Work .........33
5.1 Conclusion .............33
5.2 Future Work ............34
References .............35
Vita ...............37
參考文獻 [1] J. P. Hanna, M. Albert, D. Chen, and P. Stone, Minimum Cost Matching for
Autonomous Carsharing," in IFAC Symposium on Intelligent Autonomous Vehicles,
June 2016.
[2] H. Zheng and J. Wu, Online to O ine Business: Urban Taxi Dispatching with
Passenger-Driver Matching Stability," in International Conference on Distributed
Computing Systems, July 2017, pp. 816{825.
[3] W. Bai, J. Quan, L. Fu, X. Gan, and X. Wang, Online Fair Allocation in Au-
tonomous Vehicle Sharing," in Global Communications Conference, Dec. 2017, pp.
1-6.
[4] M. Zhu, X. Y. Liu, and X. Wang, An Online Ride-Sharing Path-Planning Strategy
for Public Vehicle Systems," in IEEE Transactions on Intelligent Transportation
Systems, May 2018, pp. 1{12.
[5] S. Ma, Y. Zheng, and O. Wolfson, T-Share: A Large-Scale Dynamic Taxi Rideshar-
ing Service," in International Conference on Data Engineering, June 2013, pp. 410-421.
[6] --, Real-Time City-Scale Taxi Ridesharing," in IEEE Transactions on Knowledge and Data Engineering, vol. 31, no. 1, July 2016, pp. 1782-1795.
[7] D. Zhang, Y. Li, and F. Zhang, coRide: Carpool Service with a Win-Win Fare Model for Large-Scale Taxicab Networks," in ACM Conference on Embedded Net-worked Sensor Systems, Nov. 2013.
[8] S. Yeung, E. Miller, and S. Madria, A Flexible Real-Time Ridesharing System Considering Current Road Conditions," in IEEE International Conference on Mobile
Data Management, vol. 1, June 2016, pp. 186-191.
[9] J. Hargrave, S. Yeung, and S. Madria, Integration of Dynamic Road Condition Updates for Real-Time Ridesharing Systems," in International Conference on Mobile Ad Hoc and Sensor Systems, Oct. 2017, pp. 585-589.
[10] D. Pelzer, J. Xiao, D. Zehe, M. H. Lees, A. C. Knoll, and H. Aydt, A Partition-Based Match Making Algorithm for Dynamic Ridesharing," in IEEE Transactions
on Intelligent Transportation Systems, vol. 16, no. 5, Oct. 2015, pp. 2587-2598.
[11] S.-T. Cheng, J.-P. Li, and G.-J. Horng, Game Theory Based Recommendation Mechanism for Taxi-Sharing," in IEEE International Conference on Advanced Information Networking and Applications Workshops, June 2014, pp. 645-650.
[12] W. Herbawi and M.Weber, Comparison of Multiobjective Evolutionary Algorithms for Solving The Multiobjective Route Planning in Dynamic Multi-hop Ridesharing,"
in IEEE Congress of Evolutionary Computation, July 2011, pp. 2099-2106.
[13] Y. Hou, X. Li, and C. Qiao, TicTac: From Transfer-Incapable Carpooling to Transfer-Allowed Carpooling," in IEEE Global Communications Conference, Dec. 2012, pp. 268-273.
[14] Y. Hou, W. Zhong, L. Su, K. Hulme, A. W, Sadek, and C. Qiao, TASeT: Improving the E ciency of Electric Taxis With Transfer-Allowed Rideshare," in IEEE Transactions on Vehicular Technology, vol. 65, no. 12, Dec. 2016, pp. 9518-9528.
[15] A. Eais, F. Alvelos, and M. Carvalho, New Mixed Integer-Programming Model for the Pickup-and-Delivery Problem with Transshipment," in European Journal of
Operational Research, vol. 235, no. 3, June 2014, pp. 530-539.
[16] B. Coltin, Multi-agent Pickup and Delivery Planning with Transfers," Master's thesis, The Robotics Institute, Carnegie Mellon University, May 2014.
[17] SUMO Wiki." [Online]. Available:
http://sumo.dlr.de/wiki/Simulation of Urban MObility - Wiki, 2018.
[18] SUMO DLR." [Online]. Available:
http://www.dlr.de/ts/en/desktopdefault.aspx/tabid-9883/16931 read-41000/, 2018.
[19] TraCI Wiki." [Online]. Available: http://sumo.dlr.de/wiki/TraCI, 2018.
[20] OpenStreetMap." [Online]. Available: https://www.openstreetmap.org, 2018.
論文全文使用權限
  • 同意授權校內瀏覽/列印電子全文服務,於2023-09-01起公開。
  • 同意授權校外瀏覽/列印電子全文服務,於2023-09-01起公開。


  • 如您有疑問,請聯絡圖書館
    聯絡電話:(06)2757575#65773
    聯絡E-mail:etds@email.ncku.edu.tw