{'fraction_non_alphanumeric': 0.02316076294277929, 'fraction_numerical': 0.013623978201634877, 'mean_word_length': 5.447368421052632, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Decentralized Matching in Shared Intelligent Vehicles Fleet

High computational time is one of the most important operational issues in centralized ondemand 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.