Approximate non-dominated sorting for evolutionary many-objective optimization

DOI10.1016/j.ins.2016.06.007zbMath1428.90185OpenAlexW2430564265MaRDI QIDQ2282051

Yanyan Li

Publication date: 6 January 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.06.007

zbMATH Keywords

computational complexityapproximationevolutionary multi-objective optimizationmany-objective optimizationnon-dominated sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) 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

Non-dominated sorting on performance indicators for evolutionary many-objective optimization, DMaOEA-\(\varepsilon\)C: decomposition-based many-objective evolutionary algorithm with the \(\varepsilon\)-constraint framework, Objective extraction via fuzzy clustering in evolutionary many-objective optimization, A novel many-objective evolutionary algorithm based on transfer matrix with kriging model, Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization

Uses Software

• MOEA/D
• SMS-EMOA
• HypE
• Omni-optimizer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation quality of the hypervolume indicator
• Speeding up many-objective optimization by Monte Carlo approximations
• Evolutionary algorithms for multi-objective optimization: Performance assessments and comparisons
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Bi-goal evolution for many-objective optimization problems
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• Evolutionary Multi-Criterion Optimization
• Evolutionary Multi-Criterion Optimization