Simulation of route optimization by solving a shortest path problem by ant algorithm Abstract In this project, 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 project. The project presents the ant colony algorithm and its application for the path planning. Ant algorithms were designed on the base of the behaviour of real ant colonies. Real ants can always find the shortest way between the nest and the food so one of the most “natural” is the application of the ant colony algorithm in the path planning.