This paper is review pending but the review hasn't started. Editor and reviewer assignments are happening over in GitHub over here »

pyGOURGS - global optimization of n-ary tree representable problems using uniform random global search

The work entails an algorithm to enumerate n-ary trees, which are used in genetic programming to represent solutions to global optimization problems. We contend that genetic programming does not outperform random search, and so we devised an enumeration of n-ary trees to allow us to perform uniform random global search of the solution space and compare the performance of random search with that of genetic programming.

Repository Address:

Public user content licensed CC BY 4.0 unless otherwise specified.
ISSN 2475-9066