Please use this identifier to cite or link to this item:
|Title:||Multi-objective optimization of venturi scrubbers using a three-dimensional model for collection efficiency||Authors:||Ravi, G.
|Issue Date:||Feb-2003||Citation:||Ravi, G., Viswanathan, S., Gupta, S.K., Ray, M.B. (2003-02). Multi-objective optimization of venturi scrubbers using a three-dimensional model for collection efficiency. Journal of Chemical Technology and Biotechnology 78 (2-3) : 308-313. ScholarBank@NUS Repository.||Abstract:||Multi-objective optimization of a venturi scrubber was carried out using a three-dimensional model for collection efficiency and non-dominated sorting genetic algorithm (NSGA). Two objective functions, namely (a) maximization of the overall collection efficiency, and (b) minimization of the pressure drop were used in this study. Three decision variables including two operating parameters, viz liquid-gas ratio and gas velocity in the throat, and the nozzle configuration, which takes into account the three-dimensional nature of the problem, were used in the optimization. Optimal design curves (non-dominated Pareto sets) and the values of the decision variables corresponding to optimum conditions on the Pareto set for a pilot-scale scrubber were obtained. The liquid to gas (L/G) ratio, which is a key decision variable that determines the uniformity of liquid distribution, and staggered nozzle configuration can produce uniform liquid distribution in the scrubber. Multiple penetration using nozzles of two different sizes in a triangular staggered arrangement can reduce liquid loading by as much as 50%, consequently reducing the pressure drop in the scrubber. © 2003 Society of Chemical Industry.||Source Title:||Journal of Chemical Technology and Biotechnology||URI:||http://scholarbank.nus.edu.sg/handle/10635/75202||ISSN:||02682575|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 27, 2018
WEB OF SCIENCETM
checked on Dec 31, 2018
checked on Jun 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.