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


Görkemli B. , Karaboğa D.

INFORMATION SCIENCES, cilt.502, ss.346-362, 2019 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 502
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1016/j.ins.2019.06.052
  • Dergi Adı: INFORMATION SCIENCES
  • Sayfa Sayıları: ss.346-362

Özet

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.