.png){kind=icon}
返回
Structural topology design optimization using Genetic Algorithms with a bit-array representation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cma.2004.09.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a bit-array representation method for structural topology optimization using the Genetic Algorithm (GA) is implemented. The importance of structural connectivity in a design is further emphasized by considering the total number of connected objects of each individual explicitly in an equality constraint function. To evaluate the constrained objective function, Deb's constraint handling approach is further developed to ensure that feasible individuals are always better than infeasible ones in the population to improve the efficiency of the GA. A violation penalty method is proposed to drive the GA search towards the topologies with higher structural performance, less unusable material and fewer separate objects in the design domain. An identical initialization method is also proposed to improve the GA performance in dealing with problems with long narrow design domains. Numerical results of structural topology optimization problems of minimum weight and minimum compliance designs show the success of this bit-array representation method and suggest that the GA performance can be significantly improved by handling the design connectivity properly. (c) 2004 Elsevier B.V. All rights reserved.
Keyword:
structural topology optimization
bit-array representation
design connectivity
representation degeneracy
Genetic Algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.3W
被引数:
5.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏SURF: A connectivity-based space filling curve construction algorithm in high genus 3D surface WSNsSURF: 一种基于连通性的高属三维曲面WSNs空间填充曲线构建算法
PREAI
分享收藏分享收藏分享收藏
查看更多内容