HAL : hal-00449888, version 1

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

20th International Conference on Multiple Criteria Decision Making, Chengdu : China (2009)

A weak product on partially ordered sets to define a compromise between multiobjective optimization problems

Benoît Guédas (  Auteur correspondant ) 1, Xavier Gandibleux 2, Philippe Dépincé 1

(20/06/2009)

Multidisciplinary design optimization (MDO) deals with complex engineering problems which are decomposed into several subproblems called disciplines. The disciplines are often hierarchically organized. Moreover, each discipline may have many conflicting objectives to achieve at the same time. Thus, at each level of the hierarchy, trade-offs have to be found between multiobjective optimization problems. Multiobjective multidisciplinary methods designed to solve hierarchical multiobjective optimization problems such as EM-MOGA, MORDACE or COSMOS are searching for the whole Pareto set which corresponds to the multiobjective optimization problem that bring all the objectives of the problem together. But the solutions are just in a subset of the whole Pareto set. In this paper, we propose a definition of compromise between disciplines which are multiobjective optimization problems.

1 :	Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN)
	CNRS : UMR6597 – Université de Nantes – École Centrale de Nantes – Ecole des Mines de Nantes – Ecole Polytechnique de l'Université de Nantes
2 :	Laboratoire d'Informatique de Nantes Atlantique (LINA)
	CNRS : UMR6241 – Université de Nantes – Ecole des Mines de Nantes

Équipe de recherche : Méthode de Conception Mécanique (MCM); ROOM

Domaine

:

Informatique/Recherche opérationnelle

Mots Clés : Multidisciplinary Design Optimization – Multiobjective Optimization – Compromise – Ordered Sets

hal-00449888, version 1

http://hal.archives-ouvertes.fr/hal-00449888

oai:hal.archives-ouvertes.fr:hal-00449888

Contributeur : Benoît Guédas <>

Soumis le : Samedi 23 Janvier 2010, 16:04:52

Dernière modification le : Jeudi 18 Mars 2010, 11:26:59