Description: An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu search techniques, using I & D strategies, while designed for the local optimal solution of the two kinds of mutation operator. The improved algorithm can effectively compensate for the standard tabu search algorithm depends on the initial solution defect, but also to avoid the phenomenon of search stagnation. Through specific examples and random-question test, indicating that the improved tabu search algorithm has better performance. Guan
- [bag8] - eight backpackers of all source code, fo
- [1] - Algorithm with the taboo tsp (TSP) has f
- [fbsc] - Tabu search algorithm C/C++ source code,
- [DynamicMenu] - dynamic menu
- [TSP] - Tabu algorithm to solve TSP problem, the
- [jinji] - In matlab ，it can revolosion the problem
File list (Check if you may need any files):
一种改进的禁忌搜索法在函数优化问题中的应用.pdf
Download