Hidden-variables genetic algorithm for ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
Hidden-variables genetic algorithm for variable-size design space optimal layout problems with application to aerospace vehicles
Auteur(s) :
Gamot, Juliette [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Balesdent, Mathieu [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Tremolet, Arnault [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Wuilbercq, Romain [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Melab, Nouredine [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Talbi, El-Ghazali [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Inria Lille - Nord Europe
Université de Lille
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Balesdent, Mathieu [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Tremolet, Arnault [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Wuilbercq, Romain [Auteur]
DTIS, ONERA, Université Paris Saclay [Palaiseau]
Melab, Nouredine [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Talbi, El-Ghazali [Auteur]
Optimisation de grande taille et calcul large échelle [BONUS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Inria Lille - Nord Europe
Université de Lille
Titre de la revue :
Engineering Applications of Artificial Intelligence
Pagination :
105941
Éditeur :
Elsevier
Date de publication :
2023-05
ISSN :
0952-1976
Mot(s)-clé(s) en anglais :
Evolutionary algorithms EA
Discipline(s) HAL :
Informatique [cs]
Résumé en anglais : [en]
The optimal layout of a complex system such as aerospace vehicles consists in placing a given number of components in a container in order to minimize one or several objectives under some geometrical or functional constraints. ...
Lire la suite >The optimal layout of a complex system such as aerospace vehicles consists in placing a given number of components in a container in order to minimize one or several objectives under some geometrical or functional constraints. This paper presents an extended formulation of this problem as a variable-size design space (VSDS) problem to take into account a large number of architectural choices and components allocation during the design process. As a representative example of such systems, considering the layout of a satellite module, the VSDS aspect translates the fact that the optimizer has to choose between several subdivisions of the components. For instance, one large tank of fuel might be placed as well as two smaller tanks or three even smaller tanks for the same amount of fuel. In order to tackle this NP-hard problem, a genetic algorithm enhanced by an adapted hidden-variables mechanism is proposed. This latter is illustrated on a toy case and an aerospace application case representative to real world complexity to illustrate the performance of the proposed algorithms. The results obtained using the proposed mechanism are reported and analyzed.Lire moins >
Lire la suite >The optimal layout of a complex system such as aerospace vehicles consists in placing a given number of components in a container in order to minimize one or several objectives under some geometrical or functional constraints. This paper presents an extended formulation of this problem as a variable-size design space (VSDS) problem to take into account a large number of architectural choices and components allocation during the design process. As a representative example of such systems, considering the layout of a satellite module, the VSDS aspect translates the fact that the optimizer has to choose between several subdivisions of the components. For instance, one large tank of fuel might be placed as well as two smaller tanks or three even smaller tanks for the same amount of fuel. In order to tackle this NP-hard problem, a genetic algorithm enhanced by an adapted hidden-variables mechanism is proposed. This latter is illustrated on a toy case and an aerospace application case representative to real world complexity to illustrate the performance of the proposed algorithms. The results obtained using the proposed mechanism are reported and analyzed.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- 2212.11011
- Accès libre
- Accéder au document