Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Communications of the ACM
Size Control Via Size Fair Genetic Operators In The PushGP Genetic Programming System
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
An Analysis of Koza's Computational Effort Statistic for Genetic Programming
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Computational Intelligence: An Introduction
Computational Intelligence: An Introduction
A genetic algorithm that adaptively mutates and never revisits
IEEE Transactions on Evolutionary Computation
More on computational effort statistics for genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Improving performance of GP by adaptive terminal selection
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Conventional genetic programming (GP) does not guarantee no revisits, i.e., a program may be generated for fitness evaluations more than one time. This is clearly wasteful in applications that involve expensive and/or time consuming fitness evaluations. This paper proposes a new GP - non-revisiting genetic programming NrGP - that guarantees that all programs generated is original. The basic idea is to use memory to store all programs generated. To increase efficiency in indexing and storage, the memory is organized as an S-expression trie. Since the number of solutions generated is modest for applications involving expensive and/or time consuming fitness evaluations, the extra memory needed is manageable. GP and NrGP are compared using two GP bench mark problems, namely, the symbolic regression and the even N-parity problem. It is found that NrGP outperforms GP, significantly reducing the computational effort (CE) required. This clearly shows the power of the idea of ensuring no revisits. It is anticipated that the same non-revisiting idea can be applied to other types of GP to enhance their efficiency. A new CE measurement is also reported that removes some statistical biases associated with the conventional CE.