arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.10022cs.DCcs.SYeess.SY
收藏

一种分散式共享CAV系统的设计与应用

A Decentralized Shared CAV System Design and Application

Sayed Mehdi Meshkani, Bilal Farooq

摘要:

在这项研究中,我们提出了一种新的启发式两步算法共享乘车,其中用户可以分享他们的游乐设施,只有一个用户。该算法,这是集中制定,开始与匹配用户和创建一组乘客对在步骤1中,然后通过解决分配问题,以分配乘客对的车辆。为了解决动态乘车匹配问题中的高计算时间的问题,我们提出了一个分布式系统,是基于车辆到基础设施(V2I)和基础设施到基础设施(I2I)的通信。为了评估分布式系统的性能,我们将其与建议的集中式乘车算法进行比较。集中式和分布式系统都在一个微型交通模拟器中实现,以评估它们的性能及其对交通拥堵的影响。多伦多市中心的道路网络被选为研究区域。根据我们得到的结果,分布式系统的服务率为91.59%,接近集中式系统的95.80%。然而,与集中式系统相比,分布式系统产生的计算时间要少得多。通过在小型网络上的测试和与整个网络的比较,验证了分布式系统的可扩展性。

英文摘要:

In this study, we propose a novel heuristic two-step algorithm for shared ridehailing in which users can share their rides with only one more user. The algorithm, which is centrally formulated, starts with matching users and creating a set of passenger pairs in step 1 and is followed by solving an assignment problem to assign passenger pairs to the vehicles. To solve the problem of high computational time in dynamic ride-matching problems, we propose a distributed system that is based on vehicle to infrastructure (V2I) and infrastructure to infrastructure (I2I) communication. To evaluate the distributed system's performance, we compare it with the proposed centralized ridehailing algorithm. Both centralized and distributed systems are implemented in a micro-traffic simulator to assess their performance and their impact on traffic congestion. Downtown Toronto road network was chosen as the study area. Based on our obtained results, the service rate of the distributed system was 91.59% which is close to 95.80% in the centralized system. However, the distributed system yielded much lower computational time compared to centralized. Furthermore, the scalability of the distributed system was shown by testing it on a small network and comparing with the entire network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑