基于函数复杂度的自适应模拟退火和禁忌搜索新算法

摘要

在求解多峰复杂函数的过程中,传统的模拟退火算法和禁忌搜索算法经常出现算法快速收敛于局部最优解、后期收敛速度变慢和搜索能力变差等问题.为解决这些问题,本文给出函数复杂度的定义,并提出基于函数复杂度的自适应模拟退火和禁忌搜索算法.该算法首先根据函数复杂度自适应调整步长控制参数,然后根据调整后步长求得函数的粗糙解,在此基础上再使用初始步长求得全局最优解.实验表明,该算法不仅可以跳出局部最优解的限制,并且减少了迭代次数,有效地提高了全局和局部搜索能力.%In the process of applying traditional simulated annealing algorithm and tabu search algorithm to solving multi-peak complex functions, the following problems often occur:particles converge to the local optimal solution too fast, the late converge slows down and search ability turns poor. In order to solve these problems, the definition of function complexity is proposed, and adaptive simulated annealing algorithm and tabu search algorithm are presented based on the function complexity. In these algorithms, the step length control parameters are adaptively adjusted according to the function complexity; then rough solution of the function is obtained in terms of regulated step length; finally, and the original step length is used to acquire the global optimal solution . Experiments show that the proposed method cannot only transcend the limits of the local optimal solution, but also reduce iteration of the above algorithms, and efficiently improve local and global search ability.