Professional Documents
Culture Documents
MoPoster2.12
Abstract: Catalytic naphtha reforming is one of the most important processes for high
octane gasoline manufacture and aromatic hydrocarbons production. In this article, a modied
dierential evolution (DE) algorithm is proposed to optimize an actual continuous catalytic
naphtha reforming (CCR) process. The optimization problem considers to minimize the energy
consumption and maximize the aromatics yield. The CCR process model is established by
adopting the 27-lumped kinetics reaction network, and all parameters are adjusted based on the
actual process data. The DE algorithm is modied to maintain the diversity of the population.
In this mechanism, individuals further from the best individual have larger possibilities to
be selected in the mutation operator. The modied DE is evaluated by solving 6 benchmark
functions, and the performance is compared with classic DEs. The results demonstrate that the
modied DE has better global search ability and higher computation eciency. Furthermore, the
optimization results of catalytic naphtha reforming process indicate that the proposed algorithm
has the ability of locating the optimal operating points, in which the aromatics yield is improved,
while energy consumption is reduced. Meanwhile, the optimal operating points and results are
discussed at the end of the article.
Keywords: Catalytic naphtha reforming process, Energy consumption, Dierential evolution,
Global search
1. INTRODUCTION
Dierential evolution (DE) is an ecient optimization algorithm, which oers advantages over traditional populationbased stochastic algorithm in convergence speed and robustness, Das and Suganthan (2011). In decades, amount
of research works on the applications of DE algorithm
in chemical processes have been proposed. Angira and
Santosh (2007) applied trigonometric mutation operation
in the DE algorithm, and the updated algorithm were
utilized to solve seven cases of chemical process optimization problems. Xu et al. (2013) proposed an improved the
DE algorithm based on self-adaptive strategy. Rahimpour
This work is supported by Major State Basic Research Development Program of China (2012CB720500), National Natural Science
Foundation of China (U1162202), and 111 Project (B08021).
Separator
CCR Regenerator
Reactor 4
Reactor 3
Reactor 2
Reactor 1
R ecycle G as
R eform ate
Heater 1
Heater 2
Heater 3
Heater 4
Heat Exchanger
N aphtha Feed
Recycle
Compressor
373
N10+
P10+
P9
TMB
N9
P8
6N8
5N8
P7
5N7
P6
5N6
A10+
MEB
6N6
EB
XY
6N7
PB
A7
A6
P5
P4
P3
P2
P1
(1)
(2)
(3)
(4)
(7)
dR
(LHSV Vc )
(Cp Y )
Where, Y is the vector of the molar ow rates including
27 lumps and hydrogen. LHSV denotes the short of liquid
hourly space velocity.
2.2 Parameter tunning
In order to adjust the process model to reect the actual
the CCR process accurately, 10 sets of actual operating
374
set 1
set 2
set 3
set 4
set 5
set 6
set 7
set 8
set 9
set 10
F
(t/h)
198.33
198.37
198.34
198.38
198.27
198.33
198.30
198.31
198.31
198.30
AP
(%)
42.43
39.98
43.85
41.18
40.85
40.34
40.10
40.08
40.10
40.13
T1
( C)
526.99
527.04
526.99
527.01
526.97
526.99
525.99
526.01
526.00
525.88
T2
( C)
526.81
527.11
527.02
527.00
527.00
527.00
525.97
525.96
525.98
526.14
T1
( C)
524.98
525.08
524.99
524.71
525.00
525.05
524.00
524.04
523.95
523.88
T4
( C)
529.02
528.86
529.03
529.03
528.99
528.99
527.97
527.99
528.05
527.97
p
AY
(M pag)(%)
1.02
64.02
1.02
62.48
1.02
64.27
1.02
63.54
1.02
63.54
1.02
63.21
1.02
63.92
1.02
62.75
1.02
62.50
1.02
61.69
68
Adjusted Model
66
Original Model
64
In the CCR process, aromatic yields are important assessment standard of the production quality. Meanwhile,
in order to form more C8 aromatic, the yield of heavy
aromatic should be limited. Considering the fact that the
price of energy is rising and low-carbon is a world-wide
issue. In this article, energy consumption is also taken into
consideration.
As mentioned above, this work considers three optimization factors, which are maximizing aromatic yields, minimizing heavy aromatic yields, and minimizing energy consumption. Due to the fact that the heat duty from heaters
is the uppermost energy consumption in the CCR process.
In this work, energy consumption is expressed as the red
duty of the four heaters.
The function of optimization problem could be formulated
as follow
max f (x) = 1 AY + 2 HAY 3 Q
(8)
62
60
58
56
61
61.5
62
62.5
63
63.5
64
64.5
65
65.5
66
actual
5.09%
1.42%
3.12%
1.66%
8.07%
20.25%
5.37%
7.88%
11.78%
5.61%
20.50%
predict
5.36%
0.00%
1.88%
0.66%
7.11%
20.31%
5.39%
7.35%
11.70%
5.47%
20.72%
dif f erence
0.27%
1.42%
1.23%
0.99%
0.04%
0.06%
0.02%
0.53%
0.08%
0.14%
0.22%
375
Set 4
Set 4
Set 1
x2
x2
prob4
Set 3
Set 1prob
Set 3
prob3
prob2
Set 2
-5
-5
-4
-3
-2
-1
Set 2
4
-5
-5
-4
-3
-2
-1
x1
Fig. 4. The illustration of population distance
Where uti,j indicates j-th element of i-th new trial vector
at generation t.
Finally, ospring can be generated in the use of selection
operation which is presented as follows
{ t
ui , if (f (uti ) 6 f (xti ))
t+1
(14)
xi =
xti , otherwise
3.2 Modied DE based on population distance
Due to the advantage of high convergence and robustness,
the DE algorithm is widely used in solving optimization
problems. In decades, a number of modied strategies have
been proposed to develop the performance of DE, some of
which are of high eectivity, such as Fan and Lampinen
(2003), Brest et al. (2006), Rahnamayan et al. (2008), and
Qin et al. (2009). However, most of these researches mainly
focused on the discovery of novel mutation strategies or
the setting of operating parameters, such as F and CR
mentioned above. The importance of population structure
at each generation is always being neglected.
Fig.4 shows a case that the DE algorithm solves a multimodal optimization problem with 2-dimensional variables
at a certain generation. It can be observed that individuals
in current population are mainly divided into 4 sets
naturally. In fact, each set surrounds a local optimal. It
can be found that most individuals located in set 1, and
this set also contains the best vector. However, the global
optimum is near set 4.
In this phenomenon, there is high probability that all
xtri would be chosen in set 2. According to the mutation
strategy 12 listed above, if xtri are similar with each other,
the trial vector could not be much dierent from the
current individuals. That might lead to the deciencies
of population diversity and too much repetitive counting.
For the reason that calculating the CCR process model is
time consuming, duplicated calculation is unacceptable in
the process optimization.
In order to solve this problem, a modied DE algorithm
based on distance information (DisDE) is proposed in this
work. In this method, individuals at each generation are
distributed into Sn sets by the Euclidean distance from
individuals to the current best vector. Sn is the number
of sets. The equation of counting the Euclidean distance
is presented as follow
x1
Fig. 5. The illustration of the main idea of the DisDE
algorithm
v
u
u n
2
t
di = t
(15)
(xti,best xti,j )
j=1
dti
Where
denotes the distance from i-th vector to the
current best vector at generation t. n is dimensionality of
variables. According to the distance value of each vector,
population could be divided into Sn sets by cluster algorithm, where Sn is an operating parameter predetermined.
Thus, the mean distance of each set could be calculated as
dtset
k
dtsetk =
(16)
Nsetk
Where probtset indicates the number of vectors that belong
to set k, k = 1, ..., Sn . In the use of mean distance value,
selection probability could be obtained as
dt
(17)
probtsetk = N setk
t
dseti
i=1
376
Start
F1 (x)
F2 (x)
F3 (x)
Obtain selection
probability by population
distance information
No
Rand>Md
F4 (x)
Yes
F5 (x)
Mutation operator
F6 (x)
min
mean
std
min
mean
std
min
mean
std
min
mean
std
min
mean
prob
min
mean
prob
DisDE
7.25E 18
1.19E 17
1.90E 18
2.79E-09
4.98E-08
6.60E-08
4.85E 05
1.30E 04
1.75E 04
3.14E-01
3.86E-01
7.17E-02
0
200
0.8
0
200
0.73
DE
2.53E 15
2.28E 14
1.71E 14
2.35E 07
7.78E 07
4.33E 07
7.49E 05
2.03E 04
1.71E 04
2.58E + 01
3.84E + 01
2.64E + 01
0
300
0.63
0
300
0.27
T DE
1.88E-22
5.64E-21
1.23E-20
3.76E 08
2.10E 07
2.83E 07
1.15E-07
4.72E-07
5.36E-06
1.30E + 00
6.24E + 00
2.69E + 00
0
300
0.5
200
300
0.10
Termination
conditions
Yes
End
D
30
30
S
[100, 100]D
[100, 100]D
fmin
0
0
30
[100, 100]D
30
[100, 100]D
[5, 5]
[5, 5]D
A8
1683
0.52
A9
1270
0.58
A10
1222
0.42
Tol
1389
0.37
Selection operator
No
Ben
1548
0.11
377
525.882
526.137
523.877
527.967
1.020
3.07
61.68
20.63
3.16E + 08
optimal
198.333
42.425
522.307
522.586
525.368
533.07
0.962
2.78
64.02
17.60
3.09E + 08
eect
3.575
3.551
1.491
5.103
0.058
0.29
2.34
3.03
7.00E + 06
REFERENCES
Angira, R. and Santosh, A. (2007). Optimization of
dynamic systems: A trigonometric dierential evolution
approach. Computers & Chemical Engineering, 31(9),
10551063.
378