摘要
结合插入法和禁忌搜索算法的优点,提出了一种基于插入法的禁忌搜索算法TIS(tabu＿insertsearch),该算法利用禁忌搜索算法较强的局部搜索能力和插入法在构造高质量解时的优越性来进行解空间的搜索.TIS能有效地帮助搜索程序跳出局部最优解,找到全局最优或次优解.以典型的组合优化问题TSP为例,验证了该算法的有效性,计算机实验的结果表明该算法有较好的寻优能力.
A tabu_insertion search algorithm(TIS) is purposed based on the merits of insertion method and tabu search. TIS uses the good local_search ability of tabu search and the good tour_construct ability of insertion method to search the solution space. Computing Results show that TIS have the good ability to jump local optimization solution and obtain the optimization solution.
出处
《西南师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2003年第6期887-891,共5页
Journal of Southwest China Normal University(Natural Science Edition)
基金
教育部科学技术重点项目(2000114)
重庆市科委基金资助项目(20037881).
