Please use this identifier to cite or link to this item:
|Title:||Multi-objective optimization of the operation of an industrial low-density polyethylene tubular reactor using genetic algorithm and its jumping gene adaptations||Authors:||Agrawal, N.
|Issue Date:||26-Apr-2006||Citation:||Agrawal, N., Rangaiah, G.P., Ray, A.K., Gupta, S.K. (2006-04-26). Multi-objective optimization of the operation of an industrial low-density polyethylene tubular reactor using genetic algorithm and its jumping gene adaptations. Industrial and Engineering Chemistry Research 45 (9) : 3182-3199. ScholarBank@NUS Repository. https://doi.org/10.1021/ie050977i||Abstract:||In this study, a comprehensive model for an industrial low-density polyethylene (LDPE) tubular reactor is presented. The model parameters are tuned using industrial data on the temperature profile, the monomer conversion and the number-average molecular weight at the end of the reactor, and estimates of the several side products from the reactor. Complete details of the model are provided. Thereafter, a two-objective optimization of this LDPE reactor is performed; the monomer conversion is maximized while the sum of the normalized concentrations of the three important side products (methyl, vinyl, and vinylidene groups) is minimized. Three variants of the binary-coded non-dominated sorting genetic algorithm - namely, NSGA-II, NSGA-II-JG, and NSGA-II-aJG - are used to solve the optimization problem. The decision variables used for optimization include the following: the feed flow rates of the three initiators and of the transfer agent, the inlet temperature, the inlet pressure, and the average temperatures of the fluids in the five jackets. Also, the temperature of the reaction mass is constrained to lie below a safe value. An equality constraint is used for the number-average molecular weight (M n,f) of the product, to ensure product quality. Pareto-optimal solutions are obtained. It is observed that the algorithms converge to erroneous local optimal solutions when hard equality constraints such as Mn,f = desired number-average molecular weight (Mn,d) are used. Correct global optimal Pareto sets are obtained by assembling appropriate solutions from several problems involving softer constraints of the type Mn,f = Mn,d ± an arbitrary number. Furthermore, the binary-coded NSGA-II-aJG and NSGA-II-JG perform better than NSGA-II near the hard end-point constraints. The solution of a four-objective problem (with each of the three normalized side product concentrations taken individually as objective functions) is comparable to that of the two-objective problem, and the former (more) computationally intensive problem does not need to be solved. © 2006 American Chemical Society.||Source Title:||Industrial and Engineering Chemistry Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/89534||ISSN:||08885885||DOI:||10.1021/ie050977i|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.