计算机应用研究2013，Vol.30Issue(9)：2641-2644,4.DOI:10.3969/j.issn.1001-3695.2013.09.021
自适应变异的果蝇优化算法
Fruit fly optimization algorithm with adaptive mutation
摘要
Abstract
In order to overcome the problems of low convergence precision and easily relapsing into local extremum in basic fruit fly optimization algorithm (FOA),this paper presented an adaptive mutation fruit fly optimization algorithm (FOAAM).During the evolution,in the condition of basic FOA's trapping in local extremum judging from the population's fitness variance and the current optimal,first,it generated M current optimal replicates.Then,it disturbed replicates by a certain probability P Gauss mutation operator.Finally,it optimized mutated replicates again to jump out of local extremum and continue to optimize.Experimental results show that the new algorithm has the advantages of better global searching ability,speeder convergence and more precise convergence.关键词
果蝇优化/自适应/变异/早熟收敛Key words
fruit fly optimization/ adaptive / mutation/ premature convergence分类
信息技术与安全科学引用本文复制引用
韩俊英,刘成忠..自适应变异的果蝇优化算法[J].计算机应用研究,2013,30(9):2641-2644,4.基金项目
甘肃省科技支撑计划资助项目(1011NKCA058) （1011NKCA058）
甘肃省自然科学基金资助项目(1208RJZA133) （1208RJZA133）
甘肃省教育厅科研基金资助项目(1202-04) （1202-04）
