二进制布谷鸟搜索算法

Binary cuckoo search algorithm

为了寻找求解NP完全问题的新算法,采用二进制编码串表示鸟巢的位置,对布谷鸟寻找新鸟巢的Lévy飞行路径分别按照Kennedy和Eberha公式及刘建华公式进行二进制代码变换,引入二进制编码控制系数对变换得到的二进制编码进行混合更新,保留布谷鸟蛋被淘汰的机制等方法将新型高效的布谷鸟搜索(CS)算法改进为二进制布谷鸟搜索(BCS)算法。将BCS算法用于求解背包问题,结果好于遗传算法和几种混合遗传算法;将BCS算法用于求解旅行商问题,结果好于遗传算法、蚁群算法和微粒群算法,但略差于改进的惯性权重自适应调整微粒群优化算法。二进制布谷鸟搜索算法是求解NP完全问题的新型高效算法。

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 L^vy 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.