首页    期刊浏览 2025年02月25日 星期二
登录注册

文章基本信息

  • 标题:SOLVING COMPLEX COMBINATORIAL PROBLEM USING TABU SEARCH
  • 本地全文:下载
  • 作者:S.Pothumani ; J.Sridhar
  • 期刊名称:International Journal of Innovative Research in Science, Engineering and Technology
  • 印刷版ISSN:2347-6710
  • 电子版ISSN:2319-8753
  • 出版年度:2015
  • 卷号:4
  • 期号:2
  • 页码:702
  • DOI:10.15680/IJIRSET.2015.0402156
  • 出版社:S&S Publications
  • 摘要:Tabu search is one of best algorithms to solve lot of combinatorial problems. Most of the NP- Hardproblems are complex and finding solution is the difficult one. But a same algorithm tabu search is used to solve differenttypes of problems in various fields like engineering, hardware, medical, etc. This paper gives a overview about someapplications of tabu search. Nearly fifteen papers are reviewed and all are proved that tabu search is one of the best optimalalgorithm to solve the combinatorial problems.
国家哲学社会科学文献中心版权所有