Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Optimization of a large scale industrial reactor by genetic algorithms|
|Abstract:||The present work aims to employ genetic algorithms (GAs) to optimize an industrial chemical process, characterized by being difficult to be optimized by conventional methods. The considered chemical process is the three phase catalytic slurry reactor in which the reaction of the hydrogenation of o-cresol producing 2-methyl- cyclohexanol occurs. In order to describe the dynamic behavior of the multivariable process, a non-linear mathematical model is used. Due to the high dimensionality and non-linearity of the model, a rigorous one. the solution of the optimization problem through conventional algorithms does not always lead to convergence. This fact justifies the use of an evolutionary method, based on the GAs, to deal with this process. In this way, in order to optimize the process, the GA code is coupled with the rigorous model of the reactor. The aim of the optimization through GAs is the searching of the process inputs that maximizes the productivity of 2-methyl- cyclohexanol subject to the environmental constraint of conversion. Many simulations are conducted in order to find the maximization of the objective function without violating the constraint. The results show that the GAs are used successfully in the process optimization. The selection of the most important GA parameters making use of a factorial design approach by fractional factorial design is proposed. A factorial design approach by a central composite design is also proposed in order to determine the best values of the GA parameters that lead to the optimal solution of the optimization problem. (C) 2007 Elsevier Ltd. All rights reserved.|
|Editor:||Pergamon-elsevier Science Ltd|
|Citation:||Chemical Engineering Science. Pergamon-elsevier Science Ltd, v. 63, n. 2, n. 330, n. 341, 2008.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.