Please use this identifier to cite or link to this item:
|Title:||Pareto-optimal solutions based multi-objective particle swarm optimization control for batch processes||Authors:||Jia, L.
Particle swarm optimization
|Issue Date:||Sep-2012||Citation:||Jia, L., Cheng, D., Chiu, M.-S. (2012-09). Pareto-optimal solutions based multi-objective particle swarm optimization control for batch processes. Neural Computing and Applications 21 (6) : 1107-1116. ScholarBank@NUS Repository. https://doi.org/10.1007/s00521-011-0659-6||Abstract:||In order to maximize the amount of the final product while reducing the amount of the by-product in batch process, an improved multi-objective particle swarm optimization based on Pareto-optimal solutions is proposed in this paper. A novel diversity preservation strategy that combines the information of distance and angle into similarity judgment is employed to select global best and thus the convergence and diversity of the Pareto front is guaranteed. As a result, enough Pareto solutions are distributed evenly in the Pareto front. To test the effectiveness of the proposed algorithm, some benchmark functions are used and a comparison with its conventional counterparts is made. Furthermore, the algorithm is applied to two classical batch processes. The results show that the quality at the end of each batch can approximate the desire value sufficiently and the input trajectory converges, thus verify the efficiency and practicability of the proposed algorithm. © 2011 Springer-Verlag London Limited.||Source Title:||Neural Computing and Applications||URI:||http://scholarbank.nus.edu.sg/handle/10635/89721||ISSN:||09410643||DOI:||10.1007/s00521-011-0659-6|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 19, 2019
WEB OF SCIENCETM
checked on Mar 26, 2019
checked on Apr 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.