Multi-objective particle swarm optimization control technology and its application in batch processes

Authors:
Li Jia;Dashuai Cheng;Luming Cao;Zongjun Cai;Min-Sen Chiu
Affiliations:
Shanghai Key Laboratory of Power Station Automation Technology, Department of Automation, College of Mechatronics Engineering and Automation, Shanghai University, Shanghai, China;Shanghai Key Laboratory of Power Station Automation Technology, Department of Automation, College of Mechatronics Engineering and Automation, Shanghai University, Shanghai, China;Shanghai Key Laboratory of Power Station Automation Technology, Department of Automation, College of Mechatronics Engineering and Automation, Shanghai University, Shanghai, China;Shanghai Key Laboratory of Power Station Automation Technology, Department of Automation, College of Mechatronics Engineering and Automation, Shanghai University, Shanghai, China;Faculty of Engineering, National University of Singapore, Singapore
Venue:
LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part I
Year:
2010

Citing 4
Cited 0

Particle swarm optimization method in multiobjective problems

Proceedings of the 2002 ACM symposium on Applied computing
Multiobjective optimization using dynamic neighborhood particle swarm optimization

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Using unconstrained elite archives for multiobjective optimization

IEEE Transactions on Evolutionary Computation
U-measure: a quality measure for multiobjective programming

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, considering the multi-objective problems in batch processes, an improved multi-objective particle swarm optimization based on pareto-optimal solutions is proposed. In this method, a novel diversity preservation strategy that combines the information on distance and angle into similarity judgment is employed to select global best and thus guarantees the convergence and the diversity characteristics of the pareto front. As a result, enough pareto solutions are distributed evenly in the pareto front. Lastly, the algorithm is applied to a classical batch process. 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 algorithm.