An Adaptive Route Planning Method of Connected Vehicles for Improving the Transport Efficiency

Abstract

In recent years, the route-planning problem has gained increased interest due to the development of intelligent transportation systems (ITSs) and increasing traffic congestion especially in urban areas. An independent route-planning strategy for each in-vehicle terminal improves its individual travel efficiency. However, individual optimal routes pursue the maximization of individual benefit and may contradict the global benefit, thereby reducing the overall transport efficiency of the road network. To improve traffic efficiency while considering the travel time of individual vehicles, we propose a new dynamic route-planning method by innovatively introducing a bidding mechanism in the connected vehicle scenario for the first time. First, a novel bidding-based dynamic route planning is proposed to formulate vehicle routing schemes for vehicles affected by congestion via the bidding process. Correspondingly, a bidding price incorporating individual and global travel times was designed to balance the travel benefits of both objectives. Then, in the bidding process, a new local search algorithm was designed to select the winning routing scheme set with the minimum bidding price. Finally, the proposed method was tested and validated through case studies of simulated and actual driving scenarios to demonstrate that the bidding mechanism would be conducive to improving the transport efficiency of road networks in large-scale traffic flow scenarios. This study positively contributes to the research and development of traffic management in ITSs.