Coordinated Carpool Route Selection and Optimization for Dynamic Uncertain Demand Based on Connected Vehicles

摘要

The paper puts forward a method for selecting and optimizing coordinated carpool routes to meet the dynamic and uncertain demand based on connected vehicles. The distance, cost, and time of the selected route are calculated using Dijkstra's algorithm and distance matrix method combined with the cost function and road resistance function. Based on this, the concept of sample weight coefficient is introduced. Then, the model of sample weights for selecting the coordinated route is constructed. The results show that compared with a common route, the optimal coordinated carpool route could save the total distance by 38.46%, total cost by 17.66%, and total time by 21.57% under dynamic and uncertain demand. Application in Huai'an, Jiangsu shows that the coordinated carpool route can greatly reduce the cost and time.