An improved ant colony algorithm with biological characteristics

  • Qin Ling
  • , Chen Yixin
  • , Chen Ling
  • , Wu Yan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An improved ant colony algorithm with biological characteristics Is proposed to guarantee the solution diversity of the algorithm. In the optimization process of the algorithm, the pheromone is updated by the biological diversity and quality of the solutions to obtain diversified solutions. Experimental results on the traveling salesman problem show that our algorithm have high convergence speed and can get diversified solutions, it succeeds avoiding the stagnation and premature problem.

Original languageEnglish
Title of host publication2006 IEEE International Conference on Granular Computing
Pages405-408
Number of pages4
StatePublished - 2006
Event2006 IEEE International Conference on Granular Computing - Atlanta, GA, United States
Duration: May 10 2006May 12 2006

Publication series

Name2006 IEEE International Conference on Granular Computing

Conference

Conference2006 IEEE International Conference on Granular Computing
Country/TerritoryUnited States
CityAtlanta, GA
Period05/10/0605/12/06

Keywords

  • Ant colony algorithm
  • Optimization

Fingerprint

Dive into the research topics of 'An improved ant colony algorithm with biological characteristics'. Together they form a unique fingerprint.

Cite this