Speeding up many-objective optimization by Monte Carlo approximations

DOI10.1016/j.artint.2013.08.001zbMath1334.68199OpenAlexW2009691097MaRDI QIDQ490427

Thomas Voß, Tobias Friedrich, Karl Bringmann, Christian Igel

Publication date: 27 August 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2013.08.001

zbMATH Keywords

multi-objective optimizationevolutionary algorithmhypervolume indicatorPareto-front approximation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Efficient optimization of many objectives by approximation-guided evolution ⋮ Bi-goal evolution for many-objective optimization problems ⋮ Approximate non-dominated sorting for evolutionary many-objective optimization ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets

Uses Software

• SMS-EMOA
• SHARK
• HypE

Cites Work

• Approximation quality of the hypervolume indicator
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• An improved algorithm for Klee's measure problem on fat boxes
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Efficient covariance matrix update for variable metric evolution strategies
• Theory of multiobjective optimization
• Nonlinear multiobjective optimization
• Learning probability distributions in continuous evolutionary algorithms -- a comparative review
• Multiple criteria decision analysis. State of the art surveys
• On Klee's measure problem for grounded boxes
• The logarithmic hypervolume indicator
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Introduction to evolutionary computing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Speeding up many-objective optimization by Monte Carlo approximations