Oliver Flasch
Thomas Bartz-Beielstein
ABSTRACT
RGP is a new genetic programming system based on the R environment. The system implements classical untyped tree-based genetic programming as well as more advanced variants including, for example, strongly typed genetic programming and Pareto genetic programming. It strives for high modularity through a consistent architecture that allows the customization and replacement of every algorithm component, while maintaining accessibility for new users by adhering to the "convention over configuration" principle. Typical GP applications are supported by standard R interfaces. For example, symbolic regression via GP is supported by the same "formula interface" as linear regression in R. RGP is freely available as an open source R package.
- W. Banzhaf, F. D. Francone, R. E. Keller, and P. Nordin. Genetic programming: an introduction: on the automatic evolution of computer programs and its applications. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1998. Google Scholar
Digital Library
- H. Barendregt, S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, and H. P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, pages 117--309. Oxford University Press, 1992. Google ScholarDigital Library
- T. Bartz-Beielstein, M. Chiarandini, L. Paquete, and M. Preuss, editors. Empirical Methods for the Analysis of Optimization Algorithms. Springer, Berlin, Heidelberg, New York, 2009. In Press. Google ScholarDigital Library
- R. Poli, W. B. Langdon, and N. F. McPhee. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk, 2008. (With con- tributions by J. R. Koza). Google ScholarDigital Library
- R Development Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2009. ISBN 3-900051-07-0.Google Scholar
- M. Schmidt and H. Lipson. Comparison of tree and graph encodings as function of problem complexity. In D. T. et. al., editor, GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, volume 2, pages 1674--1679, London, 7-11 July 2007. ACM Press. Google ScholarDigital Library
- Y. Sun, D. Wierstra, T. Schaul, and J. Schmidhuber. Efficient natural evolution strategies. In GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 539--546, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- L. Tierney, A. J. Rossini, N. Li, and H. Sevcikova. snow: Simple Network of Workstations, 2009. R package version 0.3-3.Google Scholar
Index Terms
- RGP: an open source genetic programming system for the R environment
Recommendations
A Comparison of three evolutionary strategies for multiobjective genetic programming
We report what we believe to be the first comparative study of multi-objective genetic programming (GP) algorithms on benchmark symbolic regression and machine learning problems. We compare the Strength Pareto Evolutionary Algorithm (SPEA2), the Non-...
An Investigation of Geometric Semantic GP with Linear Scaling
GECCO '23: Proceedings of the Genetic and Evolutionary Computation ConferenceGeometric semantic genetic programming (GSGP) and linear scaling (LS) have both, independently, shown the ability to outperform standard genetic programming (GP) for symbolic regression. GSGP uses geometric semantic genetic operators, different from ...
Bingo: a customizable framework for symbolic regression with genetic programming
GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference CompanionIn this paper, we introduce Bingo, a flexible and customizable yet performant Python framework for symbolic regression with genetic programming. Bingo maintains a modular code structure for simple abstraction and easily swappable components. Fitness ...
Comments