基于秩的离散变量桁架权值最小化蚁群算法

P. Capriles, L. D. Fonseca, H. Barbosa, Afonso C. C. Lemonge
{"title":"基于秩的离散变量桁架权值最小化蚁群算法","authors":"P. Capriles, L. D. Fonseca, H. Barbosa, Afonso C. C. Lemonge","doi":"10.1002/CNM.912","DOIUrl":null,"url":null,"abstract":"One variant of the ant colony optimization (ACO) metaheuristic, known as rank-based ant system (RBAS), is proposed for weight minimization of structures involving discrete design variables. Stress and displacements constraints are handled using a penalty technique, and the structural analysis is performed by the finite element method. Results obtained for several discrete weight minimization problems show that the RBAS algorithm implemented is effective and competitive when compared with results found by genetic algorithms and another RBAS variant.","PeriodicalId":51245,"journal":{"name":"Communications in Numerical Methods in Engineering","volume":"23 1","pages":"553-575"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/CNM.912","citationCount":"52","resultStr":"{\"title\":\"Rank‐based ant colony algorithms for truss weight minimization with discrete variables\",\"authors\":\"P. Capriles, L. D. Fonseca, H. Barbosa, Afonso C. C. Lemonge\",\"doi\":\"10.1002/CNM.912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One variant of the ant colony optimization (ACO) metaheuristic, known as rank-based ant system (RBAS), is proposed for weight minimization of structures involving discrete design variables. Stress and displacements constraints are handled using a penalty technique, and the structural analysis is performed by the finite element method. Results obtained for several discrete weight minimization problems show that the RBAS algorithm implemented is effective and competitive when compared with results found by genetic algorithms and another RBAS variant.\",\"PeriodicalId\":51245,\"journal\":{\"name\":\"Communications in Numerical Methods in Engineering\",\"volume\":\"23 1\",\"pages\":\"553-575\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1002/CNM.912\",\"citationCount\":\"52\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Communications in Numerical Methods in Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/CNM.912\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Numerical Methods in Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/CNM.912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 52

摘要

提出了蚁群优化(ACO)元启发式算法的一种变体,即基于秩的蚂蚁系统(RBAS),用于涉及离散设计变量的结构的权重最小化。应力和位移约束采用惩罚技术处理,结构分析采用有限元法进行。对几个离散权值最小化问题的结果表明,与遗传算法和另一种RBAS变体的结果相比,所实现的RBAS算法是有效的,并且具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rank‐based ant colony algorithms for truss weight minimization with discrete variables
One variant of the ant colony optimization (ACO) metaheuristic, known as rank-based ant system (RBAS), is proposed for weight minimization of structures involving discrete design variables. Stress and displacements constraints are handled using a penalty technique, and the structural analysis is performed by the finite element method. Results obtained for several discrete weight minimization problems show that the RBAS algorithm implemented is effective and competitive when compared with results found by genetic algorithms and another RBAS variant.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信