Analysis of constant creation techniques on the binomial-3 problem with grammatical evolution

摘要

This paper studies the difference between Persistent Random Constants (PRC) and digit concatenation as methods for generating constants. It has been shown that certain problems have different fitness landscapes depending on how they are represented, independent of changes to the combinatorial search space, thus changing problem difficulty. In this case we show that the method for generating the constants can also influence how hard the problem is for genetic programming.