和声搜索算法研究进展

摘要

Harmony search algorithm is a new intelligent optimization algorithm.By repeatedly adjusting the solution variables in harmony memory, the function converges to its optimal solution with increased iterations and completes the optimization.The algorithm is simple in concept, less adjustable parameters, easy to implement.In this paper, the origin of harmony search algorithm and the basic idea are given.We give the basic steps and processes of harmony search algorithm, and analyze harmony memory considering rate and pitch adjusting rate that effects on the algorithm.The difference between harmony search algorithm and genetic algorithm is compared.Furthermore, the applications and research trend of harmony search algorithm are pointed out.%和声搜索算法是一种新兴的智能优化算法,通过反复调整记忆库中的解变量,使函数值随着迭代次数的增加不断收敛,从而来完成优化.算法概念简单、可调参数少、容易实现,研究了和声搜索算法的起源,基本思想;给出了和声搜索算法的步骤和基本流程,并分析了记忆库取值概率和微调概率对算法的影响.比较了和声搜索算法与遗传算法的差异,给出了和声搜索算法的应用前景和研究趋势.