模式识别与人工智能
Thursday, Apr. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2007, Vol. 20 Issue (1): 15-20    DOI:
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
Binary Ant Colony Algorithm with Signal Transfer
XIONG WeiQing, WEI Ping, ZHAO JieYu
Institute of Computer Science and Technology, Ningbo University, Ningbo 315211

Download: PDF (387 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  A kind of Binary Ant Colony Algorithm is designed. Each ant stands at the former place to form onedimension linear queue for transferring the signal from one to another. While the signal passes each ant, the ant randomly chooses the state (0 or 1) according to its own pheromone. Owing to the adoption of the binary coding, the requirment for the behavior of every single ant is lower. So the corresponding memory is relatively less, which greatly improves the efficiency of the algorithm. The test function and the multi 0/1 Knapsack problem show that the proposed algorithm has better convergence speed and stability.
Key wordsSwarm Intelligence      Simulated Evolution Computation      Cellular Automata Modeling      Binary Network      Ant Colony Algorithm     
Received: 23 January 2006     
ZTFLH: TP311  
  TP181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
XIONG WeiQing
WEI Ping
ZHAO JieYu
Cite this article:   
XIONG WeiQing,WEI Ping,ZHAO JieYu. Binary Ant Colony Algorithm with Signal Transfer[J]. , 2007, 20(1): 15-20.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2007/V20/I1/15
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