Hidden-variables genetic algorithm for variable-size design space optimal layout problems with application to aerospace vehicles

被引:13
作者
Gamot, Juliette [1 ,2 ]
Balesdent, Mathieu [1 ]
Tremolet, Arnault [1 ]
Wuilbercq, Romain [1 ]
Melab, Nouredine [2 ]
Talbi, El-Ghazali [2 ]
机构
[1] Univ Paris Saclay, ONERA, DTIS, Palaiseau, France
[2] Univ Lille, INRIA, Villeneuve Dascq, France
关键词
Multi-disciplinary optimization; Optimization; Aerospace design; Genetic algorithms; PARTICLE SWARM OPTIMIZATION;
D O I
10.1016/j.engappai.2023.105941
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:16
相关论文
共 43 条
[21]   Multi-objective layout optimization of a satellite module using the Wang-Landau sampling method with local search [J].
Liu, Jing-fa ;
Hao, Liang ;
Li, Gang ;
Xue, Yu ;
Liu, Zhao-xia ;
Huang, Juan .
FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING, 2016, 17 (06) :527-542
[22]   Multi-objective particle swarm optimization algorithm based on objective space division for the unequal-area facility layout problem [J].
Liu, Jingfa ;
Zhang, Huiyun ;
He, Kun ;
Jiang, Shengyi .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 102 :179-192
[23]   Human-computer cooperative layout design method and its application [J].
Liu, Zhan-wei ;
Teng, Hong-fei .
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (04) :735-757
[24]   A Survey on Cooperative Co-Evolutionary Algorithms [J].
Ma, Xiaoliang ;
Li, Xiaodong ;
Zhang, Qingfu ;
Tang, Ke ;
Liang, Zhengping ;
Xie, Weixin ;
Zhu, Zexuan .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (03) :421-441
[25]   A new simulated annealing algorithm for the facility layout problem [J].
Meller, RD ;
Bozer, YA .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (06) :1675-1692
[26]   A graph placement methodology for fast chip design [J].
Mirhoseini, Azalia ;
Goldie, Anna ;
Yazgan, Mustafa ;
Jiang, Joe Wenjie ;
Songhori, Ebrahim ;
Wang, Shen ;
Lee, Young-Joon ;
Johnson, Eric ;
Pathak, Omkar ;
Nazi, Azade ;
Pak, Jiwoo ;
Tong, Andy ;
Srinivasa, Kavya ;
Hang, William ;
Tuncer, Emre ;
Le, Quoc V. ;
Laudon, James ;
Ho, Richard ;
Carpenter, Roger ;
Dean, Jeff .
NATURE, 2021, 594 (7862) :207-+
[27]  
Pelamatti J., 2020, THESIS U LILLE
[28]  
Potter MA, 1994, LECT NOTES COMPUT SC, V866, P249
[29]  
Roy R. K., 2010, A primer on the Taguchi method, V2nd
[30]   Stochastic ranking for constrained evolutionary optimization [J].
Runarsson, TP ;
Yao, X .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2000, 4 (03) :284-294