General framework for localised multi-objective evolutionary algorithms

被引:40
作者
Wang, Rui [1 ,2 ]
Fleming, Peter J. [1 ]
Purshouse, Robin C. [1 ]
机构
[1] Univ Sheffield, Dept Automat Control & Syst Engn, Sheffield S1 3JD, S Yorkshire, England
[2] Natl Univ Def Technol, Coll Informat Syst & Management, Dept Syst Engn, Changsha 410073, Hunan, Peoples R China
基金
美国国家科学基金会; 英国工程与自然科学研究理事会;
关键词
Multi-objective optimisation; Evolutionary algorithm; Framework; Clustering; MANY-OBJECTIVE OPTIMIZATION; SEARCH; PARETO; SELECTION; PERFORMANCE; BALANCE;
D O I
10.1016/j.ins.2013.08.049
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many real-world problems have multiple competing objectives and can often be formulated as multi-objective optimisation problems. Multi-objective evolutionary algorithms (MOEAs) have proven very effective in obtaining a set of trade-off solutions for such problems. This research seeks to improve both the accuracy and the diversity of these solutions through the local application of evolutionary operators to selected sub-populations. A local operation-based implementation framework is presented in which a population is partitioned, using hierarchical clustering, into a pre-defined number of sub-populations. Environment-selection and genetic-variation are then applied to each sub-population. The effectiveness of this approach is demonstrated on 2- and 4-objective benchmark problems. The performance of each of four best-in-class MOEAs is compared with their modified local operation-based versions derived from this framework. In each case the introduction of the local operation-based approach improves performance. Further, it is shown that the combined use of local environment-selection and local genetic-variation is better than the application of either local environment-selection or local genetic-variation alone. Preliminary results indicate that the selection of a suitable number of sub-populations is related to problem dimension as well as to population size. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:29 / 53
页数:25
相关论文
共 67 条
[1]  
[Anonymous], 2007, EVOLUTIONARY ALGORIT
[2]  
[Anonymous], 2002, P GEN COMP C
[3]  
[Anonymous], EVOLUTIONARY MULTICR
[4]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[5]  
Batista LS, 2011, LECT NOTES COMPUT SC, V6576, P76, DOI 10.1007/978-3-642-19893-9_6
[6]   SMS-EMOA: Multiobjective selection based on dominated hypervolume [J].
Beume, Nicola ;
Naujoks, Boris ;
Emmerich, Michael .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) :1653-1669
[7]   On the Complexity of Computing the Hypervolume Indicator [J].
Beume, Nicola ;
Fonseca, Carlos M. ;
Lopez-Ibanez, Manuel ;
Paquete, Luis ;
Vahrenhold, Jan .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (05) :1075-1082
[8]   Comparisons among clustering techniques for electricity customer classification [J].
Chicco, G ;
Napoli, R ;
Piglione, F .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2006, 21 (02) :933-940
[9]  
Coello C.A.C., 2007, EVOLUTIONARY ALGORIT, P131
[10]   Evolutionary multi-objective optimization: A historical view of the field [J].
Coello Coello, Carlos A. .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (01) :28-36