Minmum-cost of road network planning based on max-min ant algorithm

In this paper, we investigate the road network planning problem by using the ant colony algorithm. The road network considered by this paper is modeled by graph with edge weights and node weights, and a central node and a spanning tree are determined according to performance index. The road network planning problem is a complex optimization and combination problem, which are very difficult to obtain optimal solution. To solve minimum cost road network planning problem, a max-min ant colony algorithm is proposed, which may be more effective and avoid the premature convergence compare with the normal ant algorithm. Finally, the simulation results also show that the max-min ant colony algorithm is effective to solve the road network planning problem.