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

Ant Colony Algorithm is a novel stochastic optimization algorithm using artificial ants releasing pheromone on the path, characterized with a positive feedback, distributed computation and parallel algorithm. It has strong robustness and is easy to combine with other methods in optimization. The slow step of convergence and being easy to be trapped in local optimum is the most shortcomings, although it is widely applied in optimization problems. Based on Ant Colony Algorithm using gridding method and combined with chaos theory, Chaos- Ant Colony Algorithm is put forward. In the Chaos- Ant Colony Algorithm, some MAX-MIN Ant System idea is used to limit the pheromone remained in the path. Improvements are made in initialization and update of pheromone. The feasibility of the proposed Chaos- Ant Colony Algorithm is validated by experiments. The writers of papers should and must provide normalized electronic documents in order for readers to search and read papers conveniently.