Xingyu Xia, Xi Wang, Haidong Hu, Dongmei Wu, Hao Gao
{"title":"一种具有历史最佳点的改进人工蜂群算法","authors":"Xingyu Xia, Xi Wang, Haidong Hu, Dongmei Wu, Hao Gao","doi":"10.1109/CCDC.2018.8407519","DOIUrl":null,"url":null,"abstract":"Depending on the power global search ability, artificial bee colony algorithm attracts more attentions in recent years. But its slow convergence rate constraints its development. To better balance its exploration and exploitation abilities, we define a new point named as mean history best points (MHB) to lead the direction of bee population. The numerical experiments on the basic benchmark functions validate the efficiency of our algorithm.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved artificial bee colony algorithm with history best points\",\"authors\":\"Xingyu Xia, Xi Wang, Haidong Hu, Dongmei Wu, Hao Gao\",\"doi\":\"10.1109/CCDC.2018.8407519\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Depending on the power global search ability, artificial bee colony algorithm attracts more attentions in recent years. But its slow convergence rate constraints its development. To better balance its exploration and exploitation abilities, we define a new point named as mean history best points (MHB) to lead the direction of bee population. The numerical experiments on the basic benchmark functions validate the efficiency of our algorithm.\",\"PeriodicalId\":409960,\"journal\":{\"name\":\"2018 Chinese Control And Decision Conference (CCDC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Chinese Control And Decision Conference (CCDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC.2018.8407519\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Chinese Control And Decision Conference (CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2018.8407519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improved artificial bee colony algorithm with history best points
Depending on the power global search ability, artificial bee colony algorithm attracts more attentions in recent years. But its slow convergence rate constraints its development. To better balance its exploration and exploitation abilities, we define a new point named as mean history best points (MHB) to lead the direction of bee population. The numerical experiments on the basic benchmark functions validate the efficiency of our algorithm.