Efficient optimization of many objectives by approximation-guided evolution

DOI10.1016/j.ejor.2014.11.032zbMath1346.90754OpenAlexW2028203177MaRDI QIDQ319124

Karl Bringmann, Frank Neumann, Tobias Friedrich, Markus Wagner

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.032

zbMATH Keywords

multi-objective optimizationapproximationcomparative study

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A concave optimization-based approach for sparse multiobjective programming ⋮ A weighted-sum method for solving the bi-objective traveling thief problem ⋮ A tutorial on multiobjective optimization: fundamentals and evolutionary methods

Uses Software

• MOEA/D
• SPEA2
• jMetal
• SMS-EMOA
• SHARK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• Speeding up many-objective optimization by Monte Carlo approximations
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Efficiently computing succinct trade-off curves
• Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
• Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Multicriteria Optimization
• Evolutionary Multi-Criterion Optimization
• Evolutionary Multi-Criterion Optimization

This page was built for publication: Efficient optimization of many objectives by approximation-guided evolution