Chaos-Ant Colony Algorithm and its application in continuous space optimization

Author(s):  
Yibao Chen ◽  
Hongmei Xu ◽  
Tiezhu Ma
2016 ◽  
Vol 12 (12) ◽  
pp. 27 ◽  
Author(s):  
Xuepeng Huang

Ant colony algorithm is a heuristic algorithm which is fit for solving complicated combination optimization.It showed great advantage on solving combinatorial optimization problem since it was proposed. The algorithm uses distributed parallel computing and positive feedback mechanism, and is easy to combine with other algorithms.This ant colony algorithm has already been widespread used in the field of discrete space optimization, however, is has been rarely used for continuous space optimization question.On the basis of basic ant colony algorithm principles and mathematical model, this paper proposes an ant colony algorithm for solving continuous space optimization question.Comparing with the ant colony algorithm, the new algorithm improves the algorithm in aspects of ant colony initialization, information density function, distribution algorithms, direction of ant colonymotion, and so on. The new algorithm uses multiple optimization strategy, such as polynomial time reduction and branching factor, and improves the ant colony algorithm effectively.


2011 ◽  
Vol 101-102 ◽  
pp. 216-219
Author(s):  
Yan Jun Luo ◽  
Zhao Yu Bei

Ant colony algorithm has disadvantages such as long researching time and easily relapsing into local optimization. Artificial fish-swarm algorithm is presented to conquer the disadvantages. The combination of the two algorithms is applied in function optimization to overcome the limitation that the ant colony algorithm does not fit to solve continuous space optimization. The tested function shows the effect of the method.


Sign in / Sign up

Export Citation Format

Share Document