An improved tabu search algorithm to solve knapsac
2016-08-23
1 0 0
4.0
Other
Earn points
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
vb
算法
搜索
改进
求解
问题
背包
禁忌
Related Source Codes
Student Management System
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
FTP upload and download written in VB
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Qq batch login
0
0
no vote
No comment