- author = "Henning Cui and David Paetzel and Andreas Margraf and Joerg Haehner",
- title = "Weighted Mutation of Connections To Mitigate Search Space Limitations in Cartesian Genetic Programming",
- booktitle = "Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms",
- year = "2023",
- editor = "Francisco Chicano and Franz Rothlauf",
- pages = "50--60",
- address = "Potsdam, Germany",
- month = "30 " # aug # "-1 " # sep,
- organisation = "SIGEVO",
- publisher = "Association for Computing Machinery",
- keywords = "genetic algorithms, genetic programming, Cartesian Genetic Programming, CGP, Evolutionary Algorithm, Mutation, DAG",
- isbn13 = "9798400702020",
-
DOI = "
doi:10.1145/3594805.3607130",
- size = "11 pages",
- abstract = "we present and evaluate modification to mutation operators for Cartesian Genetic Programming (CGP). We discuss and highlight a so far unresearched limitation of how CGP explores its search space which is caused by certain nodes being inactive for long periods of time. Our new mutation operator is intended to avoid this by associating each node with a dynamically changing weight. When mutating a connection between nodes, those weights are then used to bias the probability distribution in favour of inactive nodes. This way, inactive nodes have a higher probability of becoming active again. We include our mutation operator into two variants of CGP and benchmark both versions on four Boolean learning tasks. We analyse the average numbers of iterations a node is inactive and show that our modification has the intended effect on node activity. The influence of our modification on the number of iterations until a solution is reached is ambiguous if the same number of nodes is used as in the baseline without our modification. However, our results show that our new mutation operator leads to fewer nodes being required for the same performance; this saves CPU time in each iteration.",
-
notes = "Parity, Encode, Decode, Multiply
FOGA17",
