B. Niu, Yan Fan, Pei Zhao, Bing Xue, Li Li, Yujuan Chai
{"title":"一种线性递减趋化步长的细菌觅食优化算法","authors":"B. Niu, Yan Fan, Pei Zhao, Bing Xue, Li Li, Yujuan Chai","doi":"10.1109/IWISA.2010.5473527","DOIUrl":null,"url":null,"abstract":"Bacterial foraging optimization (BFO) is a relatively new bio-heuristic algorithm which is based on a metaphor of social interaction of E. coli bacteria. Although the algorithm has successfully been applied to many kinds of real word optimization problems, experimentation with complex problems reports that the basic BFO algorithm possesses a poor performance. Thus a novel bacterial foraging optimizer with linear decreasing chemotaxis step (BFO-LDC) algorithm is proposed in the present paper. The performance of the proposed BFO-LDC is amply demonstrated by applying it for four classical test functions and comparing it with basic BFO. And the results obtained show this proposed algorithm greatly improves the efficiency of basic BFO algorithm.","PeriodicalId":298764,"journal":{"name":"2010 2nd International Workshop on Intelligent Systems and Applications","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"A Novel Bacterial Foraging Optimizer with Linear Decreasing Chemotaxis Step\",\"authors\":\"B. Niu, Yan Fan, Pei Zhao, Bing Xue, Li Li, Yujuan Chai\",\"doi\":\"10.1109/IWISA.2010.5473527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bacterial foraging optimization (BFO) is a relatively new bio-heuristic algorithm which is based on a metaphor of social interaction of E. coli bacteria. Although the algorithm has successfully been applied to many kinds of real word optimization problems, experimentation with complex problems reports that the basic BFO algorithm possesses a poor performance. Thus a novel bacterial foraging optimizer with linear decreasing chemotaxis step (BFO-LDC) algorithm is proposed in the present paper. The performance of the proposed BFO-LDC is amply demonstrated by applying it for four classical test functions and comparing it with basic BFO. And the results obtained show this proposed algorithm greatly improves the efficiency of basic BFO algorithm.\",\"PeriodicalId\":298764,\"journal\":{\"name\":\"2010 2nd International Workshop on Intelligent Systems and Applications\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Workshop on Intelligent Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWISA.2010.5473527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWISA.2010.5473527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel Bacterial Foraging Optimizer with Linear Decreasing Chemotaxis Step
Bacterial foraging optimization (BFO) is a relatively new bio-heuristic algorithm which is based on a metaphor of social interaction of E. coli bacteria. Although the algorithm has successfully been applied to many kinds of real word optimization problems, experimentation with complex problems reports that the basic BFO algorithm possesses a poor performance. Thus a novel bacterial foraging optimizer with linear decreasing chemotaxis step (BFO-LDC) algorithm is proposed in the present paper. The performance of the proposed BFO-LDC is amply demonstrated by applying it for four classical test functions and comparing it with basic BFO. And the results obtained show this proposed algorithm greatly improves the efficiency of basic BFO algorithm.