期刊文献+

混沌精英质心拉伸机制的樽海鞘群算法 被引量:10

Salp Swarm Algorithm Using Chaotic and Elite Centroid Stretching Mechanism
下载PDF
导出
摘要 针对樽海鞘群算法求解精度不高的缺点,提出一种混沌精英质心拉伸机制的樽海鞘群算法。引入改进的Tent混沌序列生成初始种群,以增加初始个体的多样性;选择最优个体采用精英质心拉伸机制,可增强全局搜索能力。将改进算法在12个典型复杂函数和CEC2014函数优化问题上进行仿真实验,并同经典的遗传算法和粒子群算法进行对比。结果表明,混沌精英质心拉伸机制的樽海鞘群算法具有更好的全局搜索能力,寻优精度比标准算法有所增强。在求解高维和多峰测试函数上,改进算法拥有更好的性能。 In order to solve the problem that the standard Salp Swarm Algorithm(SSA)has low result precision in the evolutionary process,an improved algorithm called Chaotic and Elite centroid stretching mechanism Salp Swarm Algorithm(CESSA)is proposed.The improved Tent chaotic sequence is used to initiate the individuals’position,which can strengthen the diversity of initiate individuals.Then the elite centroid stretching mechanism is applied to the current elite individuals,which can enhance global searching ability of the proposed CESSA algorithm.The improved algorithm is simulated on 12 typical complex functions and CEC2014 function optimization problems,and compared with two classical intelligent algorithms,genetic algorithm and particle swarm optimization algorithm.The results show that the CESSA has better global searching ability,and meanwhile,the optimization accuracy is also enhanced than the standard algorithm.Especially,in solving the high-dimension and multimodal function optimization problem,the improved algorithm has better performance.
作者 陈忠云 张达敏 辛梓芸 张绘娟 闫威 CHEN Zhongyun;ZHANG Damin;XIN Ziyun;ZHANG Huijuan;YAN Wei(College of Big Data&Information Engineering,Guizhou University,Guiyang 550025,China)
出处 《计算机工程与应用》 CSCD 北大核心 2020年第10期44-50,共7页 Computer Engineering and Applications
基金 贵州省自然科学基金(黔科合基础[2017]1047号)。
关键词 混沌映射 精英质心拉伸机制 樽海鞘群算法 函数优化 chaotic map elite centroid stretching mechanism salp swarm algorithm function optimization
  • 相关文献

参考文献8

二级参考文献62

  • 1单梁,强浩,李军,王执铨.基于Tent映射的混沌优化算法[J].控制与决策,2005,20(2):179-182. 被引量:189
  • 2Chen L, Aihara K. Global search ability of chaotic neural networks [J]. IEEE Trans on Circuits Systems, 1999, 46 (8) : 974-993.
  • 3Feng J, Ying W Y. Pattern search algorithm an its application research in three-dimensional component layout [J]. J of Wuhan University of Technology,2003,27(2) :280-284.
  • 4KARABOGA D. An idea based on honey bee swarm for numerical optimization [R]. Kayseri: Erciyes University, 2005.
  • 5AKAY B. Performance analysis of artificial bee colony algorithm on numerical optimization problems [D]. Kayseri: Erciyes University, 2009.
  • 6KARABOGA D, OZTURK C. Neural networks training by artificial bee colony algorithm on pattern classification [J]. Neural Network World, 2009, 19(3): 279- 292.
  • 7KARABOGA D, OZTURK C A. Novel clustering approach: artifi- cial bee colony (ABC) algorithm [J]. Applied Soft Computing, 201 I, 11(1): 652 - 657.
  • 8ZHANG C S, OUYANG D, NING J X. An artificial bee colony ap- proach for clustering [J]. Expert Systems with Applications, 2010, 37(7): 4761 - 4767.
  • 9KARABOGA D, AKAY B. A modified artificial bee colony (ABC) algorithm for constrained optimization problems [J]. Applied S:[? Computing, 2011, 11(3): 3021 - 3031.
  • 10AKAY B, KARABOGA D. A modified artificial bee colony al gorithm for real-parameter optimization [J]. Information Sciences 2012, 192(6): 120- 142.

共引文献394

同被引文献78

引证文献10

二级引证文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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