期刊文献+

融合简化粒子群的教与学优化算法 被引量:1

A hybrid Method Based on Teaching-learning-based and Simplified Particle Swarm Optimization
下载PDF
导出
摘要 教与学优化算法(teaching-learning-based optimization algorithm,TLBO)是一种基于班级"教师阶段"和"学生阶段"的新型群智能优化算法.针对算法求解高维非线性复杂优化问题时精度较低的缺点,提出一种混合的教与学优化算法(HTLBO).首先,对"教师阶段"中的学生平均水平重新定义,并采用一种自适应策略根据粒子的适应度值对学习因子动态取值;然后,在迭代的过程中,根据适应度值将种群分成两个子种群,对于适应度值好的子种群采用改进的教与学优化算法(ATLBO)更新以增加种群的多样性,对于适应度值差的子种群采用简化粒子群算法(SPSO)以提升子种群的收敛性;最后,通过10个无约束优化问题进行对比测试实验,结果显示,HTLBO在探索性能和收敛速度方面优于TLBO等其他4种类型的算法. Teaching-learning-based optimization(TLBO)is a novel swarm intelligence optimizationalgorithm.Since the low accuracy of TLBO for solving high dimensional nonlinear complex optimization problems,A hybrid TLBO algorithm(HTLBO)is proposed in this paper.Firstly,the average level of students is redefined in the"teacher stage",and the learning factor is adopted according to the fitness value of the particle with an adaptive strategy.Then,the population is divided into two sub populations according to the fitness value in the process of iteration.To the sub populations with good fitness,the improved TLBO(ATLBO)is used to increase the population diversity.The SPSO is used to improve the convergence of sub populations for the sub populations with poor fitness.Finally,through 10 unconstrained optimization problems are compared and tested,the results show that HTLBO is significantly better than the other four types of TLBO algorithm.
作者 杨鹏
出处 《河南师范大学学报(自然科学版)》 CAS 北大核心 2016年第6期159-164,共6页 Journal of Henan Normal University(Natural Science Edition)
基金 国家自然科学基金(61462001) 北方民族大学校级科研项目(2013XYZ027)
关键词 教与学算法 无约束优化 混合 简化粒子群 teaching-learning-based optimization(TLBO) unconstrained optimization hybrid simplified particle swarm optimization(SPSO)
  • 相关文献

参考文献8

二级参考文献90

  • 1湛锋,魏星,郭建全,胡志坚,陈允平.基于改进粒子群优化算法的PID参数整定[J].继电器,2005,33(19):23-27. 被引量:10
  • 2赫然,王永吉,王青,周津慧,胡陈勇.一种改进的自适应逃逸微粒群算法及实验分析[J].软件学报,2005,16(12):2036-2044. 被引量:134
  • 3潘峰,陈杰,甘明刚,蔡涛,涂序彦.粒子群优化算法模型分析[J].自动化学报,2006,32(3):368-377. 被引量:65
  • 4刘金琨.先进PID控制MATLAB仿真[M].3版.北京:电子工业出版社,2011.
  • 5郭大庆,李晓,赵永进.基于改进PSO算法的PID参数自整定[J].计算机工程,2007,33(18):202-204. 被引量:20
  • 6YU X H. Can backpropagation error surface not have localminims [ J ]. Neural Networks, 1992, 3 (6) : 1009-1021.
  • 7YU X H, CHEN G A. On the local minima free condition of backpropagation learning [ J ]. IEEE Transactions on Neural Networks, 1995, 6(5): 1300-1303.
  • 8GOLDBERG D E, KORB B, DEB K. Messy genetic algo- rithms: motivation, analysis, and first results[J]. Complex Systems, 1989, 3(5): 493-530.
  • 9CLERC M, KENNEDY J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space [ J ]. IEEE Transactions on Evolutionary Computation, 2002, 6 (1): 58-73.
  • 10RAO R V, SAVSANI V J, VAKHARIA D P. Teaching- learning-based optimization: a novel method for constrained mechanical design optimization problems [ J ]. Computer Ai- ded Design, 2011, 43(3) : 303-315.

共引文献437

同被引文献7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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