一种新的数值函数优化人工蜂群算法

Liquan Zhao, Wang Xin, Wang Lin
{"title":"一种新的数值函数优化人工蜂群算法","authors":"Liquan Zhao, Wang Xin, Wang Lin","doi":"10.1109/CCSSE.2016.7784349","DOIUrl":null,"url":null,"abstract":"Artificial Bee Colony (ABC) algorithm is a widely used optimization algorithm. However, it is good in exploration but poor in exploitation. To improve the optimization performance of ABC algorithm, two novel search mechanisms served as the search equations are proposed. Firstly, the improved algorithm integrates the information of previous best solution into the search equation in the onlookers to improve the exploitation. Secondly, the search policy of the scouts is modified, the distance between the optimal and the worst solutions is utilized to replace the worst solution, so as to avoid producing worse solution. The result shows that the proposed algorithm has higher precision and stability compared with other algorithms.","PeriodicalId":136809,"journal":{"name":"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A novel artificial bee colony algorithm for numerical function optimization\",\"authors\":\"Liquan Zhao, Wang Xin, Wang Lin\",\"doi\":\"10.1109/CCSSE.2016.7784349\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Artificial Bee Colony (ABC) algorithm is a widely used optimization algorithm. However, it is good in exploration but poor in exploitation. To improve the optimization performance of ABC algorithm, two novel search mechanisms served as the search equations are proposed. Firstly, the improved algorithm integrates the information of previous best solution into the search equation in the onlookers to improve the exploitation. Secondly, the search policy of the scouts is modified, the distance between the optimal and the worst solutions is utilized to replace the worst solution, so as to avoid producing worse solution. The result shows that the proposed algorithm has higher precision and stability compared with other algorithms.\",\"PeriodicalId\":136809,\"journal\":{\"name\":\"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCSSE.2016.7784349\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Control Science and Systems Engineering (ICCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCSSE.2016.7784349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

人工蜂群(Artificial Bee Colony, ABC)算法是一种应用广泛的优化算法。但勘探能力强,开发能力差。为了提高ABC算法的优化性能,提出了两种新的搜索机制作为搜索方程。首先,改进算法将先前最优解的信息整合到围观者的搜索方程中,提高了算法的可开发性;其次,修改侦察器的搜索策略,利用最优解与最差解之间的距离替换最差解,避免产生最差解;结果表明,与其他算法相比,该算法具有更高的精度和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel artificial bee colony algorithm for numerical function optimization
Artificial Bee Colony (ABC) algorithm is a widely used optimization algorithm. However, it is good in exploration but poor in exploitation. To improve the optimization performance of ABC algorithm, two novel search mechanisms served as the search equations are proposed. Firstly, the improved algorithm integrates the information of previous best solution into the search equation in the onlookers to improve the exploitation. Secondly, the search policy of the scouts is modified, the distance between the optimal and the worst solutions is utilized to replace the worst solution, so as to avoid producing worse solution. The result shows that the proposed algorithm has higher precision and stability compared with other algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信