{"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}
引用次数: 5
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.