Performance comparison of crossover operators for postfix genetic programming
by Vipul K. Dabhi; Sanjay Chaudhary
International Journal of Metaheuristics (IJMHEUR), Vol. 3, No. 3, 2014

Abstract: In this article, we present three crossover operators for postfix-GP, a GP system that adopts postfix notation for an individual representation. These crossover operators are: GA-like one-point, sub-tree, and semantic aware sub-tree. The algorithm and implementation details for each of these crossover operators are presented. The operators are applied on a set of real-valued symbolic regression problems. The performance comparison of the crossover operators is carried out using two measures, number of successful runs and mean best adjusted fitness. The significance of the obtained results is tested using statistical test. The results suggest that semantic aware sub-tree crossover outperforms GA-like one-point and sub-tree crossovers on all problems.

Online publication date: Fri, 24-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com