<!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>Optimization of conditions of a heterogeneous catalytic reaction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>S N Koledin</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>K F Koledina</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>I M Gubaydullin</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>A F Mullayanova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Petrochemistry and Catalysis, Russian Academy of Sciences</institution>
          ,
          <addr-line>Ufa, Bashkortostan, Russia, 450075</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Ufa State Petroleum Technological University</institution>
          ,
          <addr-line>Ufa, Bashkortostan, Russia, 450062</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>24</fpage>
      <lpage>30</lpage>
      <abstract>
        <p>A kinetic model of the heterogeneous catalytic reaction of ethanol dehydrogenation to ethyl acetate is considered. The kinetic model is used to solve the problem of optimization of the reaction conditions taking into account the reactant adsorption and desorption on the solid catalyst.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        2. Kinetics of ethanol dehydrogenation to ethyl acetate
A kinetic study of ethanol dehydrogenation to ethyl acetate has been reported in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The reaction
scheme indicating the key reversible steps is presented (Table 1). The kinetic and adsorption
parameters have been determined.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Scheme of chemical transformations</title>
      <p>C2H5OH (X1)↔ CH3CHO (X2) + H2 (X3)
C2H5OH (X1) + CH3CHO (X2)↔ CH3COOC2H5 (X4) + +H2
(X3)</p>
    </sec>
    <sec id="sec-3">
      <title>Kinetic equations</title>
      <p>w(1)  k(1)* (1)  k(3)* (2)* (3)
w(2)  k(2) * (1) * (2)  k(4) * (4) * (3)
 (i) 
b(i) *
x(i)
V</p>
      <p>
        ,
4 x(i)
1  b(i) *
i1 V
where b(i) is the adsorption coefficient of i-th component according to the mathematical model based
on the Langmuir-Hinshelwood mechanism for adsorption of reaction components on a solid catalyst,
x(i) is the concentration of i-th component, [mol/L], V is the gas-phase volume of the reaction
mixture, [m3], which is determined from the geometric dimensions of the reactor [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        The activation parameters for the rate constants and adsorption coefficients have been determined
earlier [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        The developed kinetic model of the complex catalytic reaction can be used to optimize the reaction
conditions [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref7 ref8 ref9">7-13</xref>
        ].
3. Variable parameters and objective functions for optimization of conditions of the catalytic
heterogeneous reaction of ethanol dehydrogenation to ethyl acetate
The variable parameters of optimization as appliedto problems of chemical kinetics may include the
temperature, type of the catalyst, concentration of the catalyst, pressure and so on. The experimental
studies of this reaction were carried out at different temperatures and pressures. These parameters
affect the volume of the reaction mixture. For the reaction in question, we take temperature and
pressure as the variable parameters. The physico-chemical constraints have been reported previously
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <sec id="sec-3-1">
        <title>In the general form, the optimization criterion based on the kinetic model has the form [14]</title>
        <p>R(x, x0 , t*, η, ,T , P)  max , (3)
where x is the concentration vector of compounds, mol/L; x0 is the vector of the initial concentrations
of compounds, mol/L; η is the vector of compound weights; μ are additional expenses; t* is reaction
time, min; T is temperature, °C, P is pressure, atm.</p>
        <p>
          The conditions of ethanol dehydrogenation to ethyl acetate were optimized according to relation (3)
considering the following criteria reported previously [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <sec id="sec-3-1-1">
          <title>1) Yield of the target product x prod , which depends on the temperature and pressure:</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>The target product of the reaction is ethyl acetate (X4).</title>
        <sec id="sec-3-2-1">
          <title>2) Yield of the by-product xby prod , which depends on the temperature and pressure:</title>
          <p>R1 (T , P)  x prod (T , P)  max.
R2 (T , P)  xby prod (T , P)  min.</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>The by-product of the reaction is acetaldehyde (X2).</title>
        <p>(2)
(4)
(5)
4. Parallelization of the computational process
Mathematical modeling of complex chemical reactions faces the following difficulties:
– there are several hypothetical reaction mechanisms and each of them should be addressed to
choose the best one;</p>
        <p>– several experiments carried out under different conditions are available (usually more than five);
considering the existing experimental error, all of them should be addressedand the best two (or three)
should be chosen, that is, those for which the calculated values coincide most closely with the
experimental data;</p>
        <p>– each of the kinetic parameters is determined ambiguously, being dependent on the correct choice
of the initial approximation proceeding from some physicochemical assumptions.</p>
        <p>
          The successive solution of these problems requires a lot of time (from several months to a year). It
is proposed to arrange the problems in groups and carry out computations for these groups in parallel,
with the computation within each group being carried out sequentially (Fig. 1) [
          <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
          ].
        </p>
        <p>The first group combines all of the mechanisms proposed for the given reaction (Stage 1). For each
mechanism, all available experiments for this reaction are considered (Stage 2). For each experiment,
the parametric plane is split to search for kinetic parameters (Stage 3).</p>
      </sec>
      <sec id="sec-3-4">
        <title>Stage 1</title>
      </sec>
      <sec id="sec-3-5">
        <title>Stage 2</title>
      </sec>
      <sec id="sec-3-6">
        <title>Stage 3</title>
      </sec>
      <sec id="sec-3-7">
        <title>Mechanisms of reaction</title>
      </sec>
      <sec id="sec-3-8">
        <title>Experiments for reaction</title>
      </sec>
      <sec id="sec-3-9">
        <title>Geometric parallelism of kinetic</title>
        <p>parameters</p>
        <p>
          For large dimensions of the definition domain, population-based algorithms for solving the
optimization problem are used. Parallelization models are employed for these algorithms [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. The use
of the genetic algorithm for solving the optimization problem implies the use of the following
parallelization models:
        </p>
      </sec>
      <sec id="sec-3-10">
        <title>1) Island Model</title>
        <p>A multi-population is created as several subpopulations (islands), the number of which is equal to
|P| |P|
the number of processors used S  Si ; |S|  |S|i (where S is multi-population, Si are subpopulations
i1 i1
(islands), |P| is the number of processors) (Fig. 2). Each island is treated by a separate processor.
During a specified period of time, the subpopulations develop independently and, after that, the islands
are synchronized using a special process, in which data exchange takes place.</p>
        <p>S
1
S
5</p>
        <p>S
2
S</p>
        <p>S
4 3</p>
        <p>Figure 2. Island model of parallelization of population-based algorithms.</p>
      </sec>
      <sec id="sec-3-11">
        <title>2) Cellular Model</title>
        <p>The area is split into parts according to the number of processors. The left-hand side is connected to
the right-hand side and the upper side is connected to the lower side, thus forming a torus (Fig. 3).
Each process can interact only with four neighbors (above, below, on the left, and on the right). Each
cell contains only one solution (individual). Each process will choose the best individual among the
neighbors, cross it over with the individual from its own cell, and place one offspring into its cell
instead of the parent. The operation of this algorithm brings about effects resembling those in the
island model. Initially, all individuals have random fitness (in Fig. 3, it is defined by colors). After
several generations, relatively small regions of similar-fitness individuals are formed. As the algorithm
operates, these regions grow and compete with one another.</p>
      </sec>
      <sec id="sec-3-12">
        <title>3) Global Worker/Farmer model</title>
        <p>Master
selection individuals into</p>
        <p>new generation</p>
        <p>Worker 1
reproduction, mutation,
calculation fitness function</p>
        <p>Worker N
reproduction, mutation,
calculation fitness function
"Workers" (workstations) are responsible for reproduction, mutation, and calculation of the fitness
function for selecting individuals to the new generation. All individuals created and evaluated by the
"workers" are delivered to the "farmer" workstation, which then selects the individuals to the new
population in conformity with fitness evaluation. The selected individuals are transferred by the
"farmer" to the "workers" stations (Fig. 4).</p>
        <p>
          The reaction conditions were optimized using the genetic algorithm to solve the optimization
problem and the island model to parallelize the computational process [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
        </p>
        <p>The input processor receives a local range of variable parameters. The output processor givesout
the optimal values for the variable parameters out of the indicated range. The values from this range
are selected and used to solve the direct problem, that is, to solve a system of ordinary non-linear
differential equations for determination of the objective functions. The optimal variable parameters for
the given processor local range are found (Fig. 5).</p>
        <p>The optimized pressure and temperature for ethanol dehydrogenation to ethyl acetate were
determined using the island model of parallelization. The time of the computational experiment was
estimated (Fig. 6) (the calculations were carried out on a Intel Core I5 7th Gen quad-core PC).</p>
        <p>The efficiency of utilizationof processors by the parallel algorithm for problem solution is defined
by the relation</p>
        <p>Ep </p>
        <p>S p ,
p
1 2 3 4</p>
        <p>Number of processors
Figure 6. Time of the computational experiment with the genetic algorithm for different numbers
of processors.</p>
        <p>Actual</p>
        <p>Theoretical</p>
        <p>i.е., it is the mean fraction of algorithm execution time during which the processors are actually
occupied by solution of the problem (Fig. 7).</p>
        <p>1
2
3</p>
        <p>4</p>
        <p>Number of processors</p>
        <p>
          The parallelization efficiency for the considered reactions was 65%. Apparently, the ideal
efficiency of parallelization is not achieved because of the time spent for data synchronization between
the islands.
5. Multiobjective optimization of the conditions of a catalytic heterogeneous reaction
The major challenge in solving an optimization problem in chemistry is that all the theoretical works
on optimization have addressed each criterion separately. However, in the last decades, numerous
efficient evolutionary algorithms of multiobjective optimization have been proposed. These algorithms
take into account all scientific experience in the approximation of the Pareto domination region and
genetic algorithms. The computational power has markedly increased, which allows high-throughput
computing to be accomplished over reasonable periods of time [
          <xref ref-type="bibr" rid="ref20 ref21 ref22 ref23 ref24 ref25 ref26 ref27">20-27</xref>
          ]. The multiobjective
optimization involves the search for several Pareto-optimal solutions. The set of optimal values of
variable parameters is the Pareto set. The objective functions in this set are called the Pareto front. The
algorithm used most often to solve the multiobjective optimization problem is the NSGA-II algorithm
[
          <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
          ]. According to this algorithm, the generated individuals are ranked, each one being assigned
with a particular rank. The non-dominated points have the first rank, the points that are dominated
only by first-rank points have the second rank, and so on. The crowding of the obtained individuals is
also evaluated; the greater the distance between them, the higher the population diversity. In every
iteration, the offsprings are selectedconsidering the rank and crowding (proximity) of individuals.
Subsequently, the best points are chosen in the iteration via crossing over and mutation, which ensures
the diversity of the next population. The parents and offsprings are combined into one population
corresponding to the best solutions, and so on.
        </p>
        <p>
          The problem was solved in the information system developed previously [
          <xref ref-type="bibr" rid="ref28 ref29 ref30 ref31">28-31</xref>
          ]. The optimization
criteria include the yield of the target product and the yield of the by-product. The results of
computational experiments are shown in Figs. 8-9.
        </p>
        <p>0,48
0,46
l
y
h
(te 0,44
5
CH2 lo0,42
COO3 ,tt)eam00,,3480
CH cea0,36
f
lod 0,34
e
iY 0,32</p>
        <p>0,30
400
350
300
,ºC250
T
200
150
100
5
0,000
0,005
0,010
0,015
0,020</p>
        <p>0,025</p>
        <p>Yield of CH3CHO (acetaldehyde), mmol</p>
        <p>The resulting Pareto front and set approximations for ethanol dehydrogenation to ethylacetate allow
the decision maker to choose the reaction conditions through the comparison of the Pareto set and
front approximations for the corresponding objective functions (4) and (5) (Fig. 8, 9). Whenever it is
necessary to maximize the yield of the target product (the target product is highly valuable) or
minimize the yield of the by-product, the corresponding approximated values of the Pareto set and
front can be used.</p>
        <p>Thus, the optimal conditions for the complex heterogeneous catalytic reaction were studied by
multiobjective optimization methods on the basis of a kinetic model of the reaction.
Acknowledgments
The reported study was funded by RFBR according to the research projects № 18-07-00341,
18-3700015 and by the President of the Russian Federation SP-669.2018.5 stipends.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Slinko</surname>
            <given-names>M</given-names>
          </string-name>
          <source>2007 Theoretical Foundations of Chemical Technology</source>
          <volume>41</volume>
          (
          <issue>1</issue>
          )
          <fpage>16</fpage>
          -
          <lpage>34</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Froment</surname>
            <given-names>G</given-names>
          </string-name>
          <source>2005 Catal Rev Sci Eng</source>
          <volume>47</volume>
          (
          <issue>1</issue>
          )
          <fpage>83</fpage>
          -
          <lpage>124</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Inui</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rurabayashi Tand Sato S 2002 J Catal</surname>
          </string-name>
          <article-title>212(2) 125</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Bolder</surname>
            <given-names>F</given-names>
          </string-name>
          <source>2008 Ind Eng Chem Res</source>
          <volume>47</volume>
          (
          <issue>19</issue>
          )
          <fpage>4796</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Elliott</surname>
            <given-names>D</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pennella F 1989 J Catal</surname>
          </string-name>
          <article-title>119 359</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Men'Shchikov</surname>
            <given-names>V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gol'Dshtein L and Semenov</surname>
            <given-names>I 2014 Kinetics</given-names>
          </string-name>
          <source>and Catalysis</source>
          <volume>55</volume>
          (
          <issue>1</issue>
          )
          <fpage>12</fpage>
          -
          <lpage>17</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Spivak</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledin</surname>
            <given-names>S</given-names>
          </string-name>
          <source>and Gubaidullin I 2017 Journal of Applied Informatics</source>
          <volume>12</volume>
          (
          <issue>1</issue>
          )
          <fpage>39</fpage>
          -
          <lpage>49</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledin</surname>
            <given-names>S</given-names>
          </string-name>
          <source>and Gubaydullin I 2017 CEUR Workshop Proceedings</source>
          <volume>1966</volume>
          <fpage>5</fpage>
          -
          <lpage>9</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Gubaydullin</surname>
            <given-names>I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Sayfullina L 2014 Eng</surname>
            <given-names>J</given-names>
          </string-name>
          18(
          <issue>1</issue>
          )
          <fpage>13</fpage>
          -
          <lpage>24</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Nurislamova</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gubaydullin Iand Koledina K 2015 Reac Kinet</surname>
          </string-name>
          Mech Cat
          <volume>116</volume>
          (
          <issue>1</issue>
          )
          <fpage>79</fpage>
          -
          <lpage>93</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Nurislamova</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gubaydullin</surname>
            <given-names>I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Safin R 2016 Reac Kinet</surname>
          </string-name>
          Mech Cat
          <volume>117</volume>
          (
          <issue>1</issue>
          )
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Maskov</surname>
            <given-names>D</given-names>
          </string-name>
          <source>and Gubaidullin I 2012 Bulletin of Omsk University</source>
          <volume>64</volume>
          (
          <issue>2</issue>
          )
          <fpage>182</fpage>
          -
          <lpage>184</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Keil</surname>
            <given-names>F</given-names>
          </string-name>
          <source>2013 Computers &amp; Mathematics with Applications</source>
          <volume>65</volume>
          (
          <issue>10</issue>
          )
          <fpage>1674</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledin</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shchadneva</surname>
            <given-names>N</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gubaidullin I 2017 Rus J Phys Chem</surname>
            <given-names>A</given-names>
          </string-name>
          91(
          <issue>3</issue>
          )
          <fpage>444</fpage>
          -
          <lpage>449</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledin</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schadneva</surname>
            <given-names>N</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mayakova</surname>
            <given-names>Y</given-names>
          </string-name>
          <source>and Gubaydullin I 2017 Reac Kinet Mech Cat</source>
          <volume>121</volume>
          (
          <issue>2</issue>
          )
          <fpage>425</fpage>
          -
          <lpage>428</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Gubaydullin</surname>
            <given-names>I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lind</surname>
            <given-names>Yu</given-names>
          </string-name>
          and
          <string-name>
            <surname>Koledina K 2012 Num Methods</surname>
            <given-names>Prog</given-names>
          </string-name>
          :
          <source>Adv Comput</source>
          <volume>13</volume>
          (
          <issue>1</issue>
          )
          <fpage>236</fpage>
          -
          <lpage>244</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Baynazarova</surname>
            <given-names>N</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          <source>and Pichugina D 2016 CEUR Workshop Proceedings</source>
          <volume>1576</volume>
          <fpage>425</fpage>
          -
          <lpage>431</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Awrejcewicz</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lind</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gubaydullin</surname>
            <given-names>I</given-names>
          </string-name>
          and
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          <source>2012 Theoretical and Applied Mechanics Letters</source>
          <volume>2</volume>
          (
          <issue>4</issue>
          )
          <fpage>043</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Koledina</given-names>
            <surname>Kand Gubaidullin I 2013</surname>
          </string-name>
          <article-title>Science and Education: a scientific edition of the MSTU</article-title>
          <source>N E Bauman</source>
          <volume>7</volume>
          <fpage>385</fpage>
          -
          <lpage>398</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Karpenko</surname>
            <given-names>A</given-names>
          </string-name>
          <source>2016 Information and Mathematical Technologies in Science and Management</source>
          <volume>2</volume>
          <fpage>8</fpage>
          -
          <lpage>17</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Sobol</surname>
            <given-names>I</given-names>
          </string-name>
          and
          <string-name>
            <surname>Statnikov</surname>
            <given-names>R 2006</given-names>
          </string-name>
          <article-title>The Choice of Optimal Parameters in Problems With Many Criteria: Textbook</article-title>
          . Manual for Universities (Moscow: Drofa) p
          <fpage>175</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Deb</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohan</surname>
            <given-names>M</given-names>
          </string-name>
          and
          <string-name>
            <surname>Mishra S 2003 Evolutionary Multi-Criterion Optimization</surname>
          </string-name>
          2632
          <fpage>222</fpage>
          -
          <lpage>236</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Kalyanmoy</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pratap</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agarwal</surname>
            <given-names>S</given-names>
          </string-name>
          and
          <string-name>
            <surname>Meyarivan</surname>
            <given-names>T 2002</given-names>
          </string-name>
          <source>IEEE Transactions on Evolutionary Computation</source>
          <volume>6</volume>
          (
          <issue>2</issue>
          )
          <fpage>182</fpage>
          -
          <lpage>197</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Abramson</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Charles</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dennis</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Digabel</surname>
            <given-names>J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Digabel</surname>
            <given-names>S 2009</given-names>
          </string-name>
          <source>SIAM Journal on Optimization</source>
          <volume>20</volume>
          (
          <issue>2</issue>
          )
          <fpage>948</fpage>
          -
          <lpage>966</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Alonso</surname>
            <given-names>P</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Argüeso</surname>
            <given-names>F</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cortina</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranilla</surname>
            <given-names>J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Vidal</surname>
            <given-names>A</given-names>
          </string-name>
          2013
          <source>J Math Chem</source>
          <volume>51</volume>
          (
          <issue>4</issue>
          )
          <fpage>1153</fpage>
          -
          <lpage>1163</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Alonso</surname>
            <given-names>P</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Argüeso</surname>
            <given-names>F</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cortina</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranilla</surname>
            <given-names>J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Vidal</surname>
            <given-names>A</given-names>
          </string-name>
          2012
          <source>J Math Chem</source>
          <volume>50</volume>
          (
          <issue>2</issue>
          )
          <fpage>410</fpage>
          -
          <lpage>420</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Canedo</surname>
            <given-names>M</given-names>
          </string-name>
          and
          <string-name>
            <surname>González-Hernández</surname>
            <given-names>J</given-names>
          </string-name>
          2011
          <source>J Math Chem</source>
          <volume>49</volume>
          (
          <issue>1</issue>
          )
          <fpage>163</fpage>
          -
          <lpage>184</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Vovdenko</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gubaidulin</surname>
            <given-names>I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          <source>and Koledin S 2017 CEUR Workshop Proceedings</source>
          <volume>1966</volume>
          <fpage>20</fpage>
          -
          <lpage>23</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gubaidullin I 2016 Rus J Phys Chem</surname>
            <given-names>A</given-names>
          </string-name>
          90(
          <issue>5</issue>
          )
          <fpage>914</fpage>
          -
          <lpage>921</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Zainullin</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Akhmetov</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Gubaidullin</surname>
            <given-names>I 2017 Kinetics</given-names>
          </string-name>
          <source>and Catalysis</source>
          <volume>58</volume>
          (
          <issue>3</issue>
          )
          <fpage>279</fpage>
          -
          <lpage>289</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Koledin</surname>
            <given-names>S</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koledina</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gubaidullin</surname>
            <given-names>I</given-names>
          </string-name>
          and
          <string-name>
            <surname>Spivak S 2016 Chemical Industry</surname>
          </string-name>
          today
          <volume>10</volume>
          <fpage>24</fpage>
          -
          <lpage>35</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>