Binary cuckoo search algorithm
Li-Min Du · Journal of Computer Applications · 2013
In order to find a new algorithm to solve the NP-complete problem,the new efficient Cuckoo Search(CS) algorithm was improved into a Binary Cuckoo Search(BCS) algorithm by some means.These means include: binary coding strings were used to express the position of bird's nest,the path of Levy flights that cuckoos searched for new bird's nest was transformed into binary coding respectively according to Kennedy and Eberha's formula and Liu Jianghua's formula,and then a binary coding control factor was introduced to the hybrid update of the transformed binary coding,and the elimination mechanism of cuckoo eggs was reserved.The BCS algorithm performs better than genetic algorithm and some mixed genetic algorithms in solving the knapsack problem,and also better than genetic algorithm,ant colony optimization and particle swarm optimization in solving the traveling salesman problem,but slightly worse than the improved particle swarm optimization through adjusting the inertia weights adaptively.In solving the NP-complete problem,BCS algorithm is a new efficient algorithm.