Hierarchical multi-swarm cooperative teaching-learning-based optimization for global optimization

被引:17
作者
Zou, Feng [1 ]
Chen, Debao [1 ]
Lu, Renquan [2 ]
Wang, Peng [1 ]
机构
[1] HuaiBei Normal Univ, Sch Phys & Elect Informat, Huaibei 235000, Peoples R China
[2] Guangdong Univ Technol, Sch Automat, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Hierarchical multi-swarm cooperation; Teaching-learning-based optimization; Gaussian sampling learning; Regrouping; Latin hypercube sampling; POWER DISPATCH PROBLEM; DIFFERENTIAL EVOLUTION; ALGORITHM; LOCATION; DESIGN;
D O I
10.1007/s00500-016-2237-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Hierarchical cooperation mechanism, which is inspired by the features of specialization and cooperation in the social organizations, has been successfully used to increase the diversity of the population and avoid premature convergence for solving complex optimization problems. In this paper, a new two-level hierarchical multi-swarm cooperative TLBO variant called HMCTLBO is presented to solve global optimization problems. In the proposed HMCTLBO algorithm, all learners are randomly divided into several sub-swarms with equal amounts of learners at the bottom level of the hierarchy. The learners of each swarm evolve only in their corresponding swarm in parallel independently to maintain the diversity and improve the exploration capability of the population. Moreover, all the best learners from each swarm compose the new swarm at the top level of the hierarchy, and each learner of the swarm evolves according to Gaussian sampling learning. Furthermore, a randomized regrouping strategy is performed, and a subspace searching strategy based on Latin hypercube sampling is introduced to maintain the diversity of the population. To verify the performance of the proposed approaches, 48 benchmark test functions are evaluated. Conducted experiments indicate that the proposed HMCTLBO algorithm is competitive to some existing TLBO variants and other optimization algorithms.
引用
收藏
页码:6983 / 7004
页数:22
相关论文
共 47 条
[31]   Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization [J].
Qin, A. K. ;
Huang, V. L. ;
Suganthan, P. N. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (02) :398-417
[32]  
Rao R., 2012, Int. J. Ind. Eng. Comput, V3, P535, DOI [10.5267/J.IJIEC.2012.03.007, DOI 10.5267/J.IJIEC.2012.03.007]
[33]   Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems [J].
Rao, R. V. ;
Savsani, V. J. ;
Vakharia, D. P. .
COMPUTER-AIDED DESIGN, 2011, 43 (03) :303-315
[34]   An improved teaching-learning-based optimization algorithm for solving unconstrained optimization problems [J].
Rao, R. Venkata ;
Patel, Vivek .
SCIENTIA IRANICA, 2013, 20 (03) :710-720
[35]   Multi-objective optimization of heat exchangers using a modified teaching-learning-based optimization algorithm [J].
Rao, R. Venkata ;
Patel, Vivek .
APPLIED MATHEMATICAL MODELLING, 2013, 37 (03) :1147-1162
[36]  
Satapathy, 2013, APPL MATH, P429, DOI [DOI 10.4236/AM.2013.43064, 4]
[37]   A teaching learning based optimization based on orthogonal design for solving global optimization problems [J].
Satapathy, Suresh Chandra ;
Naik, Anima ;
Parvathi, K. .
SPRINGERPLUS, 2013, 2
[38]   Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces [J].
Storn, R ;
Price, K .
JOURNAL OF GLOBAL OPTIMIZATION, 1997, 11 (04) :341-359
[39]   Multimodal optimization using crowding-based differential evolution [J].
Thomsen, R .
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, :1382-1389
[40]   THE IMPORTANCE OF NEIGHBORS - THE SOCIAL, COGNITIVE, AND AFFECTIVE COMPONENTS OF NEIGHBORING [J].
UNGER, DG ;
WANDERSMAN, A .
AMERICAN JOURNAL OF COMMUNITY PSYCHOLOGY, 1985, 13 (02) :139-169