Finding evenly spaced pareto fronts for three-objective optimization problems

19Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The averaged Hausdorff distance Δp is a performance indicator in multi-objective evolutionary optimization which simultaneously takes into account proximity to the true Pareto front and uniform spread of solutions. Recently, the multi-objective evolutionary algorithm Δp -EMOA was introduced which successfully generates evenly spaced Pareto front approximations for bi-objective problems by integrating an external archiving strategy into the SMS-EMOA based on Δp . In this work a conceptual generalization of the Δp -EMOA for higher objective space dimensions is presented and experimentally compared to state-of-the art EMOA as well as specialized EMOA variants on three-dimensional optimization problems. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Trautmann, H., Rudolph, G., Dominguez-Medina, C., & Schütze, O. (2013). Finding evenly spaced pareto fronts for three-objective optimization problems. Advances in Intelligent Systems and Computing, 175 ADVANCES, 89–105. https://doi.org/10.1007/978-3-642-31519-0_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free