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.

[1]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[2]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[3]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[4]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[5]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[6]  Marco Dorigo,et al.  Mobile agents for adaptive routing , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.