Binary Ant Colony Algorithm with Transferring the Signal

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