The basic principle and application of ant colony optimization algorithm

Ant colony optimization algorithm(ACO) was recently proposed algorithm, it has strong robustness as well as good distributed calculative mechanism, and it is easy to combine with other methods, and the well performance has been shown on resolving the complex optimization problem. The TSP problem is chosen as example for introducing the basic principle of ACO, and several improvement algorithms are present for the problem of ACO. Applying this algorithm on function optimization problem, and the result expresses it gain optimization value very quickly, it is a viable and feasible method.