Abstract-Traffic congestion causes driver frustration and costs billions of dollars annually in lost time and fuel consumption. This paper presents five traffic rerouting strategies designed to be incorporated in a cost-effective and easily deployable vehicular traffic guidance system that reduces travel time. The proposed strategies proactively compute individually tailored rerouting guidance to be pushed to vehicles when signs of congestion are observed on their route. The five proposed strategies are the dynamic shortest path (DSP), the A * shortest path with repulsion (AR * ), the random k shortest path (RkSP), the entropy-balanced kSP (EBkSP), and the flow-balanced kSP (FBkSP). Extensive simulation results show that the proposed strategies are capable of reducing the travel time as much as a state-of-the-art dynamic traffic assignment (DTA) algorithm while avoiding the issues that make DTA impractical, such as the lack of scalability and robustness, and high computation time. Furthermore, the variety of proposed strategies allows tuning the system to different levels of tradeoffs between rerouting effectiveness and computational efficiency. In addition, the proposed traffic guidance system can significantly improve the traffic even if many drivers ignore the guidance or if the system adoption rate is relatively low.
Pan et al. REF proposed proactive five different rerouting algorithms that include the dynamic shortest path (DSP), the A * shortest path with repulsion (AR * ), the random k shortest path (RkSP), the entropybalanced kSP (EBkSP), and the flow-balanced kSP (FBkSP) and studied the effective travel time.
Proactive Vehicular Traffic Rerouting for Lower Travel Time
IEEE Transactions on Vehicular Technology
IEEE Transactions on Vehicular Technology
Computer Science