###
DOI:
计算机系统应用英文版:2011,20(7):244-249
本文二维码信息
码上扫一扫!
和声搜索算法研究进展
(陕西理工学院 数学系,汉中 723001)
Advances in Harmony Search Algorithm
(Department of Mathematics, Shaanxi University of Technology, Hanzhong 723001, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 3113次   下载 7284
Received:November 09, 2010    Revised:December 06, 2010
中文摘要: 和声搜索算法是一种新兴的智能优化算法,通过反复调整记忆库中的解变量,使函数值随着迭代次数的增加不断收敛,从而来完成优化。算法概念简单、可调参数少、容易实现。研究了和声搜索算法的起源,基本思想;给出了和声搜索算法的步骤和基本流程,并分析了记忆库取值概率和微调概率对算法的影响。比较了和声搜索算法与遗传算法的差异,给出了和声搜索算法的应用前景和研究趋势。
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:陕西省教育厅自然科学研究项目(09JK381)
引用文本:
雍龙泉.和声搜索算法研究进展.计算机系统应用,2011,20(7):244-249
YONG Long-Quan.Advances in Harmony Search Algorithm.COMPUTER SYSTEMS APPLICATIONS,2011,20(7):244-249