《计算机应用》唯一官方网站 ›› 2023, Vol. 43 ›› Issue (12): 3868-3874.DOI: 10.11772/j.issn.1001-9081.2023010025

• 先进计算 • 上一篇    下一篇

基于自适应竞争学习的教与学优化算法

王培崇1, 冯浩婧1, 李丽荣2()   

  1. 1.河北地质大学 信息工程学院,石家庄 050031
    2.河北地质大学 艺术学院,石家庄 050031
  • 收稿日期:2023-01-11 修回日期:2023-04-30 接受日期:2023-05-15 发布日期:2023-12-11 出版日期:2023-12-10
  • 通讯作者: 李丽荣
  • 作者简介:王培崇(1972—),男,河北辛集人,教授,博士,CCF会员,主要研究方向:群体智能、计算机视觉
    冯浩婧(1997—),女,河北唐山人,硕士研究生,CCF会员,主要研究方向:群体智能、计算机视觉;
  • 基金资助:
    河北省社会科学基金资助项目(HB21GL050);河北省高等学校科学技术研究项目(ZD2020344)

Improved TLBO algorithm with adaptive competitive learning

Peichong WANG1, Haojing FENG1, Lirong LI2()   

  1. 1.School of Information Engineering,Hebei GEO University,Shijiazhuang Hebei 050031,China
    2.College of Arts,Hebei GEO University,Shijiazhuang Hebei 050031,China
  • Received:2023-01-11 Revised:2023-04-30 Accepted:2023-05-15 Online:2023-12-11 Published:2023-12-10
  • Contact: Lirong LI
  • About author:WANG Peichong, born in 1972, Ph. D., professor. His research interests include swarm intelligence, computer vision.
    FENG Haojing, born in 1997, M. S. candidate. Her research interests include swarm intelligence, computer vision.
  • Supported by:
    Hebei Social Science Foundation(HB21GL050);Hebei Science and Technology Research Project for Higher Education Institutions(ZD2020344)

摘要:

针对求解较高维度优化问题时教与学优化(TLBO)算法容易出现早熟、解精度降低等问题,提出一种自适应竞争学习教与学优化算法(ITLBOAC)。首先,在“教”算子中引入非线性变化的权重参数,以决定当前个体自身状态的保持能力以及调整当前个体向教师学习的态度,从而使当前个体在早期更多地向教师学习,以迅速提升自身状态,而后期更多地保持自身状态,以减缓教师对它的影响;其次,以生态学协同竞争机制为基础,引入基于近邻个体间的自适应竞争的“学”算子,从而使当前个体选择它的近邻个体,并且让个体们从协作演化逐渐过渡到竞争学习。在12个Benchmark测试函数上的测试结果表明,相较于其他4种改进TLBO算法,所提算法具有更好的解精度、稳定性和收敛速度,同时相较于TLBO算法有大幅提升,验证了所提算法适合于求解较高维度的连续型优化问题。选择压缩弹簧和三杆桁架设计问题进行测试的结果表明,ITLBOAC获得的最优值分别比TLBO算法下降了3.03%和0.34%。可见,在求解约束工程优化问题时,ITLBOAC同样值得信任。

关键词: 教与学优化, 自适应学习, 竞争学习, 洛特卡-沃尔泰拉模型, 约束工程优化问题

Abstract:

For that the Teaching-Learning-Based Optimization (TLBO) algorithm has some problems, such as prematurity and poor solution accuracy, in solving high-dimensional optimization problems, an Improved TLBO algorithm with Adaptive Competitive learning (ITLBOAC) was proposed. Firstly, a weighted parameter with nonlinear change was introduced into the “teaching” operator to determine the ability of the current individual to maintain its own state and adjust the attitude of the current individual towards learning from teachers. As a result, the current individual learnt more from the teacher in the early stage to improve its own state quickly, and kept the state of itself more in the later stage to slow down the influence of the teacher on it. Then, based on ecological cooperation and competition mechanisms, a “learning” operator based on adaptive competition between nearest neighbor individuals was introduced. To make the current individual chose its near neighbors and the individuals eventually shifted from cooperative evolution to competitive learning. Test results on 12 Benchmark test functions show that compared with four improved TLBO algorithms, the proposed algorithm is better in terms of accuracy of solutions, stability and convergence speed, and is much better than TLBO algorithm at the same time, which verify that the proposed algorithm is suitable for solving high-dimensional continuous optimization problems. Test results with compression spring and three-bar truss design problems selected to test show that the optimal values obtained by ITLBOAC decreased by 3.03% and 0.34% respectively, compared with those obtained by TLBO algorithm. It can be seen that ITLBOAC is a trustworthy algorithm in solving constrained engineering optimization problems.

Key words: Teaching-Learning-Based Optimization (TLBO), adaptive learning, competitive learning, Lotka-Volterra model, constrained engineering optimization problem