期刊文献+

一种随机调整控制参数的鲸鱼优化算法 被引量:31

Whale Optimization Algorithm Based on Stochastic Adjustment Control Parameter
下载PDF
导出
摘要 针对标准鲸鱼优化算法在处理复杂优化问题时出现搜索精度低和易出现早熟收敛等缺点,提出一种随机调整控制参数的改进鲸鱼优化算法(EWOA)。受粒子群优化算法中惯性权重的启发,利用随机分布的方式调整控制参数,以平衡鲸鱼优化算法的全局搜索和局部搜索能力。对当前最优个体执行服从正态分布的变异扰动,以避免算法出现早熟收敛现象。此外,采取佳点集方法替代随机方法产生初始个体以提高算法的全局收敛速度。6个标准测试函数的仿真实验结果表明EWOA能有效处理高维复杂优化问题。 To overcome the problems about low precision and premature convergence,an effective whale optimization algorithm(EWOA) based on stochastic adjustment control parameter was proposed to deal with complex optimization problems.Inspired inertia weight of particle swarm optimization algorithm,the stochastic control parameter was introduced to balance the ability of global search and local search.In order to avoid the proposed EWOA falling into local convergence effectively,the normal mutation for updating strategy of the current optimal individual was developed.In addition,to enhance the global convergence,when producing the initial individuals,the good point set method was employed.The experimental results of 6 benchmark functions show good performance of the proposed EWOA in dealing with high-dimensional optimization problems when compared with other methods.
作者 钟明辉 龙文
出处 《科学技术与工程》 北大核心 2017年第12期68-73,共6页 Science Technology and Engineering
基金 国家自然科学基金(61463009)资助
关键词 鲸鱼优化算法 随机 控制参数 佳点集 全局搜索 局部搜索 whale optimization stochastic control parameter good point set global search local search
  • 相关文献

参考文献3

二级参考文献38

  • 1黄永青,梁昌勇,张祥德.基于均匀设计的蚁群算法参数设定[J].控制与决策,2006,21(1):93-96. 被引量:42
  • 2Dorigo M,Maniezzo V,Colorni A. Tile ant system: optimization by a colony of eooperalion agents. IEEE Transactions on Systems, Man,and Cybernetics - Part B,1996;26(1) :29-41.
  • 3Maniezzo V, Colorni,A. Ant system applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering, 1999 ; 11 ( 5 ) :769-778.
  • 4Aaron C Z,Angus R S,Holger R M,et al. Parametric study for an ant algorithm applied to water distribution system optimization. IEEE Transactions on Evolutionary Computation,2005;9(2):175-191.
  • 5Dorigo M,Stutzle T. Ant colony optimization. Cambridge,MA: MIT Press, 2004.
  • 6Adams J,Balas E,Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science,1988 ;34(3) :391-401.
  • 7Satake T,Morikawa K,Takabashi K,et al. Simulaled annealing approach for minimizing the makespan of the general job shop. International Journal of Production Economics, 1999; ( 60-61 ) : 515-522.
  • 8Pezzella F, Merelli E. A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research,2000 ; 120 ( 2 ) :297-310.
  • 9Tarantilis C D,Kiranoudis C T. A list-based threshold accepting method for job shop scheduling problems. International Journal of Production Economics,2002 ;77(2) : 159-171.
  • 10Park B J,Choi H R,Kim H S. A hybrid genetic algorithm for the job shop scheduling problems. Computersand Industrial Engineering,2003 ;45(4) :597-613.

共引文献53

同被引文献193

引证文献31

二级引证文献163

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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