Research on Road Finding Under Complicated Constraints Based on Ant Colony Algorithm

This paper proposes a novel method which combines Dijkstra algorithm (DA) and ant colony optimization (ACO) algorithm. This method is competent to satisfy the cost priority of path-finding under constraint and complex conditions. First, build a network pruning, and use the Dijkstra algorithm to generate a secondary synthesis network diagram, and then make use of ant colony algorithm in the secondary synthesis network diagram to search for paths. Simulation results based on network topology show this improved algorithm is efficient and feasible to search for paths under complex constraints.