Study And Application Of The Ant Colony Algorithm Based On The Continuous Space Optimization Problem

The ant eolony algorithm is a kind of stochastiec explorative algorithms,As the same of other kind of stimulated evolutionary algorithms,it finds the best solution of optimization problem by making uses of the evolutionary procedure of a set of cooperating agents of candidate solutions. It has shown a great deal of salient charaeter and performed great value in its application. The principle,the model,the characteristics and the management about the basic algorithms of ant colony are presented.in this paper. The influnce of the parameters on algorithm and the reasionable selection about the parameters are discussed in simulation research.The author improves the factor of global jump and the pheromone polatility of ant eolony algorithm on the general function optimization problem basing on the analysis of improved ones. The result about the simulation research is demonstrated that the characteristics of ant eolony algorithm for general function optimization problem and PID parameters optimization problem are salient,and it is wearthy to make further researehes.