计算机工程与应用Issue(12)：27-30,37,5.DOI:10.3778/j.issn.1002-8331.1403-0462
内嵌扰动变异的混合蛙跳算法
Disturbance variation embedded shuffled frog leaping algorithm
摘要
Abstract
To solve the premature convergence problem of the Shuffled Frog Leaping Algorithm, having weak local searching ability, an improved shuffled frog algorithm is proposed. New algorithm introduces random mutations in pairs of each frog and lets the subgroup within every frog individuals involve in producing new individual, making full use of every frog individual information, increasing the diversity of population, improving global optimization ability and avoiding algorithm to fall into local convergence. The simulation shows that the improved shuffled frog leaping algorithm effectively avoids falling into local convergence, improving the convergence precision.关键词
混合蛙跳算法/早熟收敛/随机扰动/全局优化Key words
shuffled frog leaping algorithm/premature convergence/random mutations/global optimization分类
信息技术与安全科学引用本文复制引用
季骏,戴月明,吴定会..内嵌扰动变异的混合蛙跳算法[J].计算机工程与应用,2015,(12):27-30,37,5.基金项目
国家高技术研究发展计划（863）（No.2013AA040405）；江苏省产学研联合创新基金资助项目（No.BY2012055）。 （）
