基于混沌序列的自适应步长的布谷鸟算法
|
摘要
布谷鸟算法(CS)是一种新的寻优算法,该算法存在局部搜索能力差,收敛速度慢,收敛精度不高等问题。布谷鸟初始位置的选择具有较强的随机性,通过在布谷鸟的初始位置引入混沌序列,在鸟窝更新时,步长的选择可以防止算法陷入局部最优,故建立基于混沌序列自适应步长的布谷鸟算法,通过测试函数进行比较该算法(ASBCS)优于布谷鸟算法(CS)。
Cuckoo algorithm(CS) is a new optimization algorithm. It has some problems, such as poor local search ability, slow convergence speed and low convergence accuracy. The selection of cuckoo's initial position has strong randomness. By introducing chaotic sequence into cuckoo's initial position, the selection of step size can prevent the algorithm from falling into local optimum when the nest is updated. Therefore, an adaptive cuckoo algorithm based on chaotic sequence is established. By comparing the test functions, the algorithm(ASBCS) is superior to cuckoo algorithm(CS).
Cuckoo algorithm(CS) is a new optimization algorithm. It has some problems, such as poor local search ability, slow convergence speed and low convergence accuracy. The selection of cuckoo's initial position has strong randomness. By introducing chaotic sequence into cuckoo's initial position, the selection of step size can prevent the algorithm from falling into local optimum when the nest is updated. Therefore, an adaptive cuckoo algorithm based on chaotic sequence is established. By comparing the test functions, the algorithm(ASBCS) is superior to cuckoo algorithm(CS).
引文
[1]YANG X S,DEB S.Cuckoo Search Via Lévy Flights[C]//2009 World Congress on Nature&Biologically Inspired Computing(NaBIC),IEEE,2009:142.
[2]席裕庚,柴天佑,恽为民.遗传算法综述[J].控制理论与应用,1996,13(6):697-708.
[3]郑洪清,周永权.一种自适应步长的布谷鸟搜索算法[J].计算机工程与应用,2013,49(10):68-71.
[4]冯春,谢进,李柏林.混沌优化算法的研究[C]//第十四届全国机构学学术研讨会暨第二届海峡两岸机构学学术交流会论文集,2004:304-306.
[2]席裕庚,柴天佑,恽为民.遗传算法综述[J].控制理论与应用,1996,13(6):697-708.
[3]郑洪清,周永权.一种自适应步长的布谷鸟搜索算法[J].计算机工程与应用,2013,49(10):68-71.
[4]冯春,谢进,李柏林.混沌优化算法的研究[C]//第十四届全国机构学学术研讨会暨第二届海峡两岸机构学学术交流会论文集,2004:304-306.