摘要
为了提升和声算法的局部搜索能力,提出了一种新颖的混沌和声算法.新算法首先设计了一种佳点集初始化操作,使得初始和声库更加均匀的分布在定义域空间;其次引入了一种自适应候选和声产生策略,增强了算法的收敛速度;再次设计了一种混沌局部搜索机制,提升算法的局部搜索能力.针对五个标准测试函数的仿真实验结果表明,新算法无论是收敛速度还是求解质量都显著优于基本和声算法.
An novel chaos harmony search algorithms（CHS） are proposed to overcome the shortcoming of lacking the local searching ability.Firstly,in order to distribute more evenly in the domain space,the initialized population is generated based on the good point set.Secondly,an adaptive mechanism,in which candidate harmony is generated,is introduced to accelerate the convergence speed.Thirdly,a local search mechanism based on the chaos sequence is designed to improve the local search capability of CHS The simulation results for five benchmarks show that compared with the basic harmony search algorithm,the new algorithms performance better.
出处
《微电子学与计算机》
CSCD
北大核心
2013年第1期118-122,共5页
Microelectronics & Computer
关键词
优化
混沌
和声算法
optimization
chaos
harmony search algorithm
