Mutation operators for Genetic Programming using Monte Carlo Tree Search

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{ISLAM:2020:ASC,

• author = "Mohiul Islam and Nawwaf Kharma and Peter Grogono",
• title = "Mutation operators for Genetic Programming using Monte Carlo Tree Search",
• journal = "Applied Soft Computing",
• pages = "106717",
• year = "2020",
• ISSN = "1568-4946",
• DOI = "doi:10.1016/j.asoc.2020.106717",
• URL = "http://www.sciencedirect.com/science/article/pii/S1568494620306554",
• keywords = "genetic algorithms, genetic programming, Evolutionary computation, Computational intelligence, Program synthesis, Monte Carlo Simulation, Monte Carlo Tree Search, Symbolic regression, Expansion, Reduction",
• abstract = "Expansion is a novel mutation operator for Genetic Programming (GP). It uses Monte Carlo simulation to repeatedly expand and evaluate programs using unit instructions, which extends the search beyond the immediate - often misleading - horizon of offspring programs. To evaluate expansion, a standard Koza-style tree-based representation is used and a comparison is carried out between expansion and sub-tree crossover as well as point mutation. Using a diverse set of benchmark symbolic regression problems, we prove that expansion provides for better fitness performance than point mutation, when included with crossover. Expansion also provides a significant boost to fitness when compared to GP using crossover only, with similar or lower levels of program bloat. Despite expansion's success in improving evolutionary performance, it does not eliminate the problem of program bloat. In response, an analogous genetic operator, reduction, is proposed and tested for its ability to keep a check on program size. We conclude that the best fitness can be achieved by including these three operators in GP: crossover, point mutation and expansion",

}

Genetic Programming entries for Mohiul Islam Nawwaf Kharma Peter Grogono

Citations