๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Comprehensive learning particle swarm optimizer for solving multiobjective optimization problems

โœ Scribed by V.L. Huang; P.N. Suganthan; J.J. Liang


Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
263 KB
Volume
21
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

โœฆ Synopsis


This article presents an approach to integrate a Pareto dominance concept into a comprehensive learning particle swarm optimizer ~CLPSO! to handle multiple objective optimization problems. The multiobjective comprehensive learning particle swarm optimizer ~MOCLPSO! also integrates an external archive technique. Simulation results ~obtained using the codes made available on the Web at http://www.ntu.edu.sg/home/EPNSugan! on six test problems show that the proposed MOCLPSO, for most problems, is able to find a much better spread of solutions and faster convergence to the true Pareto-optimal front compared to two other multiobjective optimization evolutionary algorithms.


๐Ÿ“œ SIMILAR VOLUMES


Co-evolutionary particle swarm optimizat
โœ Xiaoli Kou; Sanyang Liu; Jianke Zhang; Wei Zheng ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 504 KB

This paper presents a co-evolutionary particle swarm optimization (CPSO) algorithm to solve global nonlinear optimization problems. A new co-evolutionary PSO (CPSO) is constructed. In the algorithm, a deterministic selection strategy is proposed to ensure the diversity of population. Meanwhile, base