一种改进的logistic -正弦-余弦混合混沌映射Jaya优化算法

Weidong Lei, Zhan Zhang, Jiawei Zhu, Yishuai Lin, Jing Hou, Ying Sun
{"title":"一种改进的logistic -正弦-余弦混合混沌映射Jaya优化算法","authors":"Weidong Lei, Zhan Zhang, Jiawei Zhu, Yishuai Lin, Jing Hou, Ying Sun","doi":"10.1109/icaci55529.2022.9837758","DOIUrl":null,"url":null,"abstract":"Jaya optimization algorithm is a simple but powerful intelligence optimization method which has several outstanding characteristics of both population-based algorithms and swarm intelligence-based algorithms. It has shown great potentials to solve various hard and complex optimization problems, but there still has much room to improve its performance, especially for solving high-dimensional and non-convex problems. Hence, this paper proposes an improved Jaya optimization algorithm with a novel hybrid logistic-sine-cosine chaotic map, which is named IJaya for short. The hybrid logisticsine-cosine chaotic map is applied to balance the exploration and the exploitation processes of Jaya optimization algorithm. Seven benchmark testing functions with different scale settings are used to evaluate the performance of our improved algorithm. Computational results indicate that our improved Jaya optimization algorithm outperforms greatly its original version on most testing functions with high-dimensions.","PeriodicalId":412347,"journal":{"name":"2022 14th International Conference on Advanced Computational Intelligence (ICACI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Jaya Optimization Algorithm with Hybrid Logistic-Sine-Cosine Chaotic Map\",\"authors\":\"Weidong Lei, Zhan Zhang, Jiawei Zhu, Yishuai Lin, Jing Hou, Ying Sun\",\"doi\":\"10.1109/icaci55529.2022.9837758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Jaya optimization algorithm is a simple but powerful intelligence optimization method which has several outstanding characteristics of both population-based algorithms and swarm intelligence-based algorithms. It has shown great potentials to solve various hard and complex optimization problems, but there still has much room to improve its performance, especially for solving high-dimensional and non-convex problems. Hence, this paper proposes an improved Jaya optimization algorithm with a novel hybrid logistic-sine-cosine chaotic map, which is named IJaya for short. The hybrid logisticsine-cosine chaotic map is applied to balance the exploration and the exploitation processes of Jaya optimization algorithm. Seven benchmark testing functions with different scale settings are used to evaluate the performance of our improved algorithm. Computational results indicate that our improved Jaya optimization algorithm outperforms greatly its original version on most testing functions with high-dimensions.\",\"PeriodicalId\":412347,\"journal\":{\"name\":\"2022 14th International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 14th International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icaci55529.2022.9837758\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 14th International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icaci55529.2022.9837758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

Jaya优化算法是一种简单但功能强大的智能优化方法,它具有基于群体的算法和基于群体智能的算法的几个突出特点。它在解决各种困难复杂的优化问题方面显示出巨大的潜力,但在性能上仍有很大的提升空间,特别是在解决高维和非凸问题方面。为此,本文提出了一种改进的Jaya优化算法,该算法采用一种新颖的logistic-正弦-余弦混合混沌映射,简称为IJaya。采用混合logistic正余弦混沌映射来平衡Jaya优化算法的探索和开发过程。使用7个不同尺度设置的基准测试函数来评估改进算法的性能。计算结果表明,改进的Jaya优化算法在大多数高维测试函数上的性能都大大优于原来的Jaya优化算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Jaya Optimization Algorithm with Hybrid Logistic-Sine-Cosine Chaotic Map
Jaya optimization algorithm is a simple but powerful intelligence optimization method which has several outstanding characteristics of both population-based algorithms and swarm intelligence-based algorithms. It has shown great potentials to solve various hard and complex optimization problems, but there still has much room to improve its performance, especially for solving high-dimensional and non-convex problems. Hence, this paper proposes an improved Jaya optimization algorithm with a novel hybrid logistic-sine-cosine chaotic map, which is named IJaya for short. The hybrid logisticsine-cosine chaotic map is applied to balance the exploration and the exploitation processes of Jaya optimization algorithm. Seven benchmark testing functions with different scale settings are used to evaluate the performance of our improved algorithm. Computational results indicate that our improved Jaya optimization algorithm outperforms greatly its original version on most testing functions with high-dimensions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Speed Estimation of Video Target Based on Siamese Convolutional Network and Kalman Filtering Aspect Term Extraction and Categorization for Chinese MOOC Reviews A Global Harmony Search Algorithm Based on Tent Chaos Map and Elite Reverse Learning An Improved Superpixel-based Fuzzy C-Means Method for Complex Picture Segmentation Tasks New Results on Finite-Time Synchronization of Delayed Fuzzy Neural Networks
×
引用
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