一种基于曲线自适应和模拟退火的蝗虫优化算法.PDF

36 12 Vol. 36 No. 12 第 卷第 期 计算机应用研究 录用定稿 Application Research of Computers Accepted Paper 一种基于曲线自适应和模拟退火的蝗虫优化算法* a, b, c a, b, c 李洋州 ，顾 磊 (南京邮电大学 a. 计算机学院; b. 软件学院; c. 网络空间安全学院, 南京 210000) 摘 要：针对蝗虫优化算法容易陷入局部极值点、收敛速度慢、精度较差等缺点，提出曲线自适应和模拟退火蝗虫 优化算法。首先，引入曲线自适应代替蝗虫优化算法关键参数的线性自适应，提高了算法的全局搜索能力；其次， 在此基础上引入模拟退火算法，对蝗虫算法的劣势解具有一定概率的接收，使算法具有跳出局部最优，实现全局最 优的能力。自适应缩小模拟退火中蝗虫位置随机解的范围，有利于进一步提高蝗虫算法的开发能力。通过测试函数 测试，实验结果表明，改进的新算法具有更好的求解质量和收敛速度。 关键词：蝗虫优化算法；模拟退火算法；混合算法；自适应曲线 中图分类号：TP391.4 doi: 10.19734/j.issn.1001-3695.2018.07.0580 Grasshopper optimization algorithm based on curve adaptive and simulated annealing Li Yangzhou, Gu Lei (a. School of Computer Science Technology, b. School of Software, c. Institute for Network Security, Nanjing University of Posts Telecommunications, Nanjing 210000, China) Abstract: This paper proposed curve adaptive and simulation annealing grasshopper optimization algorithm to avoid the disadvantages that the grasshopper optimization algorithm was easy to fall into local optimum, slow convergence speed and poor search accuracy. First of all, this paper introduced the adaptive curve to replace the linear adaptation of the grasshopper optimization algorithm key parameter, which improved the global search ability of the algorithm. Then, on this basis, this paper introduced the simulated annealing algorithm, which had a certain probability of receiving the inferior solution of the grasshopper algorithm to jump out of local optimization and achieve global