Shortest path search in road network with incomplete information

Abstract

Concerning the incomplete information,structural characteristics and driver's habit,issue of the shortest path search in road network was studied.A mixed programming was proposed combining the global and local planning.During global planning,an index d/l was introduced which represented the ratio of Origin-Destination(OD) distance to the average link length,elliptical minimal search area was determined by d/l,and the initial global shortest path was calculated by Dijkstra algorithm.During local planning,an improved Bug algorithm was introduced based on network structure and influence range of unexpected events,and the congested or hazard region along the global planned path was avoid.The simulated experimental results indicate that the mixed planning can search the shortest path dynamically in road network with incomplete information and evade from congestion efficiently.