检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学机械科学与工程学院
出 处:《农业机械学报》2008年第6期137-141,131,共6页Transactions of the Chinese Society for Agricultural Machinery
基 金:国家自然科学基金资助项目(项目编号:60574053)
摘 要:针对SIMP方法中,存在中间支撑密度单元,且对拓扑分布有一定影响的情况,引入SSV约束,提出了一种基于SIMP方法和SSV约束的方法即SIMP-SSV方法,其思路是用SIMP的优化结果初始化SSV方法中的设计变量,再用SSV方法得到最终的优化目标。用SIMP-SSV方法同时进行了具有最小柔度的结构与支撑的拓扑优化设计。算例表明,SIMP-SSV方法不仅使拓扑分布更加清晰,有效消除了中间支撑变量对结构与支撑拓扑分布的影响,而且可使最小柔度比SIMP的更小。In the results of topology optimization with SIMP (solid isotropic material with penalization model), there are always some grey areas with intermediate densities. The intermediate densities of supports will have an effect on the topologies of structure and support. In order to drive the solution to a 0/1 layout a new constraint, labeled the sum of squares of the variables (SSV) was introduced for the first time. The constraint stipulated that the SSV must be larger or equal to its value at a discrete design for a specified amount of material. Based on the SIMP approach and the SSV constraint, a twopass method has been proposed, where SIMP was employed to generate an intermediate solution to initialize the design variables and SSV was then adopted to produce the final design. In SSV stage, the design variables were still the densities of the finite elements but Young' s modulus was a linear function of these densities (in some sense, a SIMP material without penalty). The potential of the present method has been demonstrated by simultaneous topological design of structure and support for minimum compliance. The examples showed that the hybrid technique could effectively remove all intermediate densities of support, whose effects were eliminated accordingly, and generate stiffer optimal designs characterized with a sharper boundary in contrast to SIMP.
分 类 号:TH11[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28