A modified teaching-learning-based optimization algorithm for numerical function optimization

被引:15
作者
Niu, Peifeng [1 ]
Ma, Yunpeng [1 ]
Yan, Shanshan [2 ]
机构
[1] Yanshan Univ, Sch Elect Engn, Qinhuangdao 066004, Hebei, Peoples R China
[2] Hydropower Stn Adm Taolinkou Reservoir, Qinhuangdao 066004, Hebei, Peoples R China
基金
中国国家自然科学基金;
关键词
Teaching-learning-based optimization; Modified teaching-learning-based optimization; Exploratory and exploitative capabilities; Unconstrained numerical functions; CEC2017;
D O I
10.1007/s13042-018-0815-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a kind of modified teaching-learning-based optimization algorithm (MTLBO) is proposed to enhance the solution quality and accelerate the convergence speed of the conventional TLBO. Compared with TLBO, the MTLBO algorithm possesses different updating mechanisms of the individual solution. In teacher phase of the MTLBO, the students are divided into two groups according to the mean result of learners in all subjects. Moreover, the two groups present different updating strategies of the solution. In learner phase, the students are still divided into two groups, where the first group includes the top half of the students and the second group contains the remaining students. The first group members increase their knowledge through interaction among themselves and study independently. The second group members increase their marks relying on their teacher. According to the above-mentioned updating mechanisms, the MTLBO can provide a good balance between the exploratory and exploitative capabilities. Performance of the proposed MTLBO algorithm is evaluated by 23 unconstrained numerical functions and 28 CEC2017 benchmark functions. Compared with TLBO and other several state-of-the-art optimization algorithms, the results indicate that the MTLBO shows better solution quality and faster convergence speed.
引用
收藏
页码:1357 / 1371
页数:15
相关论文
共 28 条
[1]  
Awad NH, 2016, TECHNICAL REPORT
[2]   A swarm optimization algorithm inspired in the behavior of the social-spider [J].
Cuevas, Erik ;
Cienfuegos, Miguel ;
Zaldivar, Daniel ;
Perez-Cisneros, Marco .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (16) :6374-6384
[3]   A new metaheuristic for numerical function optimization: Vortex Search algorithm [J].
Dogan, Berat ;
Olmez, Tamer .
INFORMATION SCIENCES, 2015, 293 :125-145
[4]   Krill herd: A new bio-inspired optimization algorithm [J].
Gandomi, Amir Hossein ;
Alavi, Amir Hossein .
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2012, 17 (12) :4831-4845
[5]   A novel hybrid algorithm of imperialist competitive algorithm and teaching learning algorithm for optimal power flow problem with non-smooth cost functions [J].
Ghasemi, Mojtaba ;
Ghavidel, Sahand ;
Rahmani, Shima ;
Roosta, Alireza ;
Falah, Hasan .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2014, 29 :54-69
[6]   A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm [J].
Karaboga, Dervis ;
Basturk, Bahriye .
JOURNAL OF GLOBAL OPTIMIZATION, 2007, 39 (03) :459-471
[7]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[8]  
Krishnanand KR, 2011, APPL MULTIOBJECTIVE, P697
[9]   Model NOx emissions by least squares support vector machine with tuning based on ameliorated teaching-learning-based optimization [J].
Li, Guoqiang ;
Niu, Peifeng ;
Zhang, Weiping ;
Liu, Yongchao .
CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 2013, 126 :11-20
[10]   Development and investigation of efficient artificial bee colony algorithm for numerical function optimization [J].
Li, Guoqiang ;
Niu, Peifeng ;
Xiao, Xingjun .
APPLIED SOFT COMPUTING, 2012, 12 (01) :320-332