Solving variational and Cauchy problems with self-configuring genetic programming algorithm

Authors:
Sergey V. Burakov;Eugene S. Semenkin
Affiliations:
Siberian State Aerospace University, Krasnoyarskiy rabochiy avenue, 31, 660014, Krasnoyarsk, Russia;Siberian State Aerospace University, Krasnoyarskiy rabochiy avenue, 31, 660014, Krasnoyarsk, Russia
Venue:
International Journal of Innovative Computing and Applications
Year:
2013

Citing 7
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Inference Of Differential Equation Moels By Genetic Programming

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Solving differential equations with genetic programming

Genetic Programming and Evolvable Machines
A Field Guide to Genetic Programming

A Field Guide to Genetic Programming
Open issues in genetic programming

Genetic Programming and Evolvable Machines
Proceedings of the 11th international conference on Parallel problem solving from nature: Part I

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Parameter control in evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is suggested to use genetic programming techniques for solving Cauchy problem and variational problem that allows getting the exact analytical solution if it does exist and an approximate analytical expression otherwise. Features of solving process with this approach are considered. Results of numerical experiments are given. The approach improvement is fulfilled by adopting the self-configuring genetic programming algorithm that does not require extra efforts for choosing its effective settings but demonstrates the competitive performance.