模式识别与人工智能
Friday, March 14, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2007, Vol. 20 Issue (5): 688-691    DOI:
Researches and Applications Current Issue| Next Issue| Archive| Adv Search |
An Adaptive MaxMin Ant Colony Algorithm
SU Chang1, TU Jun2
1.School of Mechanical Engineering, Liaoning Technical University, Fuxin 123000
2.Institute of Applied Mathematics, Liaoning Technical University, Fuxin 123000

Download: PDF (395 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The structure and principle of ant colony algorithm are introduced. Its excellence and deficiency are analyzed, and several important improved models are reviewed. Based on MaxMin Ant Systems (MMAS), an adaptive improved model is put forward. To achieve adaptive adjustment of parameters and enhance the performance of the proposed algorithm, the weighting coefficient, state transferring rule and pheromone increment mode are improved. To testify the performance of the improved algorithm, numerical experiment is made and the result shows the improved algorithm is effective.
Key wordsAnt Colony Algorithm      MaxMin Ant System (MMAS)      Adaptive      Traveling Salesman Problem     
Received: 30 May 2006     
ZTFLH: TP301.6  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
SU Chang
TU Jun
Cite this article:   
SU Chang,TU Jun. An Adaptive MaxMin Ant Colony Algorithm[J]. , 2007, 20(5): 688-691.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2007/V20/I5/688
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn