Escolar Documentos
Profissional Documentos
Cultura Documentos
645-661, 1983
PROCESS OPTIMIZATION:
A COMPARATIVE CASE STUDY
LORENZ T. BIEGLERt and RICHARD R. HUGHES*
Chemical Engineering Department and Engineering Experiment Station, University of WisconsinMadison, Madison, Wl 53706, U.S.A.
(Received 1 February 1982)
Abstract--Four recently developed algorithms were tested on a realistic propylene chlorination process simulation. All four are based on successive quadratic programming and
interface easily with most sequential modular simulation packages. Using SPAD for simulation, optimal cases were obtained in as few as 29 simulation-time equivalents. The paper
includes model details, reactor kinetics, and algorithm performance.
Scope Our previous papers [1-3] describe four algorithms developed for efficient optimization
of sequential-modular simulation models. Each algorithm was tested extensively on a simple
flash process to determine optimal tuning parameters and to study algorithmic performance.
All four algorithms are" based on the Successive Quadratic Programming (SQP) algorithm
of Powell[4] and use a BFGS update to develop the quadratic matrix. The methods differ in
the strategies used for the three basic steps: function evaluation, gradient evaluation, and
formulation of the quadratic program.
The first algorithm, Quadratic/Linear Approximation Programming (Q/LAP)[1] requires
a converged process flowsheet for each function evaluation. Gradients are calculated by
construction of linear models for each flowsheet module. These are then assembled into a large
sparse linear system which is perturbed in lieu of the actual process model, to obtain the
gradient in decision-variable space. This gradient is the basis for the next quadratic program.
Infeasible Path Optimization of Sequential Modular Simulations (IPOSEQ)[2] converges
and optimizes simultaneously. Function evaluations and gradient evaluations are performed
by simple (non-iterative) passes through the calculation sequence. Tear equations (the
difference between guessed and calculated stream elements) are linearized and included as
equality constraints in the quadratic program. The dimensionality of the gradient and the
quadratic program is increased to include the decision variables and the tear (guessed recycle
stream) variables. Implementation is very simple; for most modular simulators, IPOSEQ
merely requires the substitution of an optimization "block" for the recycle convergence
algorithm.
The last two algorithms[3] are feasible variants of IPOSEQ. The Complete Feasible
Variant (CFV) and Reduced Feasible Variant (RFV) algorithms use the same gradient
calculation strategies as IPOSEQ, but require converged flowsheets for each function
evaluation. CFV, like IPOSEQ, includes tear equations in the quadratic program while RFV
calculates reduced gradients and solves the smaller quadratic program that Q/LAP uses.
Convergence is accelerated because the quadratic programming solution yields good starting
values for the tear variables, either directly (in CFV) or through the reduced gradients (in
RFV).
Here, we present a comparative study of these four algorithms on a realistic problem--the
design of a process for direct chlorination of propylene. The simulator used was again
SPAD [5], as installed on the Univac 1100/82 at the University of Wisconsin. Special modules
were added to handle the reaction kinetics and the HCI scrubber.
Conclusions and significance--The nine-variable model was successfully optimized by each of
the four algorithms. From a starting point design which showed a net value added of
1010.13 $/hr, the following results were obtained:
Algorithm
STE
Optimum ($/hr)
RFV
CFV
IPOSEQ
Q/LAP
28.83
28.74
45.29
61.18
1609.97
1609.92
1609.84
1600.55
646
(STE or Simulation Time Equivalents is the ratio of the CPU time for optimization to that
for simulation.)
Comparison of the optimal points shows that there is an optimal "ridge" along the lower
reaction temperature bound, in the space of the other three variables which influence the
reactor kinetics.
The results suggest that, if numerical perturbation must be used for gradient calculation,
then the feasible variant algorithms, CFV and RFV, are the best SQP methods for
optimization of sequential-modular models.
PROCESS EXAMPLE
The process chosen for this comparative study is the
synthesis of allyl chloride, a valuable intermediate in
the manufacture of epoxy resins and glycerine[6].
The flowsheet adopted (Fig. 1) is an elaboration of
the example described by Hughes[7]. It uses the
reaction scheme and separation sequence from published process descriptions[6,8], with an added
quench loop to reduce carbon deposition in the
reactor effluent transfer line and cooler. The plant
scale is set by using a fresh propylene feed rate of
100 lb-mole/hr. This results in an allyl chloride production of about 34 million lbs/yr at a stream factor
of 95%.
This process, modeled on a sequential modular
simulator, requires the ordering and solution of
thousands of unit operations, physical property, and
mass and energy balance relationships. The optimization of such a system can clearly be termed a
large-scale optimization problem.
Vent
O-[]
NaOHHz
SO~r I ~" I
Propylene 171o
J__I J ll n"
Water80
Feed
60
PREHEATER
674o
Chlorine
80
COOLERr~O-I~ I=
[]
"
2:30
800 661 ~ , .
l
20~
aq.HCI(32%w)
L
Feed
@..L
~-~
Ally,Chloride
N
/ ~
116
Direct Chlorination of
Propylene
- Decision Variables
~'-~- Constraints
[~o - psia'~ Conditions
F J at RFV
Optimum
~Chlorides_> 99mol %}
es
I10
Fig. 1. Process flowsheet.
'
$6
647
l, SF
$5
- Pint
S
bber,
,;r i
IIScr~
=
ns-
II or
tit
- Streom ident.
S5
$7
('~
o,.
(~
i
,Cnvrgel
steep
L__....,
$2
S 15
SI6
CH2--CHCH 3
CH2=CHCHI + HCI
kl
k 2 ~ Cl2
CH2CHCICH2CI
ka~X~+ C12
CHCI--CHCH2CI + HCI.
(2)
(4)
(5)
where
648
HC~
4.
5.
6.
C385C~
C3H6C~2
C3H4C 2
Substitution
(j=l)
Addition
(j=2)
Sec'y. Subst.
(if3)
+1
-1
-1
+1
0
-1
-1
0
1
-1
0
-1
+1
0
-I
+1
vij
C2
C3H6
0
0
Heats of Reaction
-AHj (BTU/Ib-mol)
4,800
79,200
91,800
Kinetic Coefficients
f 1b-tool" ]
AJlkr
3_a-Sj j
Bj(*R)
Rate Constants,
~(Ib-mol/~rat
..7
206,000
4 . 6 x 108
13,600
3,430
0.55
4.23
0.46
0.77
18.55
1.12
21,300
ft3-atm 2)
600*F
800*F
IO00*F
0.86
20.95
212.24
Conversion to SI Units:
K =
(*R)/1.8
J/mole = 2.326
i=1,6.
(6)
j = 1,3 (7)
where
ET = ~ ei = FT-- x~
(8)
(BTU/lb-mol)
Px = P F F r / E T
v),P~(e,
x,
Xg(F:
X, -
X~ -
X~)/E~
(10)
X 2 = (kJkOX ~
(11)
k3X,(e, + X,)
)(3 = k3Xl + k l ( F 3 - X~ -- )(2)"
(12)
0.1
0.1
0.3
0.7
To optimize a process design, the preferred objective is usually the venture profit or venture worth.
However, for this process, the product and feed
values are high and the plant is fairly simple and
relatively inexpensive. Thus the objective function
can be approximated as the net value added, i.e. the
sales return less the feed costs. This is fortunate, since
SPAD has only limited capabilities for estimating
capital and utility costs.
649
650
Net Value
Added
Compound
As Quoted
$/ib-mol
HC
$ 3 5 / t o n (36 B~ )
0.96
C2
$145/ton
5.15
C3H6
21 / i b
8.84
A l l y l c h l o r i d e (AC)
46 e / l b
Dlchloropropane (DCP) I
Dichloropropene (DCPffi)~
$/ib-mo]
Note**
35.20
22.17
1.35/gal if
126.47
12.48
~ 50% unsaturated
{22.13
4.91
OPTIMIZATION PERFORMANCE
:>
,~ ~ ~
r,,.
a~
r.,-.
.1~
651
,,,11
r.~
,.,,'~ o c~
=":
,.9.
,";~
,-,I
o
o
irl
,-.I
0
4-
,<:
c:;
o
oo
s-I
d~
,,,4
M
("1
.iJ
r.;3
c:;
o~.
.~
ch.
r..
O~
o~
~1
0
~o
~
oo ,~
~
o
o
Q
o.
~ .
, . ,
o~
f~
I~
f~
o"
~:
o
~
,I
,I
,I
14"o
I
I
(~i
O01
(~
r~
0
o~
o~
o
a)
o.
o.
[..,
~ o ~
o ~
"o
=
o
,o
~J
3
652
L o a ~ z T. BmOLm~ and R i ~
"!.
0
o~
.
~C )
0
I!
:I
R. H~omss
(vl
r~
0r ' )
-.1"
~1
I
I
I
'
~
0
I
m
kl
~1~~
GO
~')
I
C*)
rj
~j
O~
" ~ d ~
('4
-=r
14
,-i . o
o~
0
4
1"4
P~
0
0
oo
I~
o
",4
m
,,-4
0
o)
OJ
0
0
0
.L:
.,-4
"4
fJ
~ ~
I
m
",,'4
m
.O
"X
653
Separator
No. of trays -actual
-theoretical
Reflux ratio (L/D)
Diameter, ft
Max sup. gas tel. -ft/see
At gas density
-ib/ft 3
Pressure, psia
-top
-bott
Temp, F
-top
-bott
Finishing Column
14
i0
14
i0
.037
6.0
2.38
0.21
20
25
-51.7
36.3
.406
2.0
2.81
0.19
14.7
19.7
114.0
109.9
Heater
Rx Freheater
S.C. Reboiler
F.C. Reboiler
19,365
135.1
674.1
2,904
36.3
36.3
1,108
109.9
109.9
Duty, HBTU/hr
Proe. strm-*F -in
-out
Coolers
Quench
Duty, MBTU/hr
Proc. strm-*F -in
-out
126
38
20
Effl. Cooler
32,951
661
50
S . C . Condenser
1,014
-51.7
-72.0
F.C. Condenser
265
114.0
109.2
Rotating ~[aehines
Compressor
Pressure, psfa
Temp, *F
-in
-out
-in
-out
Inlet flow
Inlet density-lb/ft 3
Brake Horsepower
18
88.8
44.2
171. 2
4743 CFM
0.1497
1335
quench Pump
27
100
36.3
38.2
39.6 GPH
65.49
5.2
654
$) NOI.LONn_-I 3 A I 1 3 3 P S O
(J4 /
0
~n
in
in
o0
~.
QI
0
u.
U
0
,=,,
h
n,,
*
0
~O
L~
37VOS
0
0
0
0
0
0
(Jq/
--I0
0
0
$ )
NOIJ.ONN~
39NVHO
0
0
0
0
N
3AID3PSO
0
0
0
0
655
'2.
o
co
,,,,.t
~
O~,
i~1
"
,...
I~ ~
0
o
O~
..;
,4
~o
a,,
qo
~lp
-m
:,
0
m
0
+1
+1
+<1
m ~,
o
~D
m"
~,,
~D
,-4
o;
,4
,.-i
O
~-
O
-4
,4
,4
+o
656
7V1701S3bl
_o
NOIJ.Vf'ID3 b l V 3
~iOl~lVl~
T
0
I
o
0
if)
r.~
0
0
0
8
Z
o
i-n~
hi
0
o
o
Cu
,4
0
0
0
0
0
0
0
Jq/$
0
0
(Jq/$]
0
0
NOllONn_-I
3AIIO3PSO
0
0
~,
657
~0
*.0
q
O~
,,.,=~~ v
~.
o,
o,
O~
O~
O~
~u
"
.,~
,-~
,4
r-~
0
i..4
0
-4
0
-4
0
N
o
o
r-I
.o
r-I
0
~=3
,-4
0
0
r~
o
O
r~
m
u
C~
o
o
-t
o
co
,,-I
~v
Z
I
',~ 0
~"
o
p~
r~
,-4
~4
,.4
~4
,-4
iooo
,.~
,~
0
00
0
0
cO
658
~.~I
~. ~. ~.
~. ~. ~.
0
o
o
o
c0
I
0
0
0
0
0
0
0
0
0
c;
o
o
0
o
0
o
0
0
o
o
0
t-4
~J
_u
["~X ~" I
,~
0o
0
0o
~
oo
~
~.
659
~3
o
t-~
o0
co
.,~
O
i-I
,.4
Go
~o
o
co
O
o
o;
o~
o;
o;
co
,-4
,-4
t~
gl
14 0
CACK 7:5-G
P-4
660
CFV and RFV, required less than 29 STE's (Simulation Time Equivalents) for a complete optimization. IPOSEQ, the infeasible path algorithm,
required 45.3 STE's because it used more iterations
and gradient calculations.
The performance of the Q/LAP algorithm is somewhat disappointing; it required more CPU time than
the others and terminated prematurely. The excessive
CPU time can be explained by the bookkeeping
required in the modeling and condensation steps and
the large number of flowsheet evaluations per line
search. The latter problem, as well as the line search
failure, are due to errors in the gradients from the
modeling step. Combination of linear approximations for a sequence of highly nonlinear modules
may result in a poor approximation of the combined
result. Also, the error introduced by convergence
calculations makes the choice of an appropriate
perturbation factor difficult.
Consider the initial, unscaled objective function
derivatives compared in Table 11. Here, a perturbation factor of l0 -2 and convergence tolerance
of l0 3 is used to calculate the Q/LAP and RFV
gradients. (By definition, the reduced gradient for
Best Point
Iterations
Total STE's*
Q/LAP
1600.55
313.200
10
61.18
IPOSEQ
1609.84
231.816
39
45.29
RFV
1609.97
147.605
12
28.83
CFV
1609.92
147.118
20
28.74
it
Variable
1 ~
q/LAP
-27.99
2 T
-0.4323
-0.432
3 V
2.350
2.356
-.06539
-.06395
-.1272
-.08191
P
S
q
V
7 P
-10731.9
-2524.8
-8207.46
0.4737
LK
-1885.69
511.05
fHK
-1944.27
972.47
Aj
Bj
Ei
Er
Ep
Fi
Fr
fLx
fnK
NOMENCLATURE
premultiplier for rate constant kj; lb-mol/(hr-ft3-atm2)
Arrhenius temperature factor for rate constant, kj, R
flow of component i in reactor effluent, lb-mol/hr
total flow of reactor effluent, lb-mol/hr
flow of reactant in reactor effluent, lb-mol/hr
j = 1,2 - reactant is propylene q
= 3 - reactant is allyl chloride]
flow of component i in combined reactor feed, lbmol/hr
total flow of combined reactor feed, lb-mol/hr
fractional recovery of light key (C12) to sepn. column
tops
fractional recovery of heavy key (AC) in sepn. column
bottoms
fq
f~,
j*
kj
Pc
P~
P~
P~
P~
Pcl2
pj,
rj
Tp
T~
V~
Xj
6
e
r/
v~
tk
661
1. L. T. Biegler & R. R. Hughes, Approximation programming of chemical processes with Q/LAP. Chem.
Engng Prog. 76-83 (Apr. 1981).
2. L. T. Biegler & R. R. Hughes, Infeasible path optimization with sequential modular simulators. Comput.
Engng (in press).
3. L. T. Biegler & R. R. Hughes, Feasible path optimization with sequential modular simulators." Comput.
Engng (in press).
4. M. J. D. Powell, A fast algorithm for nonlinearly
constrained optimization calculations. Presented at
1977 Dundee Conf. on Numerical Analysis (1977).
5, R. R. Hughes, R. K. Malik & L. T. Biegler, SPAD--simulator for Process Analysis and Design. Engng Expt.
Sta. Rep. No. 52. University of Wisconsin-Madison
(1981).
6. A. V. Hahn, The Petrochemical Industry. McGraw-Hill,
New York (1970).
7. R. R. Hughes, Optimization methods for block simulation. Proc. VI lnteramerican Cong. of Chem. Engng,
Caracas, Venezuela (1975).
8. A. W. Fairbairn, H. A. Cheney, & A. J. Cherniavsky,
Commercial scale manufacture of allyl chloride and
allyl alcohol from propylene. Chem. Engng Prog. 43(b),
280 (June, 1947).
9. J. M. Smith, Chemical Engineering Kinetics, 2nd Edn,
pp. 212-231. McGraw-Hill, New York (1970).
10. H. P. Groll & G. Hearne, Halogenation of hydrocarbons. Ind, Engng Chem. 31(12), 1530 (1939).
11. H. F. Rase, Chemical Reactor Designfor Process Plants.
Vol. I, pp. 464-471. Wiley, New York (1977).
12. C. F. Oldershaw, L. Simenson, T. Brown & F. Radcliffe,
Absorption and purification of hydrogen chloride from
chlorinated hydrocarbons. Chem. Engng Prog. 43(7),
371 (1947).