Solving a shortest path problem by ant algorithm

In this paper, we present a method of solving a shortest path problem by ant algorithm. Taking coal concentrated-station as example, where should we found the station, in a certain range, to minimize the total transporting cost. The corresponding mathematical model is founded. Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years, and it effectively resolves the shortest path problem in the paper.