MA Wei, ZHU Qing-bao. Fast Continuous Ant Colony Optimization Algorithm for Solving Function Optimization Problems[J]. Acta Electronica Sinica, 2008, 36(11): 2120-2124.
DOI:
MA Wei, ZHU Qing-bao. Fast Continuous Ant Colony Optimization Algorithm for Solving Function Optimization Problems[J]. Acta Electronica Sinica, 2008, 36(11): 2120-2124.DOI:
Fast Continuous Ant Colony Optimization Algorithm for Solving Function Optimization Problems
Using ant colony algorithm to solve function optimization problems has some disadvantages such as easily plunging into a local minimum
slow convergence speed and so on.Therefore
a new fast continuous ant colony optimization algorithm is presented according to the latest research achievements of ant's behavior
which is carried out by scout ants and foraging ants cooperating with each other to search the best solution for solving function optimization problems. In our algorithm
chaotic sequence is first introduced to determine the initial position of the scout ants
then the scout ants start global rapid search in large visual field.In order to achieve better performance
it needs to evaluate solutions in each step and each generation and mark pheromones of the optimal solution in this generation.Thus foraging ants are attracted around the optimal solution during this generation to search in small step.Through this initialization method and mutual cooperation between the two kinds of ants
it could not only improve the optimization accuracy
but improve convergence speed greatly.The computer simulation experiments show that the algorithm has high search efficiency and rapid convergence speed.The results are quite satisfactory.