Improved Ant Colony Algorithm Based on Elitist Strategy and Application
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The basic ant colony algorithm converges slowly, is prone to plunge into partial optimum and results in search stagnation. In this paper, the optimized compositor is introduced into elitist strategy. According to ant compositor, new weighted coefficient is designed for pheromone updating. The simulation results of 30-city logistic distribution show that improved algorithm is more efficient and accurate than the basic ant colony algorithm.

    Reference
    Related
    Cited by
Get Citation

张家善,王志宏,陈应显.一种基于精英策略的改进蚁群算法及应用.计算机系统应用,2012,21(10):105-108,134

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 16,2012
  • Revised:March 14,2012
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063