Galván-López, Edgar and Poli, Riccardo (2009) An Empirical Investigation of How Degree Neutrality Affects GP Search. Lecture Notes in Computer Science, 5845. pp. 728-739. ISSN 0302-9743

Preview

Download (288kB) | Preview

Abstract

Over the last years, neutrality has inspired many researchers in the area of Evolutionary Computation (EC) systems in the hope that it can aid evolution. However, there are contradictory results on the effects of neutrality in evolutionary search. The aim of this paper is to understand how neutrality - named in this paper degree neutrality - affects GP search. For analysis purposes, we use a well-defined measure of hardness (i.e., fitness distance correlation) as an indicator of difficulty in the absence and in the presence of neutrality, we propose a novel approach to normalise distances between a pair of trees and finally, we use a problem with deceptive features where GP is well-known to have poor performance and see the effects of neutrality in GP search.

Item Type:	Article
Keywords:	Empirical; Investigation; Degree; Neutrality; Affects; GP Search;
Academic Unit:	Faculty of Science and Engineering > Computer Science Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	15426
Identification Number:	https://doi.org/10.1007/978-3-642-05258-3_64
Depositing User:	Edgar Galvan
Date Deposited:	07 Feb 2022 15:46
Journal or Publication Title:	Lecture Notes in Computer Science
Publisher:	Springer
Refereed:	Yes
URI:	Publisher
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads