Abstract

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.

Highlights

  • T HE GOAL of optimizing a multiobjective optimization problem (MOP) is to obtain an optimal tradeoff frontManuscript received October 25, 2015; revised February 3, 2016; accepted March 17, 2016

  • A multi-indicator-based algorithm is proposed for many-objective optimization problems

  • As can be seen from the figure, I + leads the population to convergence to a single solution in the objective space; ISDE results in a diverse population yet it is unable to push the population to converge to the PF; the combination of the two indicators with a probability of 0.5 results in a well-converged and well-spreading population

Read more

Summary

Introduction

T HE GOAL of optimizing a multiobjective optimization problem (MOP) is to obtain an optimal tradeoff front. Manuscript received October 25, 2015; revised February 3, 2016; accepted March 17, 2016. Date of publication March 31, 2016; date of current version November 23, 2016. Color versions of one or more of the figures in this paper are available online at http://ieeexplore.ieee.org

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call