Abstract
Hypervolume-based algorithms are not widely used for solving many-objective optimization problems due to the bottleneck of hypervolume computation. Approximation methods can alleviate the problem and are discussed and tested in this work. Several MOEAs are considered, but after pre-experimental tests, only two variants of SMS-EMOA are considered further. These algorithms are compared to NSGA-III, a reference-based algorithm. The results show that SMS-EMOA with hypervolume approximation is viable for many-objective optimization problems and is faster in convergence towards the Pareto-front.
Author supplied keywords
Cite
CITATION STYLE
Irawan, D., & Naujoks, B. (2019). Comparison of reference- and hypervolume-based MOEA on solving many-objective optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11411 LNCS, pp. 266–277). Springer Verlag. https://doi.org/10.1007/978-3-030-12598-1_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
