<!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>Development of Genetic Methods for Predicting the Incidence of Volumes of Emissions of Pollutants in Air</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Software Tools, National University “Zaporizhzhia Polytechnic”</institution>
          ,
          <addr-line>64 Zhukovskoho str., Zaporizhzhia, Ukraine, 69063</addr-line>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Air pollution essentially influences health of people, after all breath is a basis of life activity of any organism. Due to constant and repeated impacts on people through the air, they can change the quality of life and health of the population. The results of the analysis of the effect of polluted air on the incidence of the population are presented. Methods are proposed for constructing a mathematical model of the dependence of the incidence rates on the emissions of pollutants. A modified genetic method has been developed for optimizing model parameters based on a long short-term memory neural network. A modification of one of the operators of the genetic method, namely, the mutation operator, which allows the search for optimal values, excluding the loss of the best solutions acquired by the search, is proposed. Practical use of the developed methods will allow timely adjustment of the planned therapeutic, diagnostic, preventive measures, pre-determine the necessary resources for the localization and elimination of diseases in order to preserve the health of the population.</p>
      </abstract>
      <kwd-group>
        <kwd>modeling</kwd>
        <kwd>emissions</kwd>
        <kwd>pollutants</kwd>
        <kwd>stationary sources</kwd>
        <kwd>circulatory system diseases</kwd>
        <kwd>cancer</kwd>
        <kwd>neural networks</kwd>
        <kwd>genetic algorithm</kwd>
        <kwd>particle swarm method</kwd>
        <kwd>python</kwd>
        <kwd>keras</kwd>
        <kwd>theano</kwd>
        <kwd>cuda</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In recent decades, the problem of air pollution by harmful chemicals has been
considered in close connection with changes in health and mortality in many countries
around the world. The problem of the subject area under study is very topical and
attracts a lot of attention from the world scientific community in the field of health
care, and from the side of researchers in the field of Data Science.</p>
      <p>According to the World Health Organization (WHO), air pollution is currently the
largest environmental health risk factor. According to this estimate, about 3.7 million
additional deaths in 2012 were related to air pollution, and 4.3 million to indoor air
pollution. Since many people are exposed to both indoor and outdoor air pollution, the
number of deaths and diseases caused by these sources cannot simply be summed up,
WHO proposes to estimate the final number of victims of pollution in 2012 at around
7 million (WHO, 2014). The biggest health problems caused by direct exposure to air
pollution are related to circulatory diseases, respiratory diseases, cancer,
neuropsychiatric disorders and some others. Consequently, the health status and morbidity of the
population of the region can be considered as a derivative of the environment.
Therefore, it is necessary to determine this impact, as well as the model of dependence of
the number of patients on the types and volumes of emissions of pollutants into the
air.</p>
      <p>At the same time, reproduction of the model of such dependence is not a simple
task, because the level of pollution is not the only factor affecting the level of
morbidity and the dependence of morbidity on emissions is not linear. Therefore, such
modeling requires the use of modern methods such as artificial neural networks, genetic
algorithms and the like.</p>
      <p>In the given work the research of dependence of indicators of morbidity of the
population by diseases of blood circulation system, tuberculosis and oncological
diseases of volumes of emissions of polluting substances into the air as a result of
activity of stationary sources of pollution in various regions of Ukraine is carried out, and
also development of model of dependence of indicators of morbidity on volumes of
emissions of polluting substances.</p>
      <p>Traditional mathematical models used for dependence analysis, as well as modern
approaches to modeling using methods such as artificial neural networks, genetic
algorithms, multi-agent systems (particle swarm algorithm) and their combined
variants are considered.</p>
      <p>In the course of the work, models of dependence of morbidity on the volume of
pollutant emissions were built. A modified genetic method was developed to optimize
the parameters of the model based on a neural network of long term memory. In
addition, it was proposed to modify one of the operators of the genetic method, namely the
mutation operator, which allows to search for optimal values, excluding the loss of the
best solutions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Formulation of the problem</title>
      <p>Mathematical dependence of morbidity from pollutants amount can be defined as a
function where the independent variable is the amount of pollutant emissions and
dependent one – morbidity (1)</p>
      <p>Kmorb  f(xemiss ),
(1)
where Kmorb – morbidity, xemiss – indicators that describe the impact of emissions’
amount.</p>
      <p>
        Based on these data and statistical analysis [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], we can conclude that the desired
mathematical model won’t be deterministic, but rather stochastic.
      </p>
      <p>Many other factors are influencing morbidity apart from pollutants amount, and
their exact number is quite problematic to determine. If these factors are marked as x1,
x2, ..., xn, then generalized model of relationship (1) can be represented in the form
(2):
(2)</p>
      <p>Kmorb  f(xemiss ,x1,x2,...,xn ),</p>
      <p>
        When analyzing statistical data it was determined [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] that the main factor of
emissions’ influence on human health is the presence of toxic substances in their
composition. In turn, the nature and extent of exposure to toxic substances, their ability to
induce pathological conditions in humans vary depending on the combination of
meteorological and climatic factors such as temperature and rainfall.
      </p>
      <p>
        In addition, of course, the quality of medical services affects morbidity rates. As
the main metrics, which should be considered when building a morbidity dependance
model, the number of physicians (all specialties) in the region and the number of
hospital beds in inpatient health care facilities of the region as a quantitative indicator of
health care were used. Finally, as the morbidity distribution in different regions is
statistical, the population of the region should be taken into account to model such
dependency. Since, according to the medical statistics data [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1 – 3</xref>
        ], total morbidity has
different rates in different age groups (usually increases with age), the average age of
the population in the region should also be taken into account.
      </p>
      <p>Thus, a generalized model of morbidity dependency on emissions with certain
assumptions can lead to type (3):</p>
      <p>K morb  f(xemiss ,x popul ,xtemp ,xra inf all ,xdocs ,xbeds ),
(3)
where xpopul – an indicator characterizing the impact of population size, xtemp –
average air temperature, xrainfall – rainfall amount, xdocs – an indicator characterizing the
influence of doctors’ quantity, xbeds – an indicator characterizing the impact of the
total number of beds in hospital wards.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Analysis of published data and problem definition</title>
      <p>Methods of morbidity prediction are actively developed since the beginning of the
XX century. In recent years, the number of works on this subject is growing rapidly
due to development of information systems and accumulation of large amounts of
statistics available for analysis.</p>
      <p>
        The authors of the robot [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] presented the results of a comparison of long-term data
on air emissions and mortality. In particular, it turned out that the reduction in the
number of diseases of the circulatory system (per 1000 people) is due to a reduction in
emissions from manufacturing enterprises and, in part, from housing and communal
services. To build this model, the authors used dynamic Bayesian networks [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which
ensures that the data correlation structure is taken into account. Bayesian networks
allow estimating the probability of a certain event when observing some sequence of
phenomena. The construction of the CMM is possible with both large and small
amounts of source data, but the algorithms for evaluating the parameters of the model
are difficult to calculate, so the CMM is usually analyzed on the basis of a narrow
sliding observation window. For this reason, Bayesian networks currently provide
only short-term morbidity predictions. Moreover, SMMs are often only used to detect
elevated morbidity.
      </p>
      <p>
        In the work [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] researchers have established a correlation between the number of
completed suicides and the concentrations of suspended substances in the atmosphere,
determined two days before the suicide. For this purpose, they used regression
analysis [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The regression task is to find estimates of unknown parameters and to form a
functional relationship between morbidity and factors that cause it. If the sliding
window width is large enough, mid-term morbidity estimates can also be calculated, but
achieving high quality is problematic.
      </p>
      <p>
        In the works [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7">4–7</xref>
        ] remained unresolved issues related to the fact that the models
are designed to take into account the entire history of morbidity in the analyzed area.
All available data, or at least observations from recent years with similar
characteristics, are used to build them. That is, if the properties of the morbidity process have
changed, it is likely that outdated data will not help to clarify the forecast. To solve
this problem it was accepted to use a neural network of long short-term memory.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>The purpose and objectives of the study</title>
      <p>The object of study is the dependence of the health indicators of pollutants’ amounts.
The purpose of the study is to create a model of health indicators dependency on the
amounts of pollutants.</p>
      <p>The research methods used include traditional models (logistic regression, support
vector method, the least squares method, random forest, nearest neighbor method),
neural networks, combined methods (neural networks and genetic algorithms, neural
networks and multi-agent systems).
5</p>
    </sec>
    <sec id="sec-5">
      <title>Development of modified genetic method based on long short-term memory neural network</title>
      <p>
        For solving this problem it was decided to use the method of artificial neural
networks, namely the use of multilayer perceptron [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. For solving this problem it was
decided to use the method of artificial neural networks, namely the use of multilayer
perceptron [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>The essence of proposed classic method optimization is to add a chromosome with
the same genetic composition as each individual’s karyotype, i.e. use diploid,
consisting of two homologous chromosomes. Both chromosomes go through the same
operators with the same parameters. Thus, the karyotype of crossbred offspring will
also consist of two homologous chromosomes, like its parents. The dominant gene in
the proposed modification is chosen randomly from two allelic genes and is used to
calculate the value of fitness function, that is, speaking in terms of biology,
determines the phenotype of individuals.</p>
      <p>Lets define the individual as ant, where n – the number of the person, t – arbitrary
moment of evolution time. As a vector of control variables take ͞ x =(x1,x2,…,xm) – its
the smallest indivisible unit that describes internal parameters on each t-th step of
finding the optimal solution in a mathematical model (3).</p>
      <p>
        To describe the individuals we introduce two types of variable characteristics that
reflect the qualitative and quantitative differences between individuals according to
their severity. Qualitative characteristics of individuals ant are determined from the
generalized model (3) as s(͞x), where each point ͞x corresponds to ant. As the gene we
take the combination si(αi), which determines the value of fixed control variable xі.
Each individual is characterized by m genes and s(͞x)=(s1,s2,…,sm) can be interpreted
as chromosome containing n interlinked genes that follow each other in strictly
defined sequence. ant chromosome of the individual we will define as xnt [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], i.e.
xt  x(at )  (x (at ), x (at ),..., x (at ))  s(x )  (s , s ,.., sm ).
n n 1 n 2 n m n 1 2
(4)
      </p>
      <p>Quantitative features show variation, and therefore the degree of their severity can
be characterized numerically and calculated by formula below:
(5)
(6)
m
d (xt , xt )   x (at )  x (atj ),</p>
      <p>
        i j n  1 n i n
where ajt, ait – individuals, xjt, xit – genes unequal in importance, m – number of
positions [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        The first step is the initialization of the population. Gene structure of each of the
two homologous ( ) chromosomes of individuals is chosen randomly. To
determine the phenotype of individuals the gene is defined from each allele as a
dominant and will define individuals phenotype, i.e. it will take part in fitness
function evaluation of the individual. The definition of individual phenotype can be
represented by the formula [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]:
      </p>
      <p>m</p>
      <p>F j  i 1rand H j gi ; H'j gi ,
where Fj – phenotype of j-th individual, m – number of alleles in a chromosome pair
and Hjgi – i-th gene in a pair of homologous chromosomes of j-th individual.</p>
      <p>Thus, in fact the arguments of individuals’ fitness function are defined. After
calculating the fitness function and selection of individuals in a population the
crossbreeding is performed. Genotype of a descendant individuals has the same
structure as the parent genotype, i.e. it consists of two homologous chromosomes. The
descendants are subjected to mutations operator. At the same time, any allele can
mutate in pairs of homologous chromosomes, but in each allele only one gene
mutates.</p>
      <p>Further evolution of the population Pt we will represent as generations alternation,
during which individuals change their variable characteristics:
(7)
(8)
(9)
d(a t ,a t ) 
i</p>
      <p>min d(x(a t ),x(alt ))
l  1,m
provided that η(alt)&lt; η(at), where at is the «best» individual in the Pt population, ait –
the individual which is excluded from the Pt population, d(x(at),x(alt)) – a measure of
genotype individuals "closeness".</p>
      <p>Further, as in the classic method, the cycle is repeated until meeting the conditions
for optimization completion.</p>
      <p>Summarizing, we can say that the proposed method differs from the classic genetic
method by using not one chromosome, but a pair of homologous chromosomes, and
also by adding of the definition phase for those genes in alleles which will take part in
determining the value of individual’s fitness function. This modification resuts in
maintaining a fairly high traits variability (genes) in the population (gene pool) during
evolution, which, at the same time may have little effect on the phenotype of
individuals.</p>
      <p>
        Said method modification was used for neural network optimization LSTM [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]:
the number of nodes, optimization function in learning, sub-sample size and the
number of periods of learning.
      </p>
      <p>Another proposed modification of the genetic method modifies mutations operator.
Unlike the classic application of the operator, when all individuals in generation are
subjected to mutations with a certain probability, it is proposed to introduce the
concept of individuals’ mutational persistense, which defined as following
distribution:
сер (t) 
1 m  (at ),
t n  1 n
where a set of m genotypes of all individuals (a1t, a2t,..., amt) which forms a population
Pt and chromosome set (x1t, x2t,...,xmt), which contains complete genetic information
of the whole Pt population.</p>
      <p>
        The procedure for selecting the "best" solution from Pt population takes into
account not only the fitness function Fj value, but also the chromosome structure xit,
so it can be represented as [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]:

x' , P(x' ) 
x1   i i
i
      </p>
      <p> (x' )
 (x' )  (x'' )</p>
      <p>;
xi'', P(x'' )  1  P(x' ),</p>
      <p>
        i
where xi1 – descendant, η(x'), η(x'') – fitness function values, which evaluate parental
encoding x' and x'' respectively [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>The calculated value of individual’s fitness function can be interpreted as a value
of mutational stability of individuals. Thus, it is proposed at each method iteration
after fitness funtion evaluation to rank individuals from obtained generation by
mutational persistense value. Unlike classical operator, at a start the proportion of
individuals who are exposed to the operator is specified instead of mutation
probability (10).
(10)</p>
      <p>
        Kmut  H gen * Rmut ,
where Kmut – the number of individuals exposed to mutation, Hgen – number of
individuals in received generation, Rmut – the proportion of individuals in generation
which are exposed to mutations [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>In fact, it is proposed to apply the operator only to individuals with the lowest
fitness function value. In this case, if the population falls into local extremum the
mutation operator must allow to search the way out without changing the best
received values at the time, but only at the expense of weaker individuals. The
determined proportion of individuals exposed to the operator should be sufficient to
ensure that the potential for further evolution of the entire population exists.</p>
      <p>These mutations should be more "soft" in the sense of conservation of best values
found in previous iterations of the algorithm and in sense of neutralizing the danger of
loosing function extremum when mutations are used, without stopping the search for
new best values.</p>
      <p>The modified genetic method for model parameters optimization based on long
short-term memory neural networks, which demonstrates the morbidity dependence
on emissions, was developed.</p>
      <p>A modification of one of the operators of the genetic method, namely, the mutation
operator, was also proposed. Such operator modification allows to search the optimal
values, excluding the loss of best solutions acquired during the search.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Experiments of initialization methods for initial population in evolutionary algorithm</title>
      <p>
        The statistical information on emissions of pollutants and carbon dioxide into the
atmosphere from stationary sources and information on the morbidity on such
indicators as the number of cases of cardiovascular diseases (registered in outpatient
facilities), the number of new cases of tuberculosis and the number of registered cases of
cancer was used to develop and test the models. Observation period - from 1990 to
2015, broken down by year and region of Ukraine [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>Originally, a simple model was built, which has seven neurons in outermost layer
(by the number of input parameters), one hidden fully connected layer with 12
neurons and output layer with one neuron.</p>
      <p>
        As a network metrics MAE (Mean Absolute Error) was used - an average absolute
error [
        <xref ref-type="bibr" rid="ref13 ref14 ref15 ref16 ref17 ref18 ref19 ref20 ref21 ref22 ref23 ref24 ref25">13-25</xref>
        ].
      </p>
      <p>The results of learning and functioning of created network shown in Figure 1.
In the above graph it’s clearly visible, that there is a gradual error decrease during
network training. Apparently, the training reaches local extremum around 10-15
epoch. Further gradual decrease of network errors may indicate that the minimum is
local. Therefore in this case the further model training is appropriate.</p>
      <p>The learning of a network with two hidden layers was conducted for 100 epochs
(sub-sample size 75) and validation sample split equal to 0.1. The results of network
learning are shown in Figure 2.</p>
      <p>
        In this case, there is a similar pattern to the previous model – a gradual decrease of
the error during network training. At the end of training there is a network
convergence. As in the previous case, for the "number of new TB cases" indicator there is a
local minimum of error. One of the methods of preventing the effect of neural
network overtraining is a method of exclusion (Dropout) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], which is the exclusion of
certain neurons from a network during the learning process. In previously created
model the exclusions were added after the first hidden layer (50% of neurons
excluded). The results of network learning are shown in Figure 3.
      </p>
      <p>
        As in previous cases, during training there is a network convergence, but a little
earlier - at about 60–70 epoch of learning. In all three cases for the indicator "number
of new TB cases" there is a local minimum of network errors, which obviously is a
feature of a model based on multilayer perceptron for this morbidity indicator. In
addition, by using dropout the training curve loses smoothness and becomes jagged
[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>
        The presented data can be viewed as a time series, meaning that the parameter
values are changing over time. For analysis and prediction of time series the models
based on long short-term memory neural networks [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] can be used.
      </p>
      <p>Network with LSTM layer receives eight input parameters. Hidden LSTM layer
consists of twenty neurons and output layer has one neuron. The test results of the
model are shown in Figure 4.</p>
      <p>Figure 4 shows the change in value of network errors during training. For the
indicator "The number of new cases of tuberculosis" and "number of cases of
cardiovascular diseases" the local minimum is achieved with subsequent release of it. At the
end of training there is no further reduction of model error value, so we can assume
that during training the global error minimum was achieved and the network is
considered as trained. Table 1 shows the comparison of resulting values of the average
absolute error (MAE), received during tests of different types of models (logistic
regression, multilayer neural network models and so on.), which were created during
the study. Thus, we can see that the smallest error of all prediction methods used is
given by the model based on short long-term memory artificial neural network.</p>
      <p>During the study the particle swarm optimization was used to optimize long
shortterm memory network.</p>
      <p>As a result of such optimization the following optimal parameters of the network
were obtained:
 the number of network nodes - 1000;
 Optimizer - Adadelta;
 subsample size - 1;
 number of training epochs - 100.</p>
      <p>The long short-term memory network with these parameters using the test sample
has an error value (RMSE) 127,08735307850266.
rey ron eon 2</p>
      <p>8
tila tep en r(1 )son
u rec ith id e r
l</p>
      <p>w hd lay enu
M p</p>
      <p>- h
r g o m
ea ts ie ro l t</p>
      <p>g h
N e N b A ir
reР tre</p>
    </sec>
    <sec id="sec-7">
      <title>Conclusions</title>
      <p>The available official statistical data on emissions of pollutants into the atmosphere
from stationary sources and dynamics of population morbidity, the number of TB
cases, the amount of cardiovascular diseases found in an outpatient setting and cancer
morbidity in different regions of Ukraine was analyzed.</p>
      <p>Methods of constructing mathematical models of the dependencies of these
morbidity indicators on the volume of pollutant emissions were investigated.</p>
      <p>Comparative analysis of the created models has shown that the best results were
achieved in the models based on long short-term memory neural networks (LSTM).</p>
      <p>When creating and training the model based on long short-term memory neural
network the possibility of using particle swarm optimization and genetic algorithm to
optimize network parameters was investigated and developed a modification of the
classical method and modification of mutation operator.</p>
      <p>Two modifications of genetic method were developed: first one using diploid set of
chromosomes and second one with modified mutation operator. The first modification
is the use of not one chromosome in population individuals karyotype, but a pair of
homologous chromosomes, i.e. diploid set of chromosomes. The individual karyotype
is a set of chromosomes, which is specific to certain type of individuals, that is
characterized by a certain number of chromosomes and their structural features. Individual
phenotype is determined by one of the allelic gene selected randomly. Using this
modification allows to support a relatively large variability in population features
during evolution, creating the potential to overcome the likely local extremums.</p>
      <p>It was also developed the modification of mutation operator, which was never used
before. Unlike the classical method, individuals which are exposed to the mutation
operator are selected not randomly, but according to their mutational persistense,
which corresponds to fitness function of individual. Thus the "weaker" individuals
mutate and the genome of "stronger" ones remains unchanged. In this case, the
probability of loosing functions’ extremum (which was achieved during evolution) due to
mutation operator is reduced and the transition to the new extremum is carried out in
case of accumulating sufficient weight of the "best" traits in a population.</p>
      <p>Thus, these results lead to the conclusion that the proposed model based on long
short-term memory neural network and modification of the classical method and
mutation operator is feasible and effective solution to establish mathematical
relationships of health indicators from pollutants. Practical use of the developed methods will
allow timely adjustments of planned medical diagnostic, preventive measures, early
determination of the necessary resources to contain and eliminate diseases to preserve
population health.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wierstra</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gagliolo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez</surname>
            ,
            <given-names>F.:</given-names>
          </string-name>
          <article-title>Training Recurrent Networks by Evolino</article-title>
          .
          <source>Neural computation</source>
          , vol.
          <volume>19</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>757</fpage>
          -
          <lpage>779</lpage>
          (
          <year>2007</year>
          ). doi:
          <volume>10</volume>
          .1162/neco.
          <year>2007</year>
          .
          <volume>19</volume>
          .3.757.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Lugovskaya</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          :
          <article-title>Artificial neural networks in medical diagnostics</article-title>
          .
          <source>Computer systems and networks: proceedings of the 54th scientific conference of postgraduates, undergraduates and students</source>
          <year>2018</year>
          , vol.
          <volume>1</volume>
          , pp.
          <fpage>182</fpage>
          -
          <lpage>183</lpage>
          . BGUIR, Minsk (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Siettos</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Mathematical modeling of infectious disease dynamics</article-title>
          .
          <source>Virulence</source>
          , vol.
          <volume>4</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>295</fpage>
          -
          <lpage>306</lpage>
          (
          <year>2013</year>
          ). DOI:
          <volume>10</volume>
          .4161/viru.24041.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Cantu-Paz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm</article-title>
          .
          <source>Journal of Computer and Communications</source>
          <volume>4</volume>
          (
          <issue>15</issue>
          ), pp.
          <fpage>99</fpage>
          -
          <lpage>110</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Anisur</surname>
            ,
            <given-names>R</given-names>
          </string-name>
          , Zahidul,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>A hybrid clustering technique combining a novel genetic algorithm with K-Means</article-title>
          .
          <article-title>Knowledge-Based Systems</article-title>
          , vol.
          <volume>71</volume>
          , pp.
          <fpage>345</fpage>
          -
          <lpage>365</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Haykin</surname>
            ,
            <given-names>S.: Neural</given-names>
          </string-name>
          <string-name>
            <surname>Networks</surname>
            and
            <given-names>Learning</given-names>
          </string-name>
          <string-name>
            <surname>Machines</surname>
          </string-name>
          . Prentice Hall Internat, Upper Saddle River (
          <year>1999</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Pratyay</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prasanta</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>A novel differential evolution based clustering algorithm for wireless sensor networks</article-title>
          .
          <source>Applied Soft Computing</source>
          , vol.
          <volume>25</volume>
          , pp.
          <fpage>414</fpage>
          -
          <lpage>425</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Shkarupylo</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skrupsky</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kolpakova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Development of stratified approach to software defined networks simulation</article-title>
          .
          <source>EasternEuropean Journal of Enterprise Technologies</source>
          , vol.
          <volume>89</volume>
          , issue 5/9, pp.
          <fpage>67</fpage>
          -
          <lpage>73</lpage>
          (
          <year>2017</year>
          ). Doi:
          <volume>10</volume>
          .15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2017</year>
          .
          <volume>110142</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Fedorchenko</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stepanenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaiko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shylo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svyrydenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Development of the modified methods to train a neural network to solve the task on recognition of road users</article-title>
          .
          <source>EasternEuropean Journal of Enterprise Technologies, issue</source>
          <volume>9</volume>
          /98, pp.
          <fpage>46</fpage>
          -
          <lpage>55</lpage>
          (
          <year>2019</year>
          ). DOI:
          <volume>10</volume>
          .15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2019</year>
          .
          <volume>164789</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Oliinyk</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fedorchenko</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stepanenko</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rud</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goncharenko</surname>
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Evolutionary method for solving the traveling salesman problem</article-title>
          .
          <source>Problems of Infocommunications. Science and Technology: 5th International Scientific-Practical Conference PICST2018, Kharkiv</source>
          ,
          <fpage>9</fpage>
          -
          <issue>12</issue>
          <year>October 2018</year>
          , Kharkiv, Kharkiv National University of Radioelectronics, pp.
          <fpage>331</fpage>
          -
          <lpage>339</lpage>
          (
          <year>2018</year>
          ). Doi:
          <volume>10</volume>
          .1109/INFOCOMMST.
          <year>2018</year>
          .
          <volume>8632033</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Sanches</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Whitley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Improving an exact solver for the traveling salesman problem using partition crossover</article-title>
          .
          <source>In: Proceedings of the Genetic and Evolutionary Computation Conference</source>
          , ACM New York, pp.
          <fpage>337</fpage>
          -
          <lpage>344</lpage>
          (
          <year>2017</year>
          ).
          <source>DOI: 10.1145/3071178</source>
          .3071304.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hussain</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muhammad</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator</article-title>
          .
          <source>Computational Intelligence and Neuroscience</source>
          , vol.
          <year>2017</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          (
          <year>2017</year>
          ). DOI:
          <volume>10</volume>
          .1155/
          <year>2017</year>
          /7430125.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Buse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mutlu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Logarithmic learning for generalized classifier neural network</article-title>
          .
          <source>Neural Networks, issue 12/60</source>
          , pp.
          <fpage>133</fpage>
          -
          <lpage>140</lpage>
          (
          <year>2014</year>
          ). DOI:
          <volume>10</volume>
          .1016/j.neunet.
          <year>2014</year>
          .
          <volume>08</volume>
          .004.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cancelas</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soler-Flores</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>The artificial neural networks to obtain port planning parameters</article-title>
          .
          <source>Procedia-Social and Behavioral Sciences, issue 19/162</source>
          , pp.
          <fpage>168</fpage>
          −
          <lpage>177</lpage>
          (
          <year>2014</year>
          ). DOI:
          <volume>10</volume>
          .1016/j.sbspro.
          <year>2014</year>
          .
          <volume>12</volume>
          .197.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dobbie</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koh</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riddle</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rehman</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Research on Particle Swarm Optimization based clustering: a systematic review of literature and techniques</article-title>
          .
          <source>Swarm and Evolutionary Computation, issue 17/2</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          (
          <year>2014</year>
          ). DOI:
          <volume>10</volume>
          .1016/j.swevo.
          <year>2014</year>
          .
          <volume>02</volume>
          .001.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fedorchenko</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stepanenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rud</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goncharenko</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Combinatorial optimization problems solving based on evolutionary approach</article-title>
          .
          <source>In: 2019 15th International Conference on the Experience of Designing and Application of CAD Systems (CADSM)</source>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>45</lpage>
          (
          <year>2019</year>
          ). DOI:
          <volume>10</volume>
          .1109/CADSM.
          <year>2019</year>
          .
          <volume>8779290</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Fedorchenko</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stepanenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaiko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svyrydenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goncharenko</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Genetic method of image processing for motor vehicle recognition</article-title>
          .
          <source>In: CEUR Workshop Proceedings 2353</source>
          , pp.
          <fpage>211</fpage>
          -
          <lpage>226</lpage>
          (
          <year>2018</year>
          ). ISSN:
          <volume>16130073</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaiko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Training sample reduction based on association rules for neuro-fuzzy networks synthesis</article-title>
          .
          <source>Optical Memory and Neural Networks (Information Optics)</source>
          , vol.
          <volume>23</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>89</fpage>
          -
          <lpage>95</lpage>
          (
          <year>2014</year>
          ). doi:
          <volume>10</volume>
          .3103/S1060992X14020039.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A stochastic approach for association rule extraction</article-title>
          .
          <source>Pattern Recognition and Image Analysis</source>
          , vol.
          <volume>26</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>419</fpage>
          -
          <lpage>426</lpage>
          (
          <year>2016</year>
          ). doi:
          <volume>10</volume>
          .1134/S1054661816020139.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zayko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Synthesis of Neuro-Fuzzy Networks on the Basis of Association Rules</article-title>
          .
          <source>Cybernetics and Systems Analysis</source>
          , vol.
          <volume>50</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>348</fpage>
          -
          <lpage>357</lpage>
          (
          <year>2014</year>
          ).
          <source>DOI: 10.1007/s10559-014-9623-7.</source>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Kolpakova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lovkin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Improved method of group decision making in expert systems based on competitive agents selection</article-title>
          <year>2017</year>
          .
          <source>2017 IEEE 1st Ukraine Conference on Electrical and Computer Engineering</source>
          , UKRCON
          <year>2017</year>
          , pp.
          <fpage>939</fpage>
          -
          <lpage>943</lpage>
          (
          <year>2017</year>
          ). doi:
          <volume>10</volume>
          .1109/UKRCON.
          <year>2017</year>
          .
          <volume>8100388</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Stepanenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deineha</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaiko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Development of the method for decomposition of superpositions of unknown pulsed signals using the second­order adaptive spectral analysis</article-title>
          .
          <source>EasternEuropean Journal of Enterprise Technologies</source>
          , vol.
          <volume>2</volume>
          , no 9, pp.
          <fpage>48</fpage>
          -
          <lpage>54</lpage>
          (
          <year>2018</year>
          ). doi:
          <volume>10</volume>
          .15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2018</year>
          .
          <volume>126578</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>O.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          :
          <article-title>Software-hardware systems: Agent technologies for feature selection</article-title>
          .
          <source>Cybernetics and Systems Analysis</source>
          , vol.
          <volume>48</volume>
          (
          <issue>2</issue>
          ),
          <fpage>257</fpage>
          -
          <lpage>267</lpage>
          (
          <year>2012</year>
          ). doi:
          <volume>10</volume>
          .1007/s10559-012-9405-z.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          :
          <article-title>The decision tree construction based on a stochastic search for the neuro-fuzzy network synthesis</article-title>
          .
          <source>Optical Memory and Neural Networks (Information Optics)</source>
          , vol.
          <volume>24</volume>
          (
          <issue>1</issue>
          ),
          <fpage>18</fpage>
          -
          <lpage>27</lpage>
          (
          <year>2015</year>
          ). doi:
          <volume>10</volume>
          .1007/s10559-012-9405-z.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Oliinyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subbotin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lovkin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leoshchenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaiko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Development of the indicator set of the features informativeness estimation for recognition and diagnostic model synthesis</article-title>
          .
          <source>14th International Conference on Advanced Trends in Radioelectronics</source>
          , Telecommunications and Computer Engineering (TCSET
          <year>2018</year>
          ), pp.
          <fpage>903</fpage>
          -
          <lpage>908</lpage>
          , (
          <year>2018</year>
          ). doi:
          <volume>10</volume>
          .1109/TCSET.
          <year>2018</year>
          .
          <volume>8336342</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>