摘要
通过对遗传算法和 tabu Search算法的优势和不足分析 ,提出一种将二者混合使用的求解优化问题的算法。该算法以遗传算法为基础 ,用遗传算法作全局搜索 ,用 tabu Search算法作局部搜索 ,改进遗传算法的计算结果。最后 ,利用马尔可夫链理论证明了混合算法的全局收敛性 。
Through deeper contrast and comparison between genetic algorithm and tabu Search, a hybrid optimization algorithm based on a hybrid strategy is suggested. In this algorithm, tabu Search procedure is applied to each individual generated by genetic algorithm in order to improve the results. Finally, we demonstrate the global convergence of this hybrid algorithm by applying the theory of Markov chain.
出处
《铁道学报》
EI
CSCD
北大核心
2000年第2期94-98,共5页
Journal of the China Railway Society
基金
国家教委博士点基金! (1 9990 0 0 4 1 1 )