Subtree deactivation control with grammatical genetic programming in dynamic environments
M O'Neill, A Brabazon… - 2008 IEEE Congress on …, 2008 - ieeexplore.ieee.org
2008 IEEE Congress on Evolutionary Computation (IEEE World …, 2008•ieeexplore.ieee.org
We investigate the usefulness of a subtree deactivation control mechanism which is open to
evolutionary learning. It is hypothesised that this representation confers an adaptive
advantage in dynamic environments over the standard sub-tree representation adopted in
Genetic Programming. Results presented on benchmark dynamic problem instances
provides evidence to support that such an adaptive advantage exists.
evolutionary learning. It is hypothesised that this representation confers an adaptive
advantage in dynamic environments over the standard sub-tree representation adopted in
Genetic Programming. Results presented on benchmark dynamic problem instances
provides evidence to support that such an adaptive advantage exists.
We investigate the usefulness of a subtree deactivation control mechanism which is open to evolutionary learning. It is hypothesised that this representation confers an adaptive advantage in dynamic environments over the standard sub-tree representation adopted in Genetic Programming. Results presented on benchmark dynamic problem instances provides evidence to support that such an adaptive advantage exists.
ieeexplore.ieee.org
