title: PSO-based multiobjective optimization with dynamic population size and adaptive local archives.
abstract: Recently, various multiobjective particle swarm optimization (MOPSO) algorithms have been developed to efficiently and effectively solve multiobjective optimization problems. However, the existing MOPSO designs generally adopt a notion to "estimate" a fixed population size sufficiently to explore the search space without incurring excessive computational complexity. To address the issue, this paper proposes the integration of a dynamic population strategy within the multiple-swarm MOPSO. The proposed algorithm is named dynamic population multiple-swarm MOPSO. An additional feature, adaptive local archives, is designed to improve the diversity within each swarm. Performance metrics and benchmark test functions are used to examine the performance of the proposed algorithm compared with that of five selected MOPSOs and two selected multiobjective evolutionary algorithms. In addition, the computational cost of the proposed algorithm is quantified and compared with that of the selected MOPSOs. The proposed algorithm shows competitive results with improved diversity and convergence and demands less computational cost.
authors.affiliation: School of Electrical and Computer Engineering,Oklahoma State University, Stillwater, OK 74078-5032, USA. wenf.leong@okstate.edu
authors.forename: Wen-Fung
authors.initials: WF
authors.lastname: Leong
authors.forename: Gary G
authors.initials: GG
authors.lastname: Yen
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D032701:Biomimetics / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D011156:Population Density; D012919:Social Behavior