Asymmetric pareto-adaptive scheme for multiobjective optimization

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

Abstract

A core challenge of Multiobjective Evolutionary Algorithms (MOEAs) is to attain evenly distributed Pareto optimal solutions along the Pareto front. In this paper, we propose a novel asymmetric Pareto-adaptive (apa) scheme for the identification of well distributed Pareto optimal solutions based on the geometrical characteristics of the Pareto front. The apa scheme applies to problem with symmetric and asymmetric Pareto fronts. Evaluation on multiobjective problems with Pareto fronts of different forms confirms that apa improves both convergence and diversity of the classical decomposition-based (MOEA/D) and Pareto dominance-based MOEAs (paε-MyDE). © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Jiang, S., Zhang, J., & Ong, Y. S. (2011). Asymmetric pareto-adaptive scheme for multiobjective optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7106 LNAI, pp. 351–360). https://doi.org/10.1007/978-3-642-25832-9_36

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