Binary Ant Colony Algorithm with Transferring the Signal

Author

Xiong, Wei-qing ; Wang, Liu-yi

Author_Institution

Inst. of Comput. Sci. & Technol., Ningbo Univ.

fYear

2006

fDate

13-16 Aug. 2006

Firstpage

2148

Lastpage

2153

Abstract

This paper designs a kind of binary colony algorithm. Each ant stands at the former place to form one dimension linear queue to transfer the signal each other. While the signal passes through each ant, the ant randomly chooses state (0 or 1) according to its own pheromone. By adopting the binary coding, the need for single ant behavior is lower and the corresponding memory is relatively less. This improves the algorithm´s efficiency and makes the realization be relatively easy. The test function and the multi 0/1 Knapsack problem show that the algorithm has better convergence speed and stability, the result is very excellent

Keywords

artificial life; binary codes; directed graphs; evolutionary computation; knapsack problems; optimisation; queueing theory; Knapsack problem; ant behavior; binary ant colony optimization algorithm; binary coding; one dimension linear queue; pheromone; signal transfer; Algorithm design and analysis; Ant colony optimization; Computational modeling; Computer science; Convergence; Cybernetics; Evolutionary computation; Humans; Intelligent structures; Machine learning; Machine learning algorithms; Signal design; Stability; Stochastic processes; Testing; Swarm intelligence; ant colony algorithm; binary network; simulated evolutionary computation;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2006 International Conference on

Conference_Location

Dalian, China

Print_ISBN

1-4244-0061-9

Type

conf

DOI

10.1109/ICMLC.2006.258611

Filename

4028419