Compromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2011

Compromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization

Résumé

Multidisciplinary Design Optimization deals with engineering problems composed of several sub-problems - called disciplines - that can have antagonist goals and thus require to find compromise solutions. Moreover, the sub-problems are often multiobjective optimization problems. In this case, the compromise solutions between the disciplines are often considered as compromises between all objectives of the problem, which may be not relevant in this context. We propose two alternative definitions of the compromise between disciplines. Their implementations within the well-known NSGA-II algorithm are studied and results are discussed.
Fichier principal
Vignette du fichier
LNEMS_guedas_2011.pdf (339.3 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00663702 , version 1 (27-01-2012)

Identifiants

Citer

Benoît Guédas, Xavier Gandibleux, Philippe Dépincé. Compromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization. Yong Shi, Shouyang Wang, Gang Kou, Jyrki Wallenius. New State of MCDM in the 21st Century Selected Papers of the 20th International Conference on Multiple Criteria Decision Making 2009, Springer Berlin Heidelberg, pp.69-78, 2011, Lecture Notes in Economics and Mathematical Systems, ⟨10.1007/978-3-642-19695-9_6⟩. ⟨hal-00663702⟩
289 Consultations
133 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More