Stochastic Ranking Algorithm for Many-Objective Optimization Based on Multiple Indicators

被引:198
作者
Li, Bingdong [1 ]
Tang, Ke [1 ]
Li, Jinlong [1 ]
Yao, Xin [1 ,2 ]
机构
[1] USTC, Sch Comp Sci & Technol, Univ Sci & Technol China USTC Birmingham Joint Re, Hefei 230027, Peoples R China
[2] Univ Birmingham, Ctr Excellence Res Computat Intelligence & Applic, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England
基金
英国工程与自然科学研究理事会; 中国国家自然科学基金;
关键词
Archive method; many-objective evolutionary algorithm; multi-indicator; multiobjective optimization; stochastic ranking; EVOLUTIONARY ALGORITHM; DIVERSITY; CONVERGENCE; BALANCE;
D O I
10.1109/TEVC.2016.2549267
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional multiobjective evolutionary algorithms face a great challenge when dealing with many objectives. This is due to a high proportion of nondominated solutions in the population and low selection pressure toward the Pareto front. In order to tackle this issue, a series of indicator-based algorithms have been proposed to guide the search process toward the Pareto front. However, a single indicator might be biased and lead the population to converge to a subregion of the Pareto front. In this paper, a multi-indicator-based algorithm is proposed for many-objective optimization problems. The proposed algorithm, namely stochastic ranking-based multi-indicator Algorithm (SRA), adopts the stochastic ranking technique to balance the search biases of different indicators. Empirical studies on a large number (39 in total) of problem instances from two well-defined benchmark sets with 5, 10, and 15 objectives demonstrate that SRA performs well in terms of inverted generational distance and hypervolume metrics when compared with state-of-the-art algorithms. Empirical studies also reveal that, in the case a problem requires the algorithm to have strong convergence ability, the performance of SRA can be further improved by incorporating a direction-based archive to store well-converged solutions and maintain diversity.
引用
收藏
页码:924 / 938
页数:15
相关论文
共 51 条
[1]   Diversity Management in Evolutionary Many-Objective Optimization [J].
Adra, Salem F. ;
Fleming, Peter J. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (02) :183-195
[2]  
[Anonymous], P INT C COMP INT SEC
[3]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[4]   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
[5]  
Bringmann K., 2011, Proceedings of the International Joint Conference on Artificial Intelligence, V22, P1198
[6]  
Bringmann K, 2008, LECT NOTES COMPUT SC, V5369, P436, DOI 10.1007/978-3-540-92182-0_40
[7]   A Many-Objective Evolutionary Algorithm With Enhanced Mating and Environmental Selections [J].
Cheng, Jixiang ;
Yen, Gary G. ;
Zhang, Gexiang .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (04) :592-605
[8]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[9]  
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
[10]   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