Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Multiple Populations for Multiple Objectives: A Coevolutionary Technique for Solving Multiobjective Optimization Problems

Authors
Zhan, Zhi-HuiLi, JingjingCao, JiannongZhang, JunChung, Henry Shu-HungShi, Yu-Hui
Issue Date
Apr-2013
Publisher
IEEE Advancing Technology for Humanity
Keywords
Coevolutionary algorithms; multiobjective optimization problems (MOPs); multiple populations for multiple objectives (MPMO); particle swarm optimization (PSO)
Citation
IEEE Transactions on Cybernetics, v.43, no.2, pp 445 - 463
Pages
19
Indexed
SCI
SCIE
SCOPUS
Journal Title
IEEE Transactions on Cybernetics
Volume
43
Number
2
Start Page
445
End Page
463
URI
https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115860
DOI
10.1109/TSMCB.2012.2209115
ISSN
2168-2267
2168-2275
Abstract
Traditional multiobjective evolutionary algorithms (MOEAs) consider multiple objectives as a whole when solving multiobjective optimization problems (MOPs). However, this consideration may cause difficulty to assign fitness to individuals because different objectives often conflict with each other. In order to avoid this difficulty, this paper proposes a novel coevolutionary technique named multiple populations for multiple objectives (MPMO) when developing MOEAs. The novelty of MPMO is that it provides a simple and straightforward way to solve MOPs by letting each population correspond with only one objective. This way, the fitness assignment problem can be addressed because the individuals' fitness in each population can be assigned by the corresponding objective. MPMO is a general technique that each population can use existing optimization algorithms. In this paper, particle swarm optimization (PSO) is adopted for each population, and coevolutionary multiswarm PSO (CMPSO) is developed based on the MPMO technique. Furthermore, CMPSO is novel and effective by using an external shared archive for different populations to exchange search information and by using two novel designs to enhance the performance. One design is to modify the velocity update equation to use the search information found by different populations to approximate the whole Pareto front (PF) fast. The other design is to use an elitist learning strategy for the archive update to bring in diversity to avoid local PFs. CMPSO is comprehensively tested on different sets of benchmark problems with different characteristics and is compared with some state-of-the-art algorithms. The results show that CMPSO has superior performance in solving these different sets of MOPs.
Files in This Item
Go to Link
Appears in
Collections
COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher ZHANG, Jun photo

ZHANG, Jun
ERICA 공학대학 (SCHOOL OF ELECTRICAL ENGINEERING)
Read more

Altmetrics

Total Views & Downloads

BROWSE