摘要
为提高遗传算法在解决背包问题时的局部搜索能力,在遗传算法中加入禁忌搜索的思想,用遗传算法做全局搜索,禁忌搜索辅助做局部搜索。文中阐述了遗传算法和禁忌搜索算法的基本思想,并给出了适用于背包问题的模型。通过具体事例测试改进的算法,其结果表明改进后的遗传算法拥有更好的性能和更快的收敛速度。
In order to improve the local search ability of the genetic algorithm in solving the knapsack problem,the taboo search algorithm is integrated into the genetic algorithm which is used for global search,and it is used for local search. This paper elaborates the basic idea of these algorithms,and presents the model that is applied to the solution of the knapsack problem. The result of an example shows that this algorithm has better performance and faster convergence speed.
出处
《电子科技》
2014年第10期67-70,共4页
Electronic Science and Technology
关键词
遗传算法
禁忌搜索
背包问题
收敛
genetic algorithm
taboo search
knapsack problem
convergence
