A multimodal approach for evolutionary multi-objective optimization (MEMO): Proof-of-principle results

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

Abstract

Most evolutionary multi-objective optimization (EMO) methods use domination and niche-preserving principles in their selection operation to find a set of Pareto-optimal solutions in a single simulation run. However, classical generative multi-criterion optimization methods repeatedly solve a parameterized single-objective problem to achieve the same. Due to lack of parallelism in the classical generative methods, they have been reported to be slow compared to efficient EMO methods. In this paper, we use a specific scalarization method, but instead of repetitive independent applications, we formulate a multimodal scalarization of multiple objectives and develop a niche-based evolutionary algorithm to find multiple Pareto-optimal solutions in a single simulation run. Proof-of-principle results on two to 10-objective problems from our proposed multimodal approach are compared with standard evolutionary multi/many-objective optimization methods.

Cite

CITATION STYLE

APA

Tutum, C. C., & Deb, K. (2015). A multimodal approach for evolutionary multi-objective optimization (MEMO): Proof-of-principle results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9018, pp. 3–18). Springer Verlag. https://doi.org/10.1007/978-3-319-15934-8_1

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