Published in

Elsevier, Computers and Chemical Engineering, 2-3(25), p. 391-407

DOI: 10.1016/s0098-1354(00)00665-7

Links

Tools

Export citation

Search in Google Scholar

Multiobjective optimization of an industrial wiped film poly(ethylene terephthalate) reactor: some further insights

Journal article published in 2001 by V. Bhaskar, Santosh K. Gupta, Ajay K. Ray ORCID
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Multiobjective optimization of an industrial third-stage, wiped-film poly(ethylene terephthalate) reactor is carried out, using a pre-validated model. The two objective functions minimized are the acid and vinyl end group concentrations in the product. These are two of the undesirable side products produced in the reactor. The optimization problem incorporates an end-point constraint to produce polymer having a desired value of the degree of polymerization (DP). In addition, the concentration of the di-ethylene glycol end group in the product is constrained to lie within a certain range of values. The possible decision variables for the problem are the reactor pressure, temperature, catalyst concentration, residence time of the reaction mass in the reactor and the speed of rotation of the agitator. The nondominated sorting genetic algorithm (NSGA) is used to solve this multiobjective optimization problem. It is found that this algorithm is unable to converge to the correct solution(s) when two or more decision variables are used, and we need to run the code several times over (with different values of the computational variable, Sr, the seed for generating the random numbers) to obtain the solutions. In fact, this is an excellent test problem for future multiobjective optimization algorithms. It is found that when temperature is kept constant, Pareto optimal solutions are obtained, while, when the temperature is included as a decision variable, a global unique optimal point is obtained.