期刊文献+

具有随机分形自适应搜索策略的蚁狮优化算法 被引量:1

Improved ant Lion Algorithm Withstochastic Fractal and Self-adaption Searching Strategy Computer Engineering and Applications
下载PDF
导出
摘要 针对蚁狮算法在平衡开发能力与探索能力不足的缺点,提出了具体有随机分形自适应搜索策略的改进算法。在该策略中,蚂蚁利用随机分形搜索方程提高算法的探索能力;蚁狮利用自适应搜索方程在最优位置进行精细搜索,以提高算法的开发能力。对3个单峰、3个多峰标准测试函数进行寻优,仿真结果表明,相比于其他算法,所提出的改进算法很好地平衡了自身的开发能力和探索能力,显著提高了全局优化能力和收敛速率。 For the problems of the unbalanced capability between exploration and exploitation of ant lion optimizer(ALO),an improved ALO algorithm with stochastic fractal and self-adaption searching strategy(SFSALO)is proposed.On the one hand,the stochastic fractal searching function is used for ant so as to improve the capability of exploration.On the other hand,self-adaption searching method is adopted for ant lion at the best position in order to improve the convergence precision and the exploitation ability.The simulation on 3 single-peak and 3 multi-peak benchmark functions shows that the proposed algorithm can fully balances the exploration and exploitation and significantly improves the global optimizationability and the convergence speed.
作者 赵克新 黄长强 王渊 ZHAO Ke-xin;HUANG Chang-qiang;WANG Yuan(School of Aeronautics of Engineering,Air Force University,Xi’an 710038,China)
出处 《火力与指挥控制》 CSCD 北大核心 2019年第2期41-45,49,共6页 Fire Control & Command Control
基金 国家自然科学基金(61601505) 航空科学基金资助项目(20155196022)
关键词 蚁狮优化算法 随机分形 自适应 函数优化 ant lion algorithm stochastic fractal adaptive method function optimization
  • 相关文献

参考文献7

二级参考文献71

  • 1冯春,谢进,陈永.混沌分形优化方法及其应用[J].系统工程学报,2004,19(4):337-343. 被引量:7
  • 2Haibin Duan,Daobo Wang,Xiufen Yu.Research on the Optimum Configuration Strategy for the Adjustable Parameters in Ant Colony Algorithm[J].通讯和计算机(中英文版),2005,2(9):32-35. 被引量:16
  • 3[1]Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the travelling salesman problem[J]. IEEE Trans Evol Comp,1997,1(1):53-66.
  • 4[2]Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents[J]. IEEE Trans SMC: Part B,1996,26(1):29-41.
  • 5[3]Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies[A]. Proc IEEE Int Conf Evol Comp[C]. Piscataway, 1996.622-627.
  • 6[4]Boryczka U, Boryczka M. Generative policies in ant systems for scheduling[A]. 6th European Congr Intell Tech Soft Comp[C]. Bruxelles,1998.1:382-386.
  • 7[5]Boryczka U. Learning with delayed rewards in ant sys-tems for the job-shop scheduling problem[A]. First Int Conf Rough Sets Current Trends Comp[C]. Bruxelles,1998.271-274.
  • 8[6]Gambardella L M, Taillard E D, Dorigo M. Ant colonies for the quadratic assignment problem[J]. J Oper Res Soci,1999,50(2):167-176.
  • 9[7]Maniezzo V,Dorigo M,Colorni A.Algodesk:An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem[J]. European J Oper Res,1995,81(1):188-204.
  • 10[8]Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem[J]. Infor J Comp,1999,11(4):358-369.

共引文献239

同被引文献4

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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