Global optimizations and tabu search based on memory

作者:

Highlights:

摘要

Based on the idea of tabu search that Glover et al put forward, a new tabu search, named Memory Tabu Search (MTS), is proposed for solving the multiple-minima problem of continuous functions. Two convergence theorems, which show that MTS asymptotically converges to the global optimal solutions in probability one under suitable conditions, are given. Numerical results illustrate that this algorithm is efficient, robust and easy to implement.

论文关键词:Memory tabu search,Convergence in probability one,Multiple-minima problem

论文评审过程:Available online 29 November 2003.

论文官网地址:https://doi.org/10.1016/j.amc.2003.10.028