A parallel algorithm of multi-variant evolutionary synthesis of nonlinear models

A parallel algorithm has been proposed for solving the problem of construction of nonlinear models (mathematical expressions, functions, algorithms, and programs) using given experimental data, set of variables, basic functions and operations. The designed algorithm of multivariant evolutionary synthesis of nonlinear models includes linear representation of a chromosome, modular operations in decoding of a genotype into a phenotype for interpreting a chromosome as a sequence of instructions, and a multi-variant method for presenting a set of models (expressions) using a single chromosome. A sequential version of the algorithm is compared with a standard genetic programming (GP) algorithm and a Cartesian genetic programming (CGP) one. The algorithm proposed was shown to excel the GP and CGP algorithms both in the time required for search for a solution (more than by an order of magnitude in most cases) and in the probability of finding a given function (model). Experiments have been carried out on parallel supercomputer systems, and estimates of the efficiency of the parallel algorithm offered have been obtained; the estimates demonstrate linear acceleration and scalability.