Abstract

This paper presents an inter-vehicular communication (IVC)-based algorithm for real-time route guidance in urban traffic networks. The algorithm enables communication between searcher vehicle and candidate vehicles whose origin node matches the destination node of the searcher vehicle, and traveling in the opposite direction. The data entities of knowledge sharing among the vehicles and the algorithmic procedure as well as the conditions for information sharing are presented in detail. The mathematical formulation of the procedure is also presented. A microscopic simulation model is utilized to assess the effectiveness of the algorithm against the benchmark shortest path algorithm. Average travel time, and overall network productivity are presented to measure the effectiveness of the algorithm. Simulation runs are conducted under various network congestion levels, link speeds and link lengths in order to evaluate the network productivity, and the travel time measures of the presented IVC algorithm compared to the benchmark shortest path algorithm, decentralized route guidance systems as well as other IVC-based algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call