METHOD OF BINARY ANALYTIC PROGRAMMING TO LOOK FOR OPTIMAL MATHEMATICAL EXPRESSION

Cover Page

Cite item

Full Text

Abstract

In the known methods of symbolical regression by search of the solution with the help of a genetic algorithm, there is a problem of crossover. Genetic programming performs a crossover only in certainpoints. Grammatical evolution often corrects a code after a crossover. Other methods of symbolical regression use excess elements in a code for elimination of this shortcoming. The work presents a new method of symbolic regression on base of binary computing trees. The method has no problems with a crossover. Method use a coding in the form of a set of integer numbers like analytic programming. The work describes the new method and some examples of codding for mathematical expressions.

References

  1. Koza, J.R. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, Massachusetts, London, MA: MIT Press, 1992. 819 p.
  2. O’Neill, M., Ryan, C. Grammatical Evolution. IEEE Trans. Evol. Comput. 2001, 5. Pp. 349-358.
  3. Zelinka, I. Analytic programming by Means of SOMA Algorithm. In Proceedings of 8th InternationalConference on Soft Computing Mendel 02, 2002, Brno, Czech Republic. Pp. 93-101.
  4. Diveev, A., Sofronova, E. Application of Network Operator Method for Synthesis of Optimal Structure and Parameters of Automatic Control System. Proc. of 17-th IFAC World Congress, Seoul, 05.07.2008 - 12.07.2008. Pp. 6106-6113.
  5. Miller, J., Thomson, P. Cartesian Genetic Programming. Proc. EuroGP’2000R 3rd European Conf. Genetic Programming, R. Poli, W. Banzhaf, W.B. Langdon, J.F. Miller, P. Nordin, and Fogarty, T.C. Eds., Edinburgh, Scotland, 2000, vol. 1802. Berlin: Springer-Verlag. Pp. 121-132.
  6. Luo, C., Zhang, S.-L. Engineering Applications of Arti cial Intelligence. 2012, 25. Pp. 1182-1193.

Copyright (c) 2017 Diveev A.I., Lomakova E.M.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies