Abstract: Three improvements on Dijkstra algorithm were presented. The improvements were given as follows; (1)A novel optimized base on ACO implementing approach is designed to reduce the processing costs involved with routing of ants in the conventional Dijkstra algorithm. (2) Based on the model of network routing, in order to reduce the counting of other points, the set of candidates is limited to the nearest c points. (3)Marking the flags on the blocked points in order to prevent selecting these points. By this way simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.

Key words: Dijkstra algorithm, ACO,Traveling salesman problem, Parallel strategy, Route strategy