摘要: 布谷鸟搜索算法是一种基于种群迭代搜索的全局优化算法。为求解无约束优化问题,提出一种改进的布谷鸟搜索算法。利用混沌序列构造初始种群以增加群体的多样性,引入动态随机局部搜索技术对当前最优解进行局部搜索,以加快算法的收敛速度。对4个标准测试函数进行仿真实验,并与其他6种算法进行比较,结果表明,该算法具有较强的全局搜索能力和较快的收敛速度。
关键词:
布谷鸟搜索算法,
无约束优化问题,
混沌,
动态随机局部搜索,
惯性权重,
多样性
Abstract: Cuckoo Search(CS) algorithm is proposed as a population-based optimization algorithm and it is so far successfully applied in a variety of fields. A modified CS algorithm is proposed for solving unconstrained optimization problems. Chaos sequence and dynamic random local search technique are introduced to enhance the optimization ability and to improve the convergence speed of CS algorithm. Through testing the performance of the proposed algorithm on a set of 4 benchmark functions and comparing with other six algorithms, simulation result shows that the proposed algorithm has great ability of global search and better convergence rate.
Key words:
Cuckoo Search(CS) algorithm,
unconstrained optimization problem,
chaotic,
dynamic random local search,
inertia weight,
diversity
中图分类号: