A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design

被引:180
作者
Goh, C. K. [2 ]
Tan, K. C. [1 ]
Liu, D. S. [1 ]
Chiam, S. C. [1 ]
机构
[1] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117576, Singapore
[2] Rolls Royce Singapore Pte Ltd, Adv Technol Ctr, Singapore 639798, Singapore
关键词
Multi-objective optimization; Particle swarm optimization; Competitive-cooperative co-evolution;
D O I
10.1016/j.ejor.2009.05.005
中图分类号
C93 [管理学];
学科分类号
120117 [社会管理工程];
摘要
Multi-objective particle swarm optimization (MOPSO) is an optimization technique inspired by bird flocking, which has been steadily gaining attention from the research community because of its high convergence speed. On the other hand, in the face of increasing complexity and dimensionality of today's application coupled with its tendency of premature convergence due to the high convergence speeds, there is a need to improve the efficiency and effectiveness of MOPSO. In this paper a competitive and cooperative co-evolutionary approach is adapted for multi-objective particle swarm optimization algorithm design, which appears to have considerable potential for solving complex optimization problems by explicitly modeling the co-evolution of competing and cooperating species. The competitive and cooperative co-evolution model helps to produce the reasonable problem decompositions by exploiting any correlation, interdependency between components of the problem. The proposed competitive and cooperative co-evolutionary multi-objective particle swarm optimization algorithm (CCPSO) is validated through comparisons with existing state-of-the-art multi-objective algorithms using established benchmarks and metrics. Simulation results demonstrated that CCPSO shows competitive, if not better, performance as compared to the other algorithms. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:42 / 54
页数:13
相关论文
共 36 条
[1]
[Anonymous], P 37 AIAA ASME ASCE
[2]
[Anonymous], 103 GLOR
[3]
Handling multiple objectives with particle swarm optimization [J].
Coello, CAC ;
Pulido, GT ;
Lechuga, MS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :256-279
[4]
A coevolutionary multi-objective evolutionary algorithm [J].
Coello, CAC ;
Sierra, MR .
CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, :482-489
[5]
A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[6]
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems [J].
Deb, Kalyanmoy .
EVOLUTIONARY COMPUTATION, 1999, 7 (03) :205-230
[7]
Using unconstrained elite archives for multiobjective optimization [J].
Fieldsend, JE ;
Everson, RM ;
Singh, S .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (03) :305-323
[8]
An investigation on noisy environments in evolutionary multiobjective optimization [J].
Goh, C. K. ;
Tan, K. C. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2007, 11 (03) :354-381
[9]
A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization [J].
Goh, Chi-Keong ;
Tan, Kay Chen .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (01) :103-127
[10]
Hughes EJ, 2005, IEEE C EVOL COMPUTAT, P222