A New Many-Objective Evolutionary Algorithm Based on Determinantal Point Processes

12/15/2020
by   Peng Zhang, et al.
0

To handle different types of Many-Objective Optimization Problems (MaOPs), Many-Objective Evolutionary Algorithms (MaOEAs) need to simultaneously maintain convergence and population diversity in the high-dimensional objective space. In order to balance the relationship between diversity and convergence, we introduce a Kernel Matrix and probability model called Determinantal Point Processes (DPPs). Our Many-Objective Evolutionary Algorithm with Determinantal Point Processes (MaOEADPPs) is presented and compared with several state-of-the-art algorithms on various types of MaOPs bluewith different numbers of objectives. The experimental results demonstrate that MaOEADPPs is competitive.

READ FULL TEXT

page 6

page 7

page 9

research
04/15/2020

Improving Many-objective Evolutionary Algorithms by Means of Expanded Cone Orders

Given a point in m-dimensional objective space, the local environment of...
research
02/24/2018

IGD Indicator-based Evolutionary Algorithm for Many-objective Optimization Problems

Inverted Generational Distance (IGD) has been widely considered as a rel...
research
01/09/2023

ATM-R: An Adaptive Tradeoff Model with Reference Points for Constrained Multiobjective Evolutionary Optimization

The goal of constrained multiobjective evolutionary optimization is to o...
research
04/30/2017

How to Read Many-Objective Solution Sets in Parallel Coordinates

Rapid development of evolutionary algorithms in handling many-objective ...
research
11/06/2018

A Parallel MOEA with Criterion-based Selection Applied to the Knapsack Problem

In this paper, we propose a parallel multiobjective evolutionary algorit...
research
04/20/2015

Negatively Correlated Search

Evolutionary Algorithms (EAs) have been shown to be powerful tools for c...

Please sign up or login with your details

Forgot password? Click here to reset