Combining genetic algorithms with optimality criteria method for topology optimization

Zhimin Chen, Liang Gao, H. Qiu, X. Shao
{"title":"Combining genetic algorithms with optimality criteria method for topology optimization","authors":"Zhimin Chen, Liang Gao, H. Qiu, X. Shao","doi":"10.1109/BICTA.2009.5338131","DOIUrl":null,"url":null,"abstract":"This paper proposes a new algorithm for topology optimization by combining the features of genetic algorithms (GAs) and optimality criteria method (OC). An efficient treatment of initial population with optimality criteria method for evolutionary algorithm is presented which is different from traditional GAs application in structural topology optimization. The optimality method initializes a group of initial solutions near the best solution, then evolutionary operators of crossover and mutation are developed for evolutionary search. In so doing, the combining method can fully take advantage of the merits of both optimality criteria method and the genetic algorithm. The effectiveness of this method is demonstrated by some case studies of the widely studied structural minimum weight design problem. Compared with the solutions of other GA methods, several numerical examples show that the proposed optimization method can solve topology optimization problems more efficiently and also can achieve better results with lower computational cost.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International on Conference on Bio-Inspired Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2009.5338131","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

This paper proposes a new algorithm for topology optimization by combining the features of genetic algorithms (GAs) and optimality criteria method (OC). An efficient treatment of initial population with optimality criteria method for evolutionary algorithm is presented which is different from traditional GAs application in structural topology optimization. The optimality method initializes a group of initial solutions near the best solution, then evolutionary operators of crossover and mutation are developed for evolutionary search. In so doing, the combining method can fully take advantage of the merits of both optimality criteria method and the genetic algorithm. The effectiveness of this method is demonstrated by some case studies of the widely studied structural minimum weight design problem. Compared with the solutions of other GA methods, several numerical examples show that the proposed optimization method can solve topology optimization problems more efficiently and also can achieve better results with lower computational cost.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合遗传算法和最优准则的拓扑优化方法
结合遗传算法和最优准则法的特点,提出了一种新的拓扑优化算法。与传统的遗传算法在结构拓扑优化中的应用不同,提出了一种用最优准则处理初始种群的进化算法。该方法首先在最优解附近初始化一组初始解,然后利用交叉和变异进化算子进行进化搜索。这样,该组合方法可以充分利用最优准则法和遗传算法的优点。通过对广泛研究的结构最小重量设计问题的实例分析,证明了该方法的有效性。与其他遗传算法的求解结果相比,数值算例表明,所提出的优化方法可以更有效地求解拓扑优化问题,并以更低的计算成本获得更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A position-slots model for nucleosome assembly in the yeast genome based on integrated multi-platform positioning dataseis Model service discovery algorithm based on semantics Combining genetic algorithm and random projection strategy for (l, d)-motif discovery On the lower bounds of DNA word sets for DNA computing Method of extracting image geometric primitives based on immune algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1