计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (29): 31-33.
• 研究、探讨 • 上一篇 下一篇
朱颢东,李红婵
收稿日期:
修回日期:
出版日期:
发布日期:
ZHU Haodong,LI Hongchan
Received:
Revised:
Online:
Published:
摘要: 禁忌搜索算法是解决组合优化问题的一种主要方法,是克服NP完全问题的一个有效途径。随着计算网格的发展,将禁忌搜索算法引入到这种分布式并行计算环境中,具有广泛的应用价值。提出了一个基于双禁忌对象的禁忌搜索算法,在此算法的基础上,利用并行化分散搜索策略来提高算法的求解精度。实验结果表明该并行禁忌搜索算法性能较高。
关键词: 禁忌搜索, 组合优化问题, 计算网格, 分散搜索策略
Abstract: Tabu Search(TS) algorithm is one of main methods to solve combinatorial optimization problem and an effective approach to overcome NP complete problem.With the development of computational grid,it has wide application value to introduce tabu search algorithm into distributed parallel computing environment.A tabu search algorithm based on double tabu objects is proposed.Parallel scatter search strategy is used to improve algorithm precision.Experimental results show that the parallel tabu search algorithm has better performance.
Key words: tabu search, combinatorial optimization problem, computational grid, parallel scatter search strategy
朱颢东,李红婵. 基于双禁忌对象的并行禁忌搜索算法[J]. 计算机工程与应用, 2011, 47(29): 31-33.
ZHU Haodong,LI Hongchan. Parallel tabu search algorithm based on double tabu objects[J]. Computer Engineering and Applications, 2011, 47(29): 31-33.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2011/V47/I29/31