计算机应用研究2016，Vol.33Issue(4)：1024-1027,1033,5.DOI:10.3969/j.issn.1001-3695.2016.04.013
细菌觅食算法求解高维优化问题
Bacterial foraging algorithm for solving high-dimensional optimization problems
摘要
Abstract
Firstly,according to the situation that there are too many parameters in adaptive step size formula and the unified empirical parameters cannot adapt to various problems in bacterial foraging optimization algorithm,this paper proposed an im-proved adaptive step size formula by which introduced the evolution generations of current bacteria,the guide of optimal bacte-ria and the range of each dimension optimization to adjust the step size flexibly.Secondly,to analyze the problem of high-di-mensional optimization,which divided into decomposable,indecomposable but grouping and indecomposable not grouping class,it had been found the way to simplify complex problem by grouping of fractal dimension and detailing according to the different kinds of problems so greatly improved the efficiency and accuracy of solving problem.Based on the number of stand-ard test functions in multidimensional space,especially high-dimensional space (500 dimension and 800 dimension and 1000 dimension),the experimental results show that the improved algorithm significantly improves in the accuracy and efficiency than others.关键词
细菌觅食优化算法/自适应步长/高维优化/子空间Key words
bacterial foraging optimization algorithm(BFOA)/adaptive step size/high-dimensional optimization/subspace分类
信息技术与安全科学引用本文复制引用
李臖,党建武..细菌觅食算法求解高维优化问题[J].计算机应用研究,2016,33(4):1024-1027,1033,5.基金项目
国家自然科学基金资助项目（61163010）；甘肃省教育厅科研基金资助项目（1204-13）；甘肃省科技计划项目（1506RJZA084）；兰州市科技计划项目（2015-2-74）；甘肃省教育科学“十二五”规划课题 （）
