论文标题
用于可变尺寸设计空间的遗传算法最佳布局问题,适用于航空航天车辆
Hidden-Variables Genetic Algorithm for Variable-Size Design Space Optimal Layout Problems with Application to Aerospace Vehicles
论文作者
论文摘要
复杂系统(例如航空航天车辆)的最佳布局包括将给定数量的组件放入容器中,以最大程度地减少在某些几何或功能约束下的一个或几个目标。本文将该问题的扩展配方作为可变大小的设计空间(VSD)问题,以考虑到设计过程中大量的建筑选择和组件分配。作为此类系统的代表性示例,考虑到卫星模块的布局,VSDS方面将优化器必须在组件的几个细分之间进行选择。例如,可以放置一个大型燃料,以及两个较小的储罐或三个较小的储罐,用于相同量的燃料。为了解决这个NP硬性问题,提出了一种通过适应的隐藏变异机制增强的遗传算法。在玩具案例和一项航空航天应用程序案例中说明了后者的现实世界复杂性,以说明拟议算法的性能。报告并分析了使用拟议机制获得的结果。
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.