安徽大学学报（自然科学版）Issue(4)：31-36,6.DOI:10.3969/j.issn.1000-2162.2015.04.007
自适应细菌觅食算法在优化问题中的应用
Self-adaptive bacterial foraging algorithm and its application to optimization problems
摘要
Abstract
The search procedure was performed in a fixed step length and the random dispersal was processed in a fixed frequency when applying bacterial foraging algorithm in optimization problems .Diversity of population could be increased through the traditional algorithm , however ,efficiency of the algorithm was compromised for possible loss of samples in later period . Two improvements , including the self‐adaption of the search step length and dispersal probability according to the evolution level and the energy value of bacteria ,were proposed in this study . The improvements were mainly aimed at enhancing the balance between local search and global optimization while keeping the diversity of populations .The proposed algorithm had been applied on the standard test function and TSP problem ,and the results indicated that the algorithm was suited for complex high dimensional optimization problems with better global search capability .关键词
优化问题/细菌觅食算法/自适应Key words
optimization problems/bacterial foraging algorithm/self-adaptive分类
信息技术与安全科学引用本文复制引用
肖文显,褚镭郦,王俊阁,刘震,马孝琴..自适应细菌觅食算法在优化问题中的应用[J].安徽大学学报（自然科学版）,2015,(4):31-36,6.基金项目
国家自然科学基金资助项目（71171151）；河南省教育厅自然科学研究计划 （）
