An Improved Dragonfly Optimization Algorithm for Solving Numerical and Three-bar Truss Optimization Problems

Feng Min, Huajuan Huang
{"title":"An Improved Dragonfly Optimization Algorithm for Solving Numerical and Three-bar Truss Optimization Problems","authors":"Feng Min, Huajuan Huang","doi":"10.1109/acait53529.2021.9731344","DOIUrl":null,"url":null,"abstract":"The Dragonfly Algorithm(DA) is a burgeoning swarm intelligence algorithm based on the theory of dragonflies avoiding natural enemies and hunting their food. This algorithm has the benefits of a powerful search ability and ease of implementation, but it also has drawbacks like low solution accuracy and sluggish convergence time. Simulated Annealing (SA) is a Monte-Carlo iterative solution strategy-based random optimization technique. It can viably dodge falling into a nearby least and in the long run tend to the global optimum. So as to decrease the visual deficiency of dragonfly algorithm, progress it’s solution exactness and meeting speed, and maintain a strategic distance from dragonfly algorithm from falling into nearby optimal solution. A dragonfly algorithm based on simulated annealing mechanism (SADA) is proposed in this paper. In each iteration, if the new position has better adaptability, it will directly replace the original position. Otherwise, the Metropolis acceptance criteria will be utilized to decide whether to accept the unused solution. Therefore, while improving the solution accuracy and convergence speed, it can successfully dodge the dragonfly algorithm from falling into the nearby optimum. The viability of the calculation is confirmed by 22 benchmark test functions and three-bar truss engineering problems. Test comes about appear that SADA has way better execution in optimizing functions and can discover superior solutions in building applications.","PeriodicalId":173633,"journal":{"name":"2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/acait53529.2021.9731344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Dragonfly Algorithm(DA) is a burgeoning swarm intelligence algorithm based on the theory of dragonflies avoiding natural enemies and hunting their food. This algorithm has the benefits of a powerful search ability and ease of implementation, but it also has drawbacks like low solution accuracy and sluggish convergence time. Simulated Annealing (SA) is a Monte-Carlo iterative solution strategy-based random optimization technique. It can viably dodge falling into a nearby least and in the long run tend to the global optimum. So as to decrease the visual deficiency of dragonfly algorithm, progress it’s solution exactness and meeting speed, and maintain a strategic distance from dragonfly algorithm from falling into nearby optimal solution. A dragonfly algorithm based on simulated annealing mechanism (SADA) is proposed in this paper. In each iteration, if the new position has better adaptability, it will directly replace the original position. Otherwise, the Metropolis acceptance criteria will be utilized to decide whether to accept the unused solution. Therefore, while improving the solution accuracy and convergence speed, it can successfully dodge the dragonfly algorithm from falling into the nearby optimum. The viability of the calculation is confirmed by 22 benchmark test functions and three-bar truss engineering problems. Test comes about appear that SADA has way better execution in optimizing functions and can discover superior solutions in building applications.
求解数值及三杆桁架优化问题的改进蜻蜓优化算法
蜻蜓算法(Dragonfly Algorithm, DA)是一种新兴的群体智能算法,它基于蜻蜓躲避天敌和捕食食物的理论。该算法具有搜索能力强、易于实现等优点,但也存在求解精度低、收敛时间慢等缺点。模拟退火(SA)是一种基于蒙特卡罗迭代求解策略的随机优化技术。它可以有效地避免陷入附近的最小值,并在长期内趋于全局最优。为了减少蜻蜓算法的视觉缺陷,提高其解的精度和满足速度,与蜻蜓算法保持一定的策略距离,避免陷入附近的最优解。提出了一种基于模拟退火机制(SADA)的蜻蜓算法。在每次迭代中,如果新位置具有较好的适应性,则直接取代原位置。否则,将使用Metropolis接受标准来决定是否接受未使用的解决方案。因此,在提高求解精度和收敛速度的同时,成功地避免了蜻蜓算法陷入附近最优。通过22个基准试验函数和三杆桁架工程实例验证了计算的可行性。测试表明,SADA在优化功能方面具有更好的执行力,并且可以在构建应用程序时发现更好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信