咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >A Novel Real-Time Coordinated ... 收藏

A Novel Real-Time Coordinated Ridesharing Route Choice Mechanism

作     者:Peng, Wang Du, Lili 

作者机构:Univ Florida Dept Civil & Coastal Engn Gainesville FL 32603 USA 

出 版 物:《IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS》 (IEEE Trans. Intell. Transp. Syst.)

年 卷 期:2024年第25卷第5期

页      面:3548-3560页

核心收录:

学科分类:0808[工学-电气工程] 08[工学] 0814[工学-土木工程] 0823[工学-交通运输工程] 

基  金:National Science Foundation 

主  题:Shared transport Games Real-time systems Routing Distributed algorithms Delays Costs Coordinated ridesharing mechanism fare-sharing game coalition 

摘      要:Ridesharing service, as a sustainable transportation mode, has gained great interest in both industry and academic fields. Existing TNC ridesharing services provide prescriptive solutions without coordinating riders interactions and intentions on route choices. As a result, ridesharing services often end with ride-hailing services, and they are still under a relatively low usage rate. Motivated by this view, this study developed a real-time coordinated ridesharing route choice mechanism (CSM) for guiding riders ridesharing route choices to fill this research and application gap. Specifically, this study modeled this CSM as a pure-strategy atomic fare-sharing game based on the assumption that every rider is selfish and tries to choose the best route to minimize his/her travel fare among multiple feasible candidate routes. An existing tree-generation algorithm was used to find the candidate routes for each rider. This study proved the existence of a Nash Equilibrium in this game by constructing a potential function and proving this game is a potential game. This study further developed a sequential updated distributed algorithm and proved its convergence to explore an equilibrium solution of the CSM. To address the scalability issue, this study created a coalition formation approach based on ridesharing potential, to separate riders into ridesharing coalitions and then independently implement the CSM for each ridesharing coalition. Our experiments illustrate that the coalition approach scales down the problem size of each CSM and dramatically improves the computation efficiency while maintaining the same level of system performance. More importantly, the CSM can significantly promote riders usage of the ridesharing service by greatly saving their travel fares while satisfying their trip requirements.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分