计算机应用 ›› 2016, Vol. 36 ›› Issue (3): 708-712.DOI: 10.11772/j.issn.1001-9081.2016.03.708

• 人工智能 • 上一篇    下一篇

改进的动态自适应学习教与学优化算法

王培崇1,2   

  1. 1. 石家庄经济学院 信息工程学院, 石家庄 050031;
    2. 中国矿业大学 机电与信息工程学院, 北京 100083
  • 收稿日期:2015-08-10 修回日期:2015-09-23 出版日期:2016-03-10 发布日期:2016-03-17
  • 通讯作者: 王培崇
  • 作者简介:王培崇(1972-),男,河北辛集人,副教授,博士,CCF会员,主要研究方向:机器学习、模式识别。
  • 基金资助:
    河北省科技支撑项目(13214711,15210710),石家庄经济学院预研项目(syy201310)。

Improved dynamic self-adaptive teaching-learning-based optimization algorithm

WANG Peichong1,2   

  1. 1. School of Information Engineering, Shijiazhuang University of Economics, Shijiazhuang Hebei 050031, China;
    2. School of Mechanical Electronic and Information Engineering, China University of Mining and Technology, Beijing 100083, China
  • Received:2015-08-10 Revised:2015-09-23 Online:2016-03-10 Published:2016-03-17
  • Supported by:
    This work is partially supported by the Science and Technique Support Fund of Hebei Province (13214711, 15210710), the Pre-research Fund of Shijiazhuang University of Economics (syy201310).

摘要: 为了克服教与学优化(TLBO)算法在求解函数优化问题时容易陷入局部最优、后期收敛速度慢、解精度较低等的弱点,提出了一种动态自适应学习和动态随机搜索机制的改进教与学优化算法。首先,在教师的教学过程中,引入一个线性变化的动态学习因子,来调整在迭代寻优过程中学生自身知识对本次学习的贡献价值。其次,为了提高算法的解精度,教师个体将执行动态随机搜索算法以加强对种群内的最优个体所在解空间的勘探。在14个标准测试函数上进行仿真实验,将所提算法与其他相关算法进行对比,结果表明所提算法不仅在求解精度,而且其收敛速度均优于标准TLBO算法,适合求解较高维的函数优化问题。

关键词: 教与学优化, 函数优化, 动态自适应学习, 种群多样性, 动态随机搜索

Abstract: The Teaching-Learning-Based Optimization (TLBO) algorithm in function optimization problems has some weakness, such as falling into the local optimum value,converging slowly in the later period and acquiring solution inaccurately. To overcome these shortcomings, an improved TLBO algorithm with dynamic self-adaptive learning and dynamic random searching was proposed. Firstly, a linear increment dynamic variation coefficient was introduced into the teaching process to adjust the value of knowledge to individual learning in the iterative optimization process. Secondly, in order to improve the precision of solution, teacher individual executed dynamic random searching to exploit the solution space around the best individual. The experiments were conducted on 14 classic testing functions, and the experimental results show that the proposed algorithm is much better than standard TLBO at not only the accuracy of solutions but also for the convergence speed. It is suitable to solve the high-dimensional function optimization problem.

Key words: Teaching-Learning-Based Optimization (TLBO), function optimization, dynamic self-adaptive learning, diversity of population, dynamic random search

中图分类号: