模式识别与人工智能
Thursday, Apr. 10, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2010, Vol. 23 Issue (1): 1-6    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Time Complexity Analysis of Ant Colony Algorithm on First Order Deceptive Problem
CHEN Ling1,2,SUN Hai-Yin1
1.Department of Computer,College of Information Engineering,Yangzhou University,Yangzhou 225009
2.State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210093

Download: PDF (347 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The time complexity of ant colony optimization (ACO) on the deceptive systems is analyzed. Based on the study of the n-bit trap problem which is a first order deceptive problem of ACO, It is proved that time complexity for n-bit trap problem is O(n2mlnn) by max-min ant system (MMAS), which is an ACO with limitations on the pheromone on each edge. Here, n is the size of the problem and m is the number of artificial ants. The experimental results confirm the correctness of the conclusions.
Key wordsAnt Colony Optimization      n-bit Trap Problem      Deceptive Problem     
Received: 07 July 2009     
ZTFLH: TP301.6  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Cite this article:   
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2010/V23/I1/1
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