RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Vychislitel'noi Matematiki // Archive

Sib. Zh. Vychisl. Mat., 2017 Volume 20, Number 2, Pages 169–180 (Mi sjvm644)

This article is cited in 3 papers

A parallel algorithm of the multivariant evolutionary synthesis of nonlinear models

O. G. Monakhov, E. A. Monakhova

Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 6 Acad. Lavrentiev avenue, Novosibirsk, 630090, Russia

Abstract: A parallel algorithm for solving the problem of constructing of nonlinear models (mathematical expressions, functions, algorithms, programs) based on given experimental data, a set of variables, basic functions and operations is proposed. The proposed algorithm of the multivariant evolutionary synthesis of nonlinear models has a linear representation of the chromosome, the modular operations in decoding the genotype to the phenotype for interpreting a chromosome as a sequence of instructions, the multivariant method for presenting a multiplicity of models (expressions) using a single chromosome. A comparison of the sequential version of the algorithm with a standard algorithm of genetic programming and the algorithm of the Cartesian Genetic Programming offers advantage of the algorithm proposed both in the time of obtaining a solution (by about an order of magnitude in most cases), and in the probability of finding a given function (model). In the experiments on the parallel supercomputer systems, estimates of the efficiency of the proposed parallel algorithm have been obtained showing linear acceleration and scalability.

Key words: parallel multivariant evolutionary synthesis, genetic algorithm, genetic programming, Cartesian genetic programming, nonlinear models.

UDC: 519.7+519.8

Received: 19.09.2016
Revised: 20.10.2016

DOI: 10.15372/SJNM20170205


 English version:
Numerical Analysis and Applications, 2017, 10:2, 140–148

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026