期刊文献+

多维多极值函数优化的和声退火算法 被引量:12

Harmony Annealing Algorithm for Multi-dimensional Function Optimization
下载PDF
导出
摘要 针对多极值实函数优化问题,本文结合和声搜索与模拟退火算法,提出了一种新的搜索算法,即和声退火算法。新算法保留了和声搜索的搜索机理,但对和声搜索中于和声记忆库外的搜索方法用超快速模拟退火算法作了改进,对和声记忆库内新解产生方法也作了相应的调整,从而提高了对多维问题的搜索效率。数值实验结果表明算法对和声搜索有明显的改进,收敛速度更快,跳出局部极值点的能力较强。新算法在解决多维多极值优化问题方面比遗传算法更具效率,值得进一步研究与推广应用。 Based on the combination of harmony search and simulated annealing, a novel optimizing method, harmony annealing algorithm (HAA), for solving multi-dimensional real optimization problems is presented in this paper. With the main search mechanism of harmony search , the solution generation outside harmony memory is improved by using very fast simulated annealing and the solution combination inside harmony memory is modified. So that the search efficiency for solving multi-dimensional optimizing problems is improved. Experimental numerical results show that the search efficiency of the new method is much higher than that of harmony search, especially for solving multi-dimensional and multimodal optimization problems. Further exploration and application are proposed.
出处 《计算机仿真》 CSCD 2004年第10期79-82,共4页 Computer Simulation
关键词 和声退火算法 和声搜索 模拟退火 函数优化 Harmony annealing algorithm Harmony search Simulated annealing Function optimization
  • 相关文献

参考文献8

  • 1刘勇等.非数值并行算法(第二册)--遗传算法[M].北京:科学出版社,1998.
  • 2康立山,谢云等,非数值并行算法(第一册)--模拟退火算法[M].北京:科学出版社,1998.
  • 3Z W Geem, J H Kim and G V Loganathan . A New Heuristic Optimization Algorithm: Harmony Search[J]. Simulation, 2001,76(2):60-68.
  • 4Z W Geem, Chung-Li Tseng. Engineering Applications of Harmony Search[C]. Late-Breaking Papers of Genetic and Evolutionary Computation Conference (GECCO-2002), New York City, USA, July 2002. 169-173.
  • 5Z W Geem, Chung-Li Tseng. New Methodology, Harmony Search and Its Robustness[C]. Late-Breaking Papers of Genetic and Evolutionary Computation Conference (GECCO-2002), New York City, USA, July 2002. 174-178.
  • 6Szu H and Hartley R. Fast Simulated Annealing[J]. Phys Lett A, 1987,122:157-162.
  • 7L Ingber. Very Fast Simulated Reannealing[J]. Math Comput Modeling,1989,12:967-973.
  • 8张彤,张华,王子才.浮点数编码的遗传算法及其应用[J].哈尔滨工业大学学报,2000,32(4):59-61. 被引量:56

二级参考文献5

  • 1[1] ZBIGNIEW MICHALEWICZ, CEZARY Z J, JACEK B K. A modified genetic algorithm for optimal control problems[J]. Computers Math Applic, 1992, 23(2): 83-94.
  • 2[2] JIM ANTONISSE. A new interpretation of schema notation that overturns the binary encoding constraint//. Proc 3rd Int Conf Genetic Algorithms[C]. 1989.
  • 3[3] GREFENSTETTE J J, BAKER J E. How genetic algorithms work: a critical look at lmplicit parallelism//. Proc 3rd nt Conf Genetic Algorithms[C]. 1989.
  • 4[4] DARRELL WHITLEY. The genitor algorithm and selection pressure: why rank-based allocation of reproductive trials is best//. Proc 3rd Int Conf Genetic Algorithms[C]. 1989.
  • 5[5] SRINIVAS M, PATNAIK L M. Adaptive probabilities of crossover and mutation in genetic algorithms[J]. IEEE Trans on System Man and Cybernetics, 1994, 24(4): 656-667.

共引文献59

同被引文献139

引证文献12

二级引证文献95

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部