首页 | 官方网站   微博 | 高级检索  
     

基于双禁忌对象的并行禁忌搜索算法
引用本文:朱颢东,李红婵.基于双禁忌对象的并行禁忌搜索算法[J].计算机工程与应用,2011,47(29):31-33.
作者姓名:朱颢东  李红婵
作者单位:郑州轻工业学院计算机与通信工程学院,郑州,450002
基金项目:河南省基础与前沿技术研究计划项目(No.102300410266); 郑州轻工业学院博士科研基金资助项目
摘    要:禁忌搜索算法是解决组合优化问题的一种主要方法,是克服NP完全问题的一个有效途径。随着计算网格的发展,将禁忌搜索算法引入到这种分布式并行计算环境中,具有广泛的应用价值。提出了一个基于双禁忌对象的禁忌搜索算法,在此算法的基础上,利用并行化分散搜索策略来提高算法的求解精度。实验结果表明该并行禁忌搜索算法性能较高。关键词:禁忌搜索;组合优化问题;计算网格;分散搜索策略

关 键 词:禁忌搜索  组合优化问题  计算网格  分散搜索策略
修稿时间: 

Parallel tabu search algorithm based on double tabu objects
ZHU Haodong,LI Hongchan.Parallel tabu search algorithm based on double tabu objects[J].Computer Engineering and Applications,2011,47(29):31-33.
Authors:ZHU Haodong  LI Hongchan
Affiliation:ZHU Haodong,LI Hongchan School of Computer and Communication Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,China
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 ha...
Keywords:tabu search  combinatorial optimization problem  computational grid  parallel scatter search strategy
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号