<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>of the controlled models with migration flows</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anastasia V. Demidova</string-name>
          <email>demidova-av@rudn.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olga V. Druzhinina</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olga N. Masina</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexey A. Petrov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>44-2</institution>
          ,
          <addr-line>Vavilov St., Moscow, 119333</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Bunin Yelets State University</institution>
          ,
          <addr-line>28, Communards St., Yelets, 399770</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Federal Research Center “Computer Science and Control” of Russian Academy of Sciences</institution>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Peoples' Friendship University of Russia (RUDN University)</institution>
          ,
          <addr-line>6, Miklukho-Maklaya St., Moscow, 117198</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <fpage>117</fpage>
      <lpage>129</lpage>
      <abstract>
        <p>Nonlinear models of the interconnected communities population dynamics are considered taking into account migration and competition. Formulations of optimal control problems are proposed for models with migration flows. The control quality criterion for a three-dimensional migration-population model is considered in the framework of optimal control problems with phase and mixed constraints. Computer research of nonlinear models with migration flows allowed us to obtain the results of numerical experiments on trajectory search and parameter estimation. To solve optimal control problems, we used numerical optimization methods and intelligent symbolic computing algorithms. These algorithms are based on the application of numerical optimization methods in combination with methods for generating control functions. The transition to the corresponding stochastic model with migration flows and optimal control is performed. In the stochastic case, the method of constructing self-consistent stochastic models is used. A comparative analysis of deterministic and stochastic models is carried out. The efects typical for controlled three-dimensional models with migration flows are revealed. Specialized software packages are used as tools for researching of models and solving of optimal control problems. These software packages implement algorithms for constructing trajectories, parametric optimization algorithms, and generating control functions, as well as numerical solutions of stochastic systems of diferential equations. The obtained results can be used in problems of computer modeling of ecological, demographic and socio-economic systems, as well as in the problems of synthesis, optimal control and stability analysis of multidimensional stochastic models describing migration flows.</p>
      </abstract>
      <kwd-group>
        <kwd>computation libraries</kwd>
        <kwd>computer modeling</kwd>
        <kwd>nonlinear models with migration flows</kwd>
        <kwd>numerical optimization methods</kwd>
        <kwd>optimal</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
Workshop
Proceedings
htp:/ceur-ws.org
IS N1613-073</p>
      <p>CEUR Workshop Proceedings (CEUR-WS.org)</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>The study of mathematical models of the interacting communities dynamics, taking into account
migration flows, is an important area of research [ 1, 2, 3, 4]. The efects of migration flows
in deterministic and stochastic population models are considered in [5, 6, 7, 8] and in other
works. For stochastic modeling of various types of dynamic systems, a method for constructing
self-consistent one-step models [9] is proposed and a software package [ 10, 11] is developed.
The specified software package allows you to perform computer research of models based on
the implementation of algorithms for the numerical solution of stochastic diferential equations,
as well as algorithms for generating trajectories of multidimensional Wiener processes and
multipoint distributions. It should be noted that the study of models of population-migration
systems is relevant to the application of applied mathematical packages and general-purpose
programming languages [12, 13].</p>
      <p>In [14], a comparative analysis of the results of a computer study obtained for three-dimensional
and four-dimensional stochastic models with migration flows is carried out. A comparison is
made of the qualitative properties of four-dimensional models taking into account changes in
migration rates, as well as intraspecific and interspecific interaction coeficients. The paper [ 15]
is devoted to construction of four-dimensional nonlinear models of the interconnected
communities number dynamics taking into account migration and competition, as well as taking
into account migration, competition and mutualism. A qualitative and numerical study of
these models is performed. A comparative analysis of the results is carried out. In [16], the
construction of multidimensional models is proposed taking into account competition and
mutualism, as well as taking into account migration flows. In [ 15, 16], a number of statements
of optimal control problems for models with migration flows using phase and mixed constraints
are proposed.</p>
      <p>A number of control problems for population dynamics models are studied in [17, 18, 19, 20]
and in other papers. Some optimal control problems of distributed models of population
dynamics are considered in [17]. In [18], the optimality criterion for auto-reproduction systems
is formalized and the optimal control problem for the analysis of evolutionarily stable behavior is
considered. In [19], the problem of the optimal behavior of a two-species population in the area
taking into account migration was set and the equilibria corresponding to the optimal behavior
of populations in the sense of maximizing growth rates are determined. For a four-dimensional
population model without competition, the problem of control synthesis is considered in [20].
This control provides an approximation to the set of equilibrium states in a finite time.</p>
      <p>Such scientific directions as the creation of algorithms and the design of programs for solving
of global parametric optimization problems are of theoretical and applied interest. Among the
features of global parametric optimization problems, one can single out the high dimension of
the search space, the complex landscape, and the high computational complexity of the target
functions. Algorithms inspired by the nature [21, 22, 23, 24] are quite efective for solving
these problems. In [25], a number of algorithms for single-criterion global optimization of the
dynamic systems with switching trajectories are developed and the modular structure of a
software package for modeling switched systems is described. The modular structure and a
combination of formal and heuristic methods allow a universal approach to the study of various
classes of models. In [26], the searching problems of optimal parameters of switched models
taking into account the action of non-stationary forces are considered, and searching algorithms
of optimal motion parameters using intelligent control methods are developed. A comparative
analysis of the methods of single-criterion global optimization is given and the questions of
their application for finding of the coeficients of parametric control functions are considered.</p>
      <p>In this paper, nonlinear models of the interconnected communities number dynamics are
considered taking into account migration and competition. Formulations of optimal control
problems for models with migration flows are proposed. The problem of optimal control with
phase constraints for a three-dimensional migration-population model is solved. To solve the
optimal control problem, numerical optimization methods and intelligent symbolic computation
algorithms are used. A computer study of a controlled migration-population model is carried
out. A stochastic model with migration flows and optimal control is constructed. To construct
this model, we used a method of constructing self-consistent stochastic models. The properties
of models in deterministic and stochastic cases are characterized. Specialized software packages
are used as tools for researching models and solving optimal control problems. The software
packages are intended for conducting numerical experiments based on the implementation
of algorithms for constructing motion trajectories, parametric optimization algorithms and
generating control functions, as well as for numerically solving systems of diferential equations
using the modified Runge–Kutta methods.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Description of a deterministic model without control</title>
      <p>
        One of the basic migration-population models, taking into account competition and migration
lfows, is a three-dimensional model that describes the dynamics of two interconnected
communities, with the first species migrating to another range, and in the first range competing with
the second species. The indicated model is defined by a system of diferential equations of the
form
 1̇ =  1 1 −  11 12 −  13 1 3 +  2 −   1,
 2̇ =  2 2 −  22 22 +   1 −  2,
 3̇ =  3 3 −  33 32 −  31 1 3,
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where  1 and  3 are the densities of populations of competing species in the first areal,  2 are
the population densities in the second areal,  2 are the interspecific competition coeficients,
  ( ≠ ) are the coeficients of intraspecific competition,   ( = 1, 2, 3)are the coeficients of
natural growth,   ( = 1, 2, 3)are the coeficients of migration of the species between two areals,
while the second areal is a refuge.
      </p>
      <p>
        For   = 1,   = 1,  ≠  ,  13 =  31, the analysis of the model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) and its generalizations is
performed in [5, 6, 7, 14, 15]. The model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is a generalization of the model considered in [2] to
the case of diverging migration rates. It is important to note that the model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) serves as the
basis for the transition to the construction of multidimensional nonlinear models with migration
lfows. In the process of model calculations, standard packages of symbolic calculations are
used. When considering multidimensional generalizations, dificulties arise in calculations with
symbolic parameters, in particular, when finding equilibrium states and constructing phase
portraits. In this regard, a series of computer experiments are conducted, during which the
most representative sets of numerical values of parameters are considered. A computer study
made it possible to conduct a comparative analysis of the properties of three-dimensional and
four-dimensional models in deterministic and stochastic cases. However, for these models,
no computer study is conducted taking into account the control actions. Next, we consider
optimal control problems in the dynamics models of interacting communities taking into account
migration flows.
      </p>
    </sec>
    <sec id="sec-4">
      <title>3. Optimal control problems</title>
      <p>We formulate optimal control problems for a three-dimensional model with migration flows.
The dynamics of the controlled model is described by a system of diferential equations
 1̇ =  1 1 −  11 12 −  13 1 3 +  2 −   1 −  1 1,
 2̇ =  2 2 −  22 22 +   1 −  2 −  2 2,
 3̇ =  3 3 −  33 32 −  13 1 3 −  3 3,
where   =   ()are control functions.</p>
      <p>
        The constraints for the model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) are set in the form
 1(0) = 10,  2(0) = 20,  3(0) = 30,  1( ) =  11,
      </p>
      <p>2( ) =  21,  3( ) =  31,  ∈ [0,  ],
0 ⩽  1 ⩽  11, 0 ⩽  2 ⩽  21, 0 ⩽  3 ⩽  31,  ∈ [0,  ].</p>
      <p>
        In relation to the problem (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )–(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) the functional to be maximized is written as
 3
0 =1
 () = ∫
∑ (   −   )  (),
      </p>
      <p>0
or</p>
      <p>() = ∫ [( 1 1 −  1) 1() +( 2 2 −  2) 2() +( 3 3 −  3) 3()] .</p>
      <p>
        The quality control criterion (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) corresponds to the maximum profit from the using of
populations, and   is the cost of the  -th population,   is the cost of technical equipment
corresponding to the  -th population.
      </p>
      <p>
        The optimal control problem  1 for the model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) can be formulated as follows.
( 1) Find the maximum of the functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) under the conditions (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ).
      </p>
      <p>The following type of restrictions imposed on   ()is also of interest for study:
0 ⩽  1() +  2() +  3() ⩽  ,   () ⩾ 0,  = 1, 2, 3,  ∈ [0,  ].</p>
      <p>
        The optimal control problem  2 for the model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) is formulated as follows.
( 2) Find the maximum of the functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) under the conditions (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ).
      </p>
      <p>
        In problems of population dynamics, restrictions of the form   ⩾ 0 imposed on phase variables
are natural. Often, restrictions  ̇ ⩽   on the growth of the  -th populaton are often used, which
leads to mixed restrictions. Given these features, along with the problems  1,  2, optimal
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
control problems with phase and mixed constraints are of interest. The traditional direction of
research, taking into account the problems  1,  2, is the search for the conditions of existence
and uniqueness of the maximum of the functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) based on the application of Pontryagin
maximum principle. However, due to the dificulties of the analytical study of multidimensional
dynamic models and the characteristics of the control quality criterion, methods of numerical
optimization are often used. Next, we consider the application of numerical optimization
methods as applied to optimal control problems in models with migration flows.
      </p>
    </sec>
    <sec id="sec-5">
      <title>4. Description of algorithms for solving the parametric optimization problem</title>
      <p>
        To find the maximum of the functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ), it is proposed to use numerical optimization methods
using intelligent symbolic computation algorithms to find the control functions   ().
      </p>
      <p>
        The algorithm for solving the problem  1 (algorithm 1) contains the following steps.
1. Generation of control functions.
2. Construction of trajectories for the model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ).
3. Search for numerical value of criterion (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ).
4. Check for a break condition. If the break condition is reached, the algorithm ends.
      </p>
      <p>Otherwise, go to step 1.</p>
      <p>To generate control functions, the method of symbolic regression is used. Its principle is to
present expressions in the form of a tree whose nodes are arithmetic operations or mathematical
functions.</p>
      <p>The main problem with the automatic generation of symbol trees is that a arbitrarily generated
tree is not necessarily correct. In addition, an additional problem is that numerical optimization
algorithms, as a rule, operate with real numbers.</p>
      <p>To solve these problems the software package is developed for solving global parametric
optimization problems in Python. The software package includes the following algorithms.</p>
      <p>1. Arithmetic coding (algorithm 2). This algorithm is used in entropy compression of
information and allows you to convert real numbers (from 0 to 1) into a sequence of characters of any
alphabet, and also allows you to control the probability of a character appearing in a message.</p>
      <p>2. A node generator based on a finite state machine (algorithm 3). A state machine for
generating nodes of a symbol tree can be represented as a cyclic directed graph, transition
conditions for which are sequentially read from a symbol message (alphabet “abcd”). On each
of the nodes, the automaton returns an operation, operator, variable or number.</p>
      <p>3. An algorithm for constructing trees based on linked lists (algorithm 4). The indicated
algorithm allows generating a symbolic expression, obtaining its textual representation, and
counting by substituting the argument x. The principle of the algorithm is based on the dynamic
construction of a linked list by recursive substitution of nodes.</p>
      <p>4. Message generation algorithm (algorithm 5). Heuristic algorithms for numerical
optimization are used in combination with algorithms 2–4. The process of encoding a character tree is
to find the number  ∈ [0, 1] .</p>
      <p>
        Using algorithms 3–5 it is possible to find the control functions   ()for functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) in
symbolic form. The described algorithms can be used to solve a wide class of problems of
searching for unknown functions, as well as problems of stability, control, forecasting and
clustering. It is important to note that the process of encoding a symbol tree is similar to the
selection of weights of a neural network, and the symbol tree is a universal approximator. In this
regard, symbol trees can be used to construct artificial neurons (when using several variables),
as well as to construct activation functions for the output layer.
      </p>
      <p>It should be noted that the proposed algorithms have less computational complexity compared
to using a trained neural network. In addition, they can be used in conjunction with symbolic
mathematics packages.</p>
    </sec>
    <sec id="sec-6">
      <title>5. Results of computer experiments</title>
      <p>
        We consider a special case of the implementation of Algorithm 1. As control functions, we use
positive polynomials of  -th degree. In developing Python programs, the following optimization
algorithms are used to solve the  1 problem: the Powell algorithm and diferential evolution
from the SciPy mathematical library. The problem of maximizing functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) can be reduced
to the problem:
      </p>
      <p>
        ‖(,  − )‖ →min,
where  is the absolute deviation of the trajectories from  11,  21,  31 (see formula (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )), denoted
by  − inverse exponent corresponding to functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ).
      </p>
      <p>Control functions have the form:</p>
      <p>() = ‖   ‖,   = (0,  1, … ,   ),  = ( 0,  1, … ,   ) ,
where   are the parametric coeficients;  is the degree of the polynomial; ‖.‖ is the Cartesian
norm of the vector.</p>
      <p>
        For model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), in the framework of solving the problem  1, on the base of on the above
numerical optimization algorithms, a series of computer experiments is carried out.
Experimental results and comparative analysis of algorithms for   = 1,   = 1,  = 1 ,  = 1 ,
 1(0) = 1, 2(0) = 0.,5 3(0) = 1, 1 = 0.2,   = 10,  1 = 1,  2 = 0.5,  3 = 1 are presented in
Table 1. Note that for convenience and simplicity, multiple 3 values of the coeficients are used
in accordance with the number of functions   ().
      </p>
      <p>
        Figure 1 shows the trajectories of system (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) for the case  = 0 , when   = const. Here and
further along the abscissa axis, time is indicated, along the ordinate axis, the population density
 1,  2,  3 for system (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ).
      </p>
      <p>It should be noted that for diferential evolution with  = 0 a similar result is obtained.</p>
      <p>
        Figure 2 shows the trajectories of model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) for  = 1 using the Powell algorithm. The use
of linear control functions significantly increases the value of criterion (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ), while the error
decreases (see Table 1). Using the Powell algorithm for  = 2 gives trajectories similar to those
for  = 1 .
      </p>
      <p>
        Figure 3 presents the results of constructing the trajectories of system (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) for  = 2 using
diferential evolution. According to the results obtained, the use of quadratic control functions
 allows one to significantly increase the value of functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ).
      </p>
      <p>
        Based on the results shown in Table 1, we can conclude that the efectiveness of control
functions increases with increasing degree of polynomial. However, it should be noted that
the computational complexity of the main algorithm 1 is significantly increased. It can be
assumed that the largest values of the functional (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) correspond to the oscillating trajectories
of the model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ). This assumption is consistent with the results of computer experiments (see
      </p>
      <p>
        In the next section of the paper, for the analysis of stochastic models, we used the results of a
computer experiment conducted for model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) at  = 0 ,  = 1 ,  = 2 . The results can be used to
search for control functions using symbolic regression and artificial neural networks.
      </p>
    </sec>
    <sec id="sec-7">
      <title>6. Construction and analysis of a stochastic controlled model with migration flows</title>
      <p>To construct a stochastic population model taking into account competition and migration flows
and control, it is proposed to apply the method of constructing self-consistent stochastic models
[8, 9, 10]. This method involves recording the system under study in the form of an interaction
scheme, i.e. symbolic record of all possible interactions between system elements. For this
symbolic record we use the system state operators and the system state change operator. Then
we can get the drift and difusion coeficients for the Fokker–Planck equation. This approach
to modeling allows us to write the Fokker–Planck equation and the equivalent stochastic
diferential equation in the Langevin form.</p>
      <p>To obtain a stochastic model, it is necessary to write the interaction scheme, which has the
following form:



 
  −→ 2  ,  = 1, 3;
  +   −−→   ,  = 1, 3;
 1 +  3 −−−1→3 0,
 1 −→  2,  2 −→  1,
  −→ 0,  = 1, 3.</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
      </p>
      <p>
        In this interaction scheme (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), the first line corresponds to the natural reproduction of species
in the absence of other factors, the 2nd line symbolizes intraspecific competition, and the 3rd line
symbolizes interspecific competition. The fourth line is a species migration process description
from one range to another. The last line is responsible for control.
      </p>
      <p>Further, for this interaction scheme using the developed software package [ 14] for
obtaining the coeficients of the Fokker–Planck equation from the interaction schemes using the
SymPy [11] symbolic computing system, the following expressions for the coeficients are
obtained:
() =
(
 1 1 −  11 12 −  13 1 3 +  2 −   1 −  1 1
 2 2 −  22 22 −  2 +   1 −  2 2
 3 3 −  33 32 −  13| 1 3 −  3 3</p>
      <p>) ,
where
() = (− 2 −   1
 = ( 1,  2,  3)is the vector describing the state of the system. The coeficient () is the drift
vector, the coeficient</p>
      <p>
        () is the difusion matrix for the Fokker–Planck equation (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), for a
model dimension equal to 3:

=1
1 
2
∑
      </p>
      <p>,=1
  (, ) = −

∑ [  () (, )] +
 
[   (, )].</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
Further, the obtained coeficients are transferred to another module of the software package for
the numerical solution of the resulting stochastic diferential equation.
      </p>
      <p>
        For the numerical experiment of the obtained stochastic model, the same parameters are
chosen as for the numerical analysis of the deterministic model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ). The results of a
numerical solution of a stochastic diferential solution for two sets of control function values
are shown in Figures 4 and 5.
      </p>
      <p>
        A comparative analysis showed that in the first case, namely, for  1 = 0.012,  2 = 1.408,  3 =
0.606, the introduction of stochastics weakly afects the behavior of the system. The solutions
remain close to the boundary conditions  1 = 0.2 specified for the model (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ).
      </p>
      <p>In the second case, namely, for  1 = 1.123 − 0.124 ,  2 = 0.58 + 0.089 ,  3 = 1.738 − 0.179 , the
introduction of stochastics greatly changes the behavior of the system. Thus, in this case, to
obtain optimal solutions to the stochastic model, it is necessary to use other methods.</p>
    </sec>
    <sec id="sec-8">
      <title>7. Conclusion</title>
      <p>In this paper, we propose methods for the analysis and synthesis of multidimensional nonlinear
controlled models of the interconnected communities dynamics, taking into account migration
and competition. The statements of optimal control problems for models with migration flows
are considered. A computer study of nonlinear models with migration flows made it possible to
obtain the results of numerical experiments in searching for trajectories and generating control
functions. The case of control functions representability in the form of positive polynomials
is studied. To solve optimal control problems, it is proposed to use numerical optimization
methods and intelligent symbolic computation algorithms. These algorithms are based on the
use of heuristic methods of numerical optimization in combination with methods for generating
control functions.</p>
      <p>The analysis of the generalized stochastic model with migration flows and optimal control
demonstrated the efectiveness of the method of constructing self-consistent stochastic models
for the controlled case. For a number of parameters sets, it is possible to conduct a series of
computer experiments to construct optimal trajectories of the stochastic model. A comparative
analysis of the studied deterministic and stochastic models is carried out.</p>
      <p>The use of the developed instrumental software, symbolic calculations, and generalized
numerical methods have demonstrated suficient eficiency for the computer study of
multidimensional nonlinear models with migration. The presented results can be used in computer
modeling of deterministic and stochastic migration processes taking into account control and
optimization requirements.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Takeuchi</surname>
          </string-name>
          ,
          <article-title>Global asymptotic behavior in single-species discrete difusion systems</article-title>
          ,
          <source>Journal of Mathematical Biology</source>
          <volume>32</volume>
          (
          <year>1993</year>
          )
          <fpage>67</fpage>
          -
          <lpage>77</lpage>
          .
          <source>doi:1 0 . 1 0 0 7 / B F 0 0</source>
          <volume>1 6 0 3 7 5 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2] X.
          <article-title>-a.</article-title>
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , L. Chen,
          <article-title>The linear and nonlinear difusion of the competitive Lotka-Volterra model</article-title>
          ,
          <source>Nonlinear Analysis</source>
          <volume>66</volume>
          (
          <year>2007</year>
          )
          <fpage>2767</fpage>
          -
          <lpage>2776</lpage>
          .
          <source>doi:1 0 . 1 0 1 6 / j . n a . 2 0 0 6 . 0 4 . 0 0 6 .</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>N.</given-names>
            <surname>Tkachenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Weissmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. P.</given-names>
            <surname>Petersen</surname>
          </string-name>
          , G. Lake,
          <string-name>
            <given-names>C. P. E.</given-names>
            <surname>Zollikofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Callegari</surname>
          </string-name>
          ,
          <article-title>Individual-based modelling of population growth and difusion in discrete time 2 (2017) e0176101. doi:1 0 . 1 3 7 1 / j o u r n a l</article-title>
          .
          <source>p o n e . 0 1</source>
          <volume>7 6 1 0 1 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. S.</given-names>
            <surname>Daus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jüngel</surname>
          </string-name>
          ,
          <article-title>Global existence analysis of cross-difusion population systems for multiple species</article-title>
          ,
          <source>Archive for Rational Mechanics and Analysis</source>
          <volume>227</volume>
          (
          <year>2018</year>
          )
          <fpage>715</fpage>
          -
          <lpage>747</lpage>
          .
          <source>doi:1 0 . 1 0 0 7 / s 0 0</source>
          <volume>2 0 5 - 0 1 7 - 1 1 7 2 - 6</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>I. N.</given-names>
            <surname>Sinitsyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Druzhinina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. N.</given-names>
            <surname>Masina</surname>
          </string-name>
          ,
          <article-title>Analytical modeling and stability analysis of nonlinear broadband migration flow</article-title>
          ,
          <source>Nonlinear world 16</source>
          (
          <year>2018</year>
          )
          <fpage>3</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Druzhinina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jaćimović</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. N.</given-names>
            <surname>Masina</surname>
          </string-name>
          ,
          <article-title>Construction and analysis of nondeterministic models of population dynamics</article-title>
          ,
          <source>Communications in Computer and Information Science</source>
          <volume>678</volume>
          (
          <year>2016</year>
          )
          <fpage>498</fpage>
          -
          <lpage>510</lpage>
          .
          <source>doi:1 0 . 1 0</source>
          <volume>0 7 / 9 7 8 - 3 - 3 1 9 - 5 1 9 1 7 - 3</volume>
          _
          <fpage>4</fpage>
          3 .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Druzhinina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. N.</given-names>
            <surname>Masina</surname>
          </string-name>
          ,
          <article-title>Design and stability analysis of nondeterministic multidimensional populations dynamics models</article-title>
          ,
          <source>in: Proceedings of the Selected Papers of the 7th International Conference ”Information and Telecommunication Technologies and Mathematical Modeling of High-Tech Systems” (ITTMM-2017)</source>
          , volume
          <year>1995</year>
          , Moscow, Russia,
          <year>2017</year>
          , pp.
          <fpage>14</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Gevorkyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Egorov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Kulyabov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Korolkova</surname>
          </string-name>
          , L. Sevastyanov,
          <article-title>Influence of stochastization on one-step models</article-title>
          ,
          <source>RUDN Journal of Mathematics, Information Sciences and Physics</source>
          (
          <year>2014</year>
          )
          <fpage>71</fpage>
          -
          <lpage>85</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Gevorkyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. R.</given-names>
            <surname>Velieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Korolkova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Kulyabov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Sevastyanov</surname>
          </string-name>
          ,
          <article-title>Stochastic Runge-Kutta Software Package for Stochastic Diferential Equations</article-title>
          , in: W. Zamojski,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mazurkiewicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sugier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Walkowiak</surname>
          </string-name>
          , J. Kacprzyk (Eds.),
          <source>Dependability Engineering and Complex Systems</source>
          , Springer International Publishing, Cham,
          <year>2016</year>
          , pp.
          <fpage>169</fpage>
          -
          <lpage>179</lpage>
          .
          <source>doi:1 0 . 1 0</source>
          <volume>0 7 / 9 7 8 - 3 - 3 1 9 - 3 9 6 3 9 - 2</volume>
          _
          <fpage>1</fpage>
          5 .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Gevorkyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. R.</given-names>
            <surname>Velieva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Korol'kova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Kulyabov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Sevast</surname>
          </string-name>
          <article-title>'yanov, Implementing a method for stochastization of one-step processes in a computer algebra system</article-title>
          ,
          <source>Programming and Computer Software</source>
          <volume>44</volume>
          (
          <year>2018</year>
          )
          <fpage>86</fpage>
          -
          <lpage>93</lpage>
          .
          <source>doi: 1 0 . 1 1 3 4 / S 0 3</source>
          <volume>6 1 7 6 8 8 1 8 0 2 0 0 4 4 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Lamy</surname>
          </string-name>
          , Instant SymPy Starter, Packt Publishing,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T. E.</given-names>
            <surname>Oliphant</surname>
          </string-name>
          , Python for scientific computing,
          <year>2007</year>
          .
          <source>doi: 1 0 . 1 1</source>
          <volume>0</volume>
          <fpage>9</fpage>
          <string-name>
            <surname>/ M C S</surname>
          </string-name>
          <article-title>E</article-title>
          .
          <volume>2 0 0 7 . 5</volume>
          <fpage>8</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T. E.</given-names>
            <surname>Oliphant</surname>
          </string-name>
          , Guide to NumPy, 2nd ed.,
          <source>CreateSpace Independent Publishing Platform, USA</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Druzhinina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. N.</given-names>
            <surname>Masina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. D.</given-names>
            <surname>Tarova</surname>
          </string-name>
          ,
          <article-title>Computer research of nonlinear stochastic models with migration flows</article-title>
          ,
          <source>in: Proceedings of the Selected Papers of the 9th International Conference «Information and Telecommunication Technologies and Mathematical Modeling of High-Tech Systems» (ITTMM-2019)</source>
          , volume
          <volume>2407</volume>
          , Moscow, Russia,
          <year>2019</year>
          , pp.
          <fpage>26</fpage>
          -
          <lpage>37</lpage>
          . Published at http://CEUR-WS.org.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Druzhinina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. N.</given-names>
            <surname>Masina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. D.</given-names>
            <surname>Tarova</surname>
          </string-name>
          ,
          <article-title>Analysis and synthesis of nonlinear dynamic models taking into account migration flows and control actions</article-title>
          ,
          <source>Nonlinear world 17</source>
          (
          <year>2019</year>
          )
          <fpage>24</fpage>
          -
          <lpage>37</lpage>
          .
          <source>doi:1 0 . 1 8 1 2 7 / j 2 0</source>
          <volume>7 0 0 9 7 0 - 2 0 1 9 0 5 - 0</volume>
          <fpage>3</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Druzhinina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jaćimović</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. N.</given-names>
            <surname>Masina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Mijajlovic</surname>
          </string-name>
          ,
          <article-title>Problems of synthesis, analysis and optimization of parameters for multidimensional mathematical models of interconnected populations dynamics</article-title>
          ,
          <source>Communications in Computer and Information Science (CCIS) 1145</source>
          (
          <year>2020</year>
          )
          <fpage>56</fpage>
          -
          <lpage>71</lpage>
          .
          <source>doi:1 0 . 1 0</source>
          <volume>0 7 / 9 7 8 - 3 - 0 3 0 - 3 8 6 0 3 - 0</volume>
          _
          <fpage>5</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>A. I. Moskalenko</surname>
          </string-name>
          ,
          <article-title>Methods of nonlinear mappings in optimal control. Theory and applications to models of natural systems</article-title>
          , Nauka, Novosibirsk,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>O. A.</given-names>
            <surname>Kuzenkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. V.</given-names>
            <surname>Kuzenkova</surname>
          </string-name>
          ,
          <article-title>Optimal control of auto-reproduction systems</article-title>
          ,
          <source>Bulletin of the Russian Academy of Sciences, Theory and control systems 4</source>
          (
          <year>2012</year>
          )
          <fpage>26</fpage>
          -
          <lpage>37</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>I. V.</given-names>
            <surname>Danilova</surname>
          </string-name>
          ,
          <article-title>The problem of optimal behavior of the population in the area taking into account intraspecific competition and migration, in: Proceedings of the XIII All-Russian Meeting on Control Problems of the VSPU-2019</article-title>
          , ICS of RAS, Moscow,
          <year>2019</year>
          , pp.
          <fpage>1476</fpage>
          -
          <lpage>1479</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>I. V.</given-names>
            <surname>Rublev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. E.</given-names>
            <surname>Morozova</surname>
          </string-name>
          ,
          <article-title>About one control problem for a four-dimensional food chain, in: Proceedings of the XIII All-Russian Meeting on Control Problems of VSPU-2019</article-title>
          , ICS of RAS, Moscow,
          <year>2019</year>
          , pp.
          <fpage>1500</fpage>
          -
          <lpage>1505</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Karpenko</surname>
          </string-name>
          ,
          <article-title>Modern search engine optimization algorithms</article-title>
          .
          <source>Algorithms inspired by nature</source>
          , 2nd ed.,
          <string-name>
            <given-names>N.E.</given-names>
            <surname>Bauman</surname>
          </string-name>
          <string-name>
            <surname>MSTU</surname>
          </string-name>
          , Moscow,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sakharov</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Karpenko,
          <article-title>Meta-optimization of mind evolutionary computation algorithm using design of experiments</article-title>
          ,
          <source>Advances in Intelligent Systems and Computing</source>
          <volume>874</volume>
          (
          <year>2018</year>
          )
          <fpage>473</fpage>
          -
          <lpage>482</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ashlock</surname>
          </string-name>
          ,
          <source>Evolutionary Computation for Modeling and Optimization</source>
          , Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>K.</given-names>
            <surname>Price</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Storn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lampinen</surname>
          </string-name>
          , Diferential Evolution: A Practical Approach to Global Optimization, Springer,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Petrov</surname>
          </string-name>
          ,
          <article-title>The structure of the software package for modeling technical systems under conditions of switching operating modes</article-title>
          ,
          <source>Electromagnetic waves and electronic systems 23</source>
          (
          <year>2018</year>
          )
          <fpage>61</fpage>
          -
          <lpage>64</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Druzhinina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. N.</given-names>
            <surname>Masina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Petrov</surname>
          </string-name>
          ,
          <article-title>The synthesis of the switching systems optimal parameters search algorithms</article-title>
          ,
          <source>Communications in Computer and Information Science (CCIS) 974</source>
          (
          <year>2019</year>
          )
          <fpage>306</fpage>
          -
          <lpage>320</lpage>
          .
          <source>doi:1 0 . 1 0</source>
          <volume>0 7 / 9 7 8 - 3 - 0 3 0 - 1 0 9 3 4 - 9</volume>
          _
          <fpage>2</fpage>
          2 .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>