Multi-multi-objective optimization problem and its solution by a MOEA

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

Abstract

In this paper, a new type of Multi-Objective Problems (MOPs) is introduced and formulated. The new type is an outcome of a motivation to find optimal solutions for different MOPs, which are coupled through communal components. Therefore, in such cases a multi-Multi-Objective Optimization Problem (m-MOOP) has to be considered. The solution to the m-MOOP is defined and an approach to search for it by applying an EMO algorithm sequentially is presented. This method, although not always resulting in the individual MOPs' Pareto fronts, nevertheless gives solutions to the m-MOOP problem in hand. Several measures that allow the assessment of the introduced approach are offered. To demonstrate the approach and its applicability, academic examples as well as a "real-life," engineering example, are given. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Avigad, G. (2007). Multi-multi-objective optimization problem and its solution by a MOEA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4403 LNCS, pp. 847–861). Springer Verlag. https://doi.org/10.1007/978-3-540-70928-2_63

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