scholarly journals An R2 Indicator and Decomposition Based Steady-State Evolutionary Algorithm for Many-Objective Optimization

2018 ◽  
Vol 2018 ◽  
pp. 1-18 ◽  
Author(s):  
Fei Li ◽  
Jianchang Liu ◽  
Peiqiu Huang ◽  
Huaitao Shi

An R2 indicator based selection method is a major ingredient in the formulation of indicator based evolutionary multiobjective optimization algorithms. The existing classical indicator based selection methodologies have demonstrated an excellent performance to solve low-dimensional optimization problems. However, the R2 indicator based evolutionary multiobjective optimization algorithms encounter enormous challenges in high-dimensional objective space. Our main purpose is to explore how to extend the R2 indicator to handle many-objective optimization problems. After analyzing the R2 indicator, the objective space partition strategy, and the decomposition method, we propose a steady-state evolutionary algorithm based on the R2 indicator and the decomposition method, named, R2-MOEA/D, to obtain well-converged and well-distributed Pareto front. The main contribution of this paper contains two aspects. (1) The convergence and diversity for the R2 indicator based selection are analyzed. Two improper selection situations will be properly solved via applying the decomposition method. (2) According to the position of a new individual in the steady-state evolutionary algorithm, two different objective space partition strategies and the corresponding selection methods are proposed. Extensive experiments are conducted on a variety of benchmark test problems, and the experimental results demonstrate that the proposed algorithm has competitive performance in comparison with several tailored algorithms for many-objective optimization.

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Cai Dai ◽  
Yuping Wang

In order to well maintain the diversity of obtained solutions, a new multiobjective evolutionary algorithm based on decomposition of the objective space for multiobjective optimization problems (MOPs) is designed. In order to achieve the goal, the objective space of a MOP is decomposed into a set of subobjective spaces by a set of direction vectors. In the evolutionary process, each subobjective space has a solution, even if it is not a Pareto optimal solution. In such a way, the diversity of obtained solutions can be maintained, which is critical for solving some MOPs. In addition, if a solution is dominated by other solutions, the solution can generate more new solutions than those solutions, which makes the solution of each subobjective space converge to the optimal solutions as far as possible. Experimental studies have been conducted to compare this proposed algorithm with classic MOEA/D and NSGAII. Simulation results on six multiobjective benchmark functions show that the proposed algorithm is able to obtain better diversity and more evenly distributed Pareto front than the other two algorithms.


Sign in / Sign up

Export Citation Format

Share Document