Objective reduction for many-objective optimization problems using objective subspace extraction

DOI10.1007/s00500-017-2498-6zbMath1398.90156OpenAlexW2586059435MaRDI QIDQ1797785

Qiuzhen Lin, Xia Li, Naili Luo

Publication date: 22 October 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-017-2498-6

zbMATH Keywords

many-objective optimizationobjective reductionconflict informationobjective subspace extraction

Mathematics Subject Classification ID

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

Uses Software

• MOEA/D
• SPEA2
• MOPSO
• HypE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A novel micro-population immune multiobjective optimization algorithm
• A novel hybrid multi-objective immune algorithm with adaptive differential evolution
• Objective space partitioning using conflict information for solving many-objective problems
• Consequences of dropping nonessential objectives for the application of MCDM methods
• Interactive decision maps. Approximation and visualization of Pareto frontier
• Approximate Dynamic Programming
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Theory of the hypervolume indicator

This page was built for publication: Objective reduction for many-objective optimization problems using objective subspace extraction