Chaotic Ant Lion Optimization Algorithm

D. Davendra, M. Bialic-Davendra, Magdalena Metlicka
{"title":"Chaotic Ant Lion Optimization Algorithm","authors":"D. Davendra, M. Bialic-Davendra, Magdalena Metlicka","doi":"10.1109/COMPENG50184.2022.9905467","DOIUrl":null,"url":null,"abstract":"The Ant Lion Optimization (ALO) algorithm is a relative recent metaheuristic, designed on the concept of predator ant lions. The basic concepts revolve around hunting prey such as the random walk of ants, building traps, entrapment of ants in traps, catching preys, and re-building traps. The proposed algorithm focus on the stochasticity of the algorithm, with the embedding of chaos maps as pseudo-random number generation. The uniqueness of this approach is to evaluate the behavior of ALO, which employs minimal tuning parameters, and to observe the effectiveness of chaotic systems in mostly self-tuning algorithms. The experimentations was conducted on standard benchmark unimodal and multimodal problems and the results compared with the canonical version of ALO and other published algorithms. Based on the results comparisons, the Chaotic Ant Lion Optimization (CALO) performed significantly better than ALO and most compared algorithms.","PeriodicalId":211056,"journal":{"name":"2022 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Workshop on Complexity in Engineering (COMPENG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPENG50184.2022.9905467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The Ant Lion Optimization (ALO) algorithm is a relative recent metaheuristic, designed on the concept of predator ant lions. The basic concepts revolve around hunting prey such as the random walk of ants, building traps, entrapment of ants in traps, catching preys, and re-building traps. The proposed algorithm focus on the stochasticity of the algorithm, with the embedding of chaos maps as pseudo-random number generation. The uniqueness of this approach is to evaluate the behavior of ALO, which employs minimal tuning parameters, and to observe the effectiveness of chaotic systems in mostly self-tuning algorithms. The experimentations was conducted on standard benchmark unimodal and multimodal problems and the results compared with the canonical version of ALO and other published algorithms. Based on the results comparisons, the Chaotic Ant Lion Optimization (CALO) performed significantly better than ALO and most compared algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
混沌蚁狮优化算法
蚁狮优化算法(ALO)是一种相对较新的元启发式算法,它是根据捕食蚁狮的概念设计的。基本概念围绕着狩猎猎物,如蚂蚁的随机行走,建立陷阱,陷阱中蚂蚁的陷阱,捕捉猎物,重建陷阱。该算法注重算法的随机性,采用混沌映射的嵌入作为伪随机数的生成。该方法的独特之处在于评估了采用最小调谐参数的ALO的行为,并观察了混沌系统在大多数自调谐算法中的有效性。在标准基准的单峰和多峰问题上进行了实验,并将实验结果与规范版本的ALO和其他已发表的算法进行了比较。结果表明,混沌蚁狮优化算法(CALO)的性能明显优于混沌蚁狮优化算法(ALO)和大多数比较算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Inner Dynamics of Particle Swarm Optimization Interpreted by Complex Network Analysis Robustness of the Weighted World Air Transportation Network Components Mimicking the Complex Human Circulatory System via a Custom Hydro-mechanical Pulse Duplicator Chaotic Ant Lion Optimization Algorithm Dynamics of Interneurons in the Presence of a Sodium Channel Mutation
×
引用
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