Research of the the shortest path algorithm of urbanized public traffic networks
Dongling Ma · 2008
The paper proposes the improved Dijkstra shortest path algorithm,which improve the traditional operations of binary heap optimal array on the base of limiting region of using ellipse.It is based on the statistical analysis of character of city transportation space distributing,and design a reasonable limiting region of using ellipse to reduce the scale of the search of the algorithm.And it makes use of the theory that the beeline is the shortest between two points,and we get the new greedy search strategy,which is determined by the maximum degree that combined by the current node,its nearest node and destination node.Finally used the example to confirm the accuracy and the feasibility.of the algorithm.