A Polar-Metric-Based Evolutionary Algorithm

doi:10.1109/TCYB.2020.2965230

A Polar-Metric-Based Evolutionary Algorithm

2021-07-01

38

PRE

AI

DOI：10.1109/TCYB.2020.2965230

Original

Original request for help

Save

Abstract

En 中文

Over the past two decades, numerous multi- and many-objective evolutionary algorithms (MOEAs and MaOEAs) have been proposed to solve the multi- and many-objective optimization problems (MOPs and MaOPs), respectively. It is known that the difficulty of maintaining the convergence and diversity performances rapidly grows as the number of objectives increases. This phenomenon is especially evident for the Pareto-dominance-based EAs, because the nondominated sorting often fails to provide enough convergent pressure toward the Pareto front (PF). Therefore, many researchers came up with some non-Pareto-dominance-based EAs, which are based on indicator, decomposition, and so on. In this article, we propose a polarmetric (p-metric)-based EA (PMEA) for tackling both MOPs and MaOPs. p-metric is a recently proposed performance indicator which adopts a set of uniformly distributed direction vectors. In PMEA, we use a two-phase selection which combines both nondominated sorting and p-metric. Moreover, a modification is proposed to adjust the direction vectors of p-metric dynamically. In the experiments, PMEA is compared with six state-of-theart EAs in total and is measured by three performance metrics, including p-metric. According to the empirical results, PMEA shows promising performances on most of the test problems, involving both MOPs and MaOPs.

Keywords:

Evolutionary algorithm (EA)

many-objective optimization

multiobjective optimization

polar-metric (p-metric)

A Polar-Metric-Based Evolutionary Algorithm

Abstract

AI Summary

Journal

Organization