Abstract
Traditional genetic programming (GP) randomly combines
subtrees by applying crossover. There is a growing
interest in methods that can control such recombination
operations in order to achieve faster convergence. In
this paper, a new approach is presented for guiding the
recombination process for genetic programming. The
method is based on extracting the global information of
the promising solutions that appear during the genetic
search. The aim is to use this information to control
the crossover operation afterwards. A separate control
module is used to process the collected information.
This module guides the search process by sending
feedback to the genetic engine about the consequences
of possible recombination alternatives.
- algorithms,
- crossover,
- deceptive
- decision
- domain
- epistasis
- extraction,
- genetic
- global
- gp,
- information
- problem,
- problems,
- process,
- programming,
- recombination
- search,
- searching,
- tree
- trees,
Users
Please
log in to take part in the discussion (add own reviews or comments).