A quick semantic artificial bee colony programming (qsABCP) for symbolic regression

被引:26
作者
Gorkemli, Beyza [1 ]
Karaboga, Dervis [1 ]
机构
[1] Erciyes Univ, Engn Fac, Intelligent Syst Res Grp, Kayseri, Turkey
关键词
Artificial bee colony programming (ABCP); Semantic ABCP; Quick ABCP; Quick semantic ABCP; Symbolic regression; Genetic programming; ELASTIC-MODULUS; ALGORITHM; OPTIMIZATION; PREDICTION; DESIGN;
D O I
10.1016/j.ins.2019.06.052
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Artificial bee colony programming (ABCP) is a novel evolutionary computation based automatic programming method, which uses the basic structure of artificial bee colony (ABC) algorithm. In this paper, some studies were conducted to improve the performance of ABCP and three new versions of ABCP are introduced. One of these improvements is related to the convergence performance of ABCP. In order to increase the local search ability and achieve higher quality solutions in early cycles, quick ABCP algorithm was developed. Experimental studies validate the enhancement of the convergence performance when the quick ABC approach is used in ABCP. The second improvement introduced in this paper is about providing high locality. Using semantic similarity based operators in the information sharing mechanism of ABCP, semantic ABCP was developed and experiment results show that semantic based information sharing improves solution quality. Finally, combining these two methods, quick semantic ABCP is introduced. Performance of these novel methods was compared with some well known automatic programming algorithms on literature test problems. Additionally, ABCP based methods were used to find approximations of the Colebrook equation for flow friction. Simulation results show that, the proposed methods can be used to solve symbolic regression problems effectively. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:346 / 362
页数:17
相关论文
共 50 条
[21]  
Gorkemli B., 2013, 2 INT S COMP INF MAT
[22]  
Gottlieb J., 2000, P 2 ANN C GEN EV COM, P283
[23]   Representation and structural difficulty in genetic programming [J].
Hoai, NX ;
McKay, RI ;
Essam, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (02) :157-166
[24]   Self-adaptive position update in artificial bee colony [J].
Jadon, Shimpi Singh ;
Sharma, Harish ;
Tiwari, Ritu ;
Bansal, Jagdish Chand .
INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2018, 9 (04) :802-810
[25]  
Johnson CG, 2003, LECT NOTES COMPUT SC, V2610, P345
[26]   Multi-robot path planning using co-evolutionary genetic programming [J].
Kala, Rahul .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (03) :3817-3831
[27]  
Kara D., 2012, International Online Journal of Primary Education, P1, DOI DOI 10.1109/INISTA.2012.6247010
[28]  
Karaboga D., 2010, Scholarpedia, V5, P6915, DOI DOI 10.4249/SCHOLARPEDIA.6915
[29]   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
[30]   A quick artificial bee colony (qABC) algorithm and its performance on optimization problems [J].
Karaboga, Dervis ;
Gorkemli, Beyza .
APPLIED SOFT COMPUTING, 2014, 23 :227-238