A tutorial on multiobjective optimization: fundamentals and evolutionary methods

MTM Emmerich, AH Deutz - Natural computing, 2018 - Springer
In almost no other field of computer science, the idea of using bio-inspired search paradigms
has been so useful as in solving multiobjective optimization problems. The idea of using a …

Multiobjective evolutionary algorithms: A survey of the state of the art

A Zhou, BY Qu, H Li, SZ Zhao, PN Suganthan… - Swarm and evolutionary …, 2011 - Elsevier
A multiobjective optimization problem involves several conflicting objectives and has a set of
Pareto optimal solutions. By evolving a population of solutions, multiobjective evolutionary …

Indicator-based multi-objective evolutionary algorithms: A comprehensive survey

JG Falcón-Cardona, CAC Coello - ACM Computing Surveys (CSUR), 2020 - dl.acm.org
For over 25 years, most multi-objective evolutionary algorithms (MOEAs) have adopted
selection criteria based on Pareto dominance. However, the performance of Pareto-based …

HypE: An algorithm for fast hypervolume-based many-objective optimization

J Bader, E Zitzler - Evolutionary computation, 2011 - direct.mit.edu
In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only
single set quality measure that is known to be strictly monotonic with regard to Pareto …

A review of multiobjective test problems and a scalable test problem toolkit

S Huband, P Hingston, L Barone… - IEEE Transactions on …, 2006 - ieeexplore.ieee.org
When attempting to better understand the strengths and weaknesses of an algorithm, it is
important to have a strong understanding of the problem at hand. This is true for the field of …

SMS-EMOA: Multiobjective selection based on dominated hypervolume

N Beume, B Naujoks, M Emmerich - European Journal of Operational …, 2007 - Elsevier
The hypervolume measure (or S metric) is a frequently applied quality measure for
comparing the results of evolutionary multiobjective optimisation algorithms (EMOA). The …

A faster algorithm for calculating hypervolume

L While, P Hingston, L Barone… - IEEE transactions on …, 2006 - ieeexplore.ieee.org
We present an algorithm for calculating hypervolume exactly, the Hypervolume by Slicing
Objectives (HSO) algorithm, that is faster than any that has previously been published. HSO …

A fast way of calculating exact hypervolumes

L While, L Bradstreet, L Barone - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
We describe a new algorithm WFG for calculating hypervolume exactly. WFG is based on
the recently-described observation that the exclusive hypervolume of a point p relative to a …

Theory of randomized search heuristics: Foundations and recent developments

A Auger, B Doerr - 2011 - books.google.com
Randomized search heuristics such as evolutionary algorithms, genetic algorithms,
evolution strategies, ant colony and particle swarm optimization turn out to be highly …

On the complexity of computing the hypervolume indicator

N Beume, CM Fonseca, M Lopez-Ibanez… - IEEE Transactions …, 2009 - ieeexplore.ieee.org
The goal of multiobjective optimization is to find a set of best compromise solutions for
typically conflicting objectives. Due to the complex nature of most real-life problems, only an …