Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point

09/16/2013
by   Tobias Friedrich, et al.
0

Many optimization problems arising in applications have to consider several objective functions at the same time. Evolutionary algorithms seem to be a very natural choice for dealing with multi-objective problems as the population of such an algorithm can be used to represent the trade-offs with respect to the given objective functions. In this paper, we contribute to the theoretical understanding of evolutionary algorithms for multi-objective problems. We consider indicator-based algorithms whose goal is to maximize the hypervolume for a given problem by distributing μ points on the Pareto front. To gain new theoretical insights into the behavior of hypervolume-based algorithms we compare their optimization goal to the goal of achieving an optimal multiplicative approximation ratio. Our studies are carried out for different Pareto front shapes of bi-objective problems. For the class of linear fronts and a class of convex fronts, we prove that maximizing the hypervolume gives the best possible approximation ratio when assuming that the extreme points have to be included in both distributions of the points on the Pareto front. Furthermore, we investigate the choice of the reference point on the approximation behavior of hypervolume-based approaches and examine Pareto fronts of different shapes by numerical calculations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2022

An Effective and Efficient Evolutionary Algorithm for Many-Objective Optimization

In evolutionary multi-objective optimization, effectiveness refers to ho...
research
12/10/2015

Computing factorized approximations of Pareto-fronts using mNM-landscapes and Boltzmann distributions

NM-landscapes have been recently introduced as a class of tunable rugged...
research
11/13/2020

Finding optimal Pulse Repetion Intervals with Many-objective Evolutionary Algorithms

In this paper we consider the problem of finding Pulse Repetition Interv...
research
05/11/2023

Fast Pareto Optimization Using Sliding Window Selection

Pareto optimization using evolutionary multi-objective algorithms has be...
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
06/23/2022

Evolutionary Time-Use Optimization for Improving Children's Health Outcomes

How someone allocates their time is important to their health and well-b...
research
03/22/2023

Leximin Approximation: From Single-Objective to Multi-Objective

Leximin is a common approach to multi-objective optimization, frequently...

Please sign up or login with your details

Forgot password? Click here to reset