摘要
设计了一种基于禁忌搜索的遗传算法,利用遗传算法提供的并行搜索主框架,结合禁忌算法的个体串行搜索方式,能扩大搜索空间,快速实现全局优化。把基于禁忌搜索的遗传算法与启发式方法相结合用来求解背包问题,经过计算机仿真,其优化性能指标及搜索效率均有大幅度的提高。
The paper design a genetic algorithm based on the tabu search. By utilizing the main frame of parallel search supplied by the genetic algorithm and the individual serial search mode of the tabu algorithm, this method can enlarge the search space and swiftly implement the overall optimization. If it is combined with the heuristics algorithm to solve the knapsack problem, according to the results of computer simulation, it can effectively improve the index of optimization performance and search efficiency.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2005年第3期359-362,共4页
Journal of University of Electronic Science and Technology of China
基金
四川省教育厅青年基金资助项目(200-A53)
关键词
禁忌搜索
背包问题
遗传算法
贪婪算法
tabu search
knapsack problem
genetic algorithm
greedy algorithm
