Chaotic bacterial colony chemotaxis algorithm and application
混沌细菌群体趋药算法及应用

To overcome the problem of slow convergence speed in bacterial colony chemotaxisBCC optimization algorithm, this paper presented chaotic bacterial colony chemotaxis CBCC algorithm. The algorithm introduced the chaotic search based on Tent map into bacterial colony to keep the variety of bacterial movement, and partitioned the bacteria into two groups: traditional group searching via BCC and chaotic group searching via Tent Map at the same time. So the global convergence performance was greatly enhanced. Finally, the classic examples show that chaos bacterial colony chemotaxis optimization algorithm has better convergence speed than traditional BCC.