Time-dependent route optimization with double objective by a constrained dynamic A* algorithm
Zhu Shu-shan · Journal of Chang'an University · 2011
To solve the problem that the calculated shortest path are unstable in time dependent transport network,a time-dependent road network that following first in-first out principle is built,and it is divided into a series of static network.Based on the static network,the shortest route of time-dependent is deduced by A* algorithm.To meet the users' multi route choice favours,depending on delay risk analysis,a constrained dynamic A* algorithm is proposed by avoiding high-risk links heuristically to search for a reliable path subject to a trip duration constraint.The efficiency of the constrained dynamic A* search is increased by taking advantage of information computed offline.The result shows that,the algorithm is implemented and its computational performance is analyzed in numerical test,the path searching is quick and the high delay risk road segments can be avoided effectively.