Balanced Cartesian Genetic Programming via migration and opposition-based learning: application to symbolic regression

The exploration–exploitation trade-off is an important aspect of evolutionary algorithms which determines the efficiency and accuracy of these algorithms. Cartesian Genetic Programming (CGP) is a generalization of the graph based genetic programming. It is implemented with mutation only and does not...

Full description

Saved in:
Bibliographic Details
Published in:Genetic programming and evolvable machines Vol. 16; no. 2; pp. 133 - 150
Main Authors: Yazdani, Samaneh, Shanbehzadeh, Jamshid
Format: Journal Article
Language:English
Published: Boston Springer US 01.06.2015
Subjects:
Artificial Intelligence
Biomedical Engineering and Bioengineering
Compilers
Computer Science
Electrical Engineering
Interpreters
Programming Languages
Programming Techniques
Software Engineering/Programming and Operating Systems
Exploration–exploitation trading-off
Biogeography-based optimization
Cartesian Genetic Programming
Opposition-based learning
Migration
ISSN:1389-2576, 1573-7632
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The exploration–exploitation trade-off is an important aspect of evolutionary algorithms which determines the efficiency and accuracy of these algorithms. Cartesian Genetic Programming (CGP) is a generalization of the graph based genetic programming. It is implemented with mutation only and does not have any possibility to share information among solutions. The main goal of this paper is to present an effective method for balancing the exploration and exploitation of CGP referred to as Balanced Cartesian Genetic Programming (BCGP) by incorporating distinctive features from biogeography-based optimization (BBO) and opposition-based learning. To achieve this goal, we apply BBO’s migration operator without considering any modifications in the representation of CGP. This operator has good exploitation ability and can be used to share information among individuals in CGP. In addition, in order to improve the exploration ability of CGP, a new mutation operator is integrated into CGP inspired from the concept of opposition-based learning. Experiments have been conducted on symbolic regression. The experimental results show that the proposed BCGP method outperforms the traditional CGP in terms of accuracy and the convergence speed.
ISSN:1389-2576
1573-7632
DOI:10.1007/s10710-014-9230-4