|
|
Binary Ant Colony Algorithm with Signal Transfer |
XIONG WeiQing, WEI Ping, ZHAO JieYu |
Institute of Computer Science and Technology, Ningbo University, Ningbo 315211 |
|
|
Abstract A kind of Binary Ant Colony Algorithm is designed. Each ant stands at the former place to form onedimension 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.
|
Received: 23 January 2006
|
|
|
|
|
[1] Dorigo M, Caro G D. Ant Colony Optimization: A New MetaHeuristic // Proc of the Congress on Evolutionary Computation. Washington, USA: IEEE Press, 1999, Ⅱ: 14701477 [2] Dorigo M. Optimization, Learning and Natural Algorithms. Ph.D Dissertation. Milan, Italy: Politecnico di Milano. Department of Electronics,1992 [3] Zbigniew M. Genetic Algorithms +Data Structures=Evolution Programs. Heidelberg, Germany: SpringerVerlag, 1996 [4] Zhao Jieyue. A Recurrent Stochastic Binary Network. Science in China: Information Sciences, 2001, 44(5): 376388 [5] Zhang Ling, Cheng Junsheng. Loose Brain-A Mathematical Model of Swarm Intelligence. Pattern Recognition and Artificial Intelligence, 2003, 16(1): 15 (in Chinese) (张 铃,程军盛.松散的脑袋——群体智能数学模型.模式识别与人工智能, 2003, 16(1): 15) [6] Chopard B, Droz M. Cellular Automata Modeling of Physical Systems. Cambridge, UK: Cambridge Press, 1998 [7] Stutzle T, Hoos H H. MaxMin Ant System. Future Generation Computer System, 2000, 16(8): 889914 [8] Manber U. Introduction to Algorithms: A Creative Approach. Milano, Italy: AddisonWesley, 1989 [9] Zhang Wenxiu, Leung Yee. Mathematical Foundation of Genetic Algorithms. Xi’an, China: Xi’an Jiaotong University Press, 2000 (in Chinese) (张文修,梁 怡.遗传算法的数学基础.西安:西安交通大学出版社, 2000) [10] Gutjahr W J. A GraphBased Ant System and Its Convergence. Future Generation Computer System, 2000, 16(8): 873888 [11] Gutjahr W J. ACO Algorithms with Guaranteed Convergence to the Optimal Solution. Information Processing Letters, 2002, 82(3): 145153 [12] Stutzle T, Dorigo M. A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms. IEEE Trans on Evolutionary Computation, 2002, 6(4): 358365 [13]Xiong Weiqing, Yu Shunhao, Zhao Jieyu. The Ant Colony Algorithm with the Division Work and Its Application. Pattern Recognition and Artificial Intelligence, 2003, 16(3): 328333 (in Chinese) (熊伟清,俞舜浩,赵杰煜.具有分工的蚁群算法及应用.模式识别与人工智能, 2003, 16(3): 328333) |
|
|
|