High computational time is one of the most important operational issues in centralized on-demand shared mobility systems. To resolve this issue, we propose a decentralized ride-matching system that is based on vehicle to infrastructure (V2I) and infrastructure to infrastructure (I2I) communication. Application on the downtown Toronto road network demonstrated that the decentralized system resulted in a speed-up of 125 times in terms of computational time and showed high scalability. Moreover, the service rate in the proposed system improved by 7% compared to the centralized. However, the centralized system showed 29% and 17% improvement in wait time and detour time.
翻译：高计算时间是集中按需共享流动系统中最重要的操作问题之一。 为解决这一问题,我们提议采用分散式搭乘系统,以车辆为基础设施(V2I)和基础设施为基础设施(I2I)通信为基础。在多伦多市中心公路网络上的应用显示,分散式系统在计算时间方面加速了125倍,并显示出高度可缩缩。此外,与集中式系统相比,拟议系统中的服务率提高了7%。然而,集中式系统在等待时间和绕行时间方面改进了29%和17%。
相关内容
微信扫码咨询专知VIP会员