Evolutionary multiobjective optimization with clustering-based self-adaptive mating restriction strategy

被引:10
作者
Li, Xin [1 ]
Song, Shenmin [1 ]
Zhang, Hu [2 ]
机构
[1] Harbin Inst Technol, Ctr Control Theory & Guidance Technol, Harbin 150001, Heilongjiang, Peoples R China
[2] Beijing Electromech Engn Inst, Beijing 100074, Peoples R China
基金
中国国家自然科学基金;
关键词
Multiobjective optimization; Evolutionary algorithm; K-means algorithm; Mating restriction; NONDOMINATED SORTING APPROACH; GENETIC ALGORITHM; MOEA/D; DECOMPOSITION; SELECTION; PROTOCOL;
D O I
10.1007/s00500-017-2990-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Mating restriction plays a key role in MOEAs, while clustering is an effective method to discover the similarities between individuals and therefore can assist the mating restriction. What is more, it is inappropriate to set the same mating restriction strategy for all individuals as solutions are very different between clusters. This paper proposes a multiobjective evolutionary algorithm with clustering-based self-adaptive mating restriction strategy (SRMMEA). In SRMMEA, k-means algorithm is used to cluster the population. With a certain probability, mating parents are selected from the clusters or the whole population for exploitation and exploration, respectively. To better balance the exploration and exploitation, different mating restriction probabilities are assigned to solutions in different clusters. Moreover, the mating restriction probability is updated at each generation according to the number of newly generated individuals in each cluster. SRMMEA is compared with some state-of-the-art multiobjective evolutionary methods on a number of test instances. Experimental results demonstrate SRMMEA's superiority over other comparison algorithms.
引用
收藏
页码:3303 / 3325
页数:23
相关论文
共 52 条
[1]   A cellular multi-objective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs [J].
Alba, E. ;
Dorronsoro, B. ;
Luna, F. ;
Nebro, A. J. ;
Bouvry, P. ;
Hogie, L. .
COMPUTER COMMUNICATIONS, 2007, 30 (04) :685-697
[2]  
An S., 2015, IEEE T MAGN, V52, P1
[3]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[4]   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
[5]   A Dynamic Multiobjective Evolutionary Algorithm for Multicast Routing Problem [J].
Bueno, Marcos L. P. ;
Oliveira, Gina M. B. .
2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, :841-846
[6]  
Chen SW, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P1397, DOI 10.1109/CEC.2014.6900400
[7]  
Chiang TC, 2011, IEEE C EVOL COMPUTAT, P1473
[8]   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
[9]  
Deb K., 2001, MULTIOBJECTIVE OPTIM, DOI [10.1002/9780470496947, DOI 10.1002/9780470496947]
[10]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601