A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization

被引:444
作者
Goh, Chi-Keong [1 ]
Tan, Kay Chen [2 ]
机构
[1] Agcy Sci Technol & Res, Data Storage Inst, Singapore 117608, Singapore
[2] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117576, Singapore
关键词
Coevolution; dynamic multiobjective optimization; evolutionary algorithms; EVOLUTIONARY ALGORITHMS; ENVIRONMENTS; EXPLORATION; ADAPTATION;
D O I
10.1109/TEVC.2008.920671
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In addition to the need for satisfying several competing objectives, many real-world applications are also dynamic and require the optimization algorithm to track the changing optimum over time. This paper proposes a new coevolutionary paradigm that hybridizes competitive and cooperative mechanisms observed in nature to solve multiobjective optimization problems and to track the Pareto front in a dynamic environment. The main idea of competitive-cooperative coevolution is to allow the decomposition process of the optimization problem to adapt and emerge rather than being hand designed and fixed at the start of the evolutionary optimization process. In particular, each species subpopulation will compete to represent a particular subcomponent of the multiobjective problem, while the eventual winners will cooperate to evolve for better solutions. Through such an iterative process of competition and cooperation, the various subcomponents are optimized by different species subpopulations based on the optimization requirements of that particular time instant, enabling the coevolutionary algorithm to handle both the static and dynamic multiobjective problems. The effectiveness of the competitive-cooperation coevolutionary algorithm (COEA) in static environments is validated against various multiobjective evolutionary algorithms upon different benchmark problems characterized by various difficulties in local optimality, discontinuity, nonconvexity, and high-dimensionality. In addition, extensive studies are also conducted to examine the capability of dynamic COEA (dCOEA) in tracking the Pareto front as it changes with time in dynamic environments.
引用
收藏
页码:103 / 127
页数:25
相关论文
共 70 条
[1]  
ANGELINE PJ, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P264
[2]  
[Anonymous], 1997, THESIS GEORGE MASON
[3]  
[Anonymous], 1992, PARALLEL PROBLEM SOL
[4]  
[Anonymous], P 37 AIAA ASME ASCE
[5]  
[Anonymous], TIK REP
[6]  
Barbosa H.J. C., 2001, Proc. Annual Conference on Genetic and Evolutionary Computation, P203
[7]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[8]  
Branke J., 2001, EVOLUTIONARY OPTIMIZ
[9]  
Branke Jurgen., 2002, Theory and Application of Evolutionary Computation: Recent Trends, P239
[10]  
Cobb HelenG., 1990, INVESTIGATION USE HY