首页    期刊浏览 2025年06月18日 星期三
登录注册

文章基本信息

  • 标题:An Analysis of New Optimization Algorithm for Different Combinatorial Problems
  • 本地全文:下载
  • 作者:S.Pothumani ; Sundararajan.M ; Arulselvi S
  • 期刊名称:International Journal of Innovative Research in Computer and Communication Engineering
  • 印刷版ISSN:2320-9798
  • 电子版ISSN:2320-9801
  • 出版年度:2015
  • 卷号:3
  • 期号:3
  • 出版社: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 tabu search is used to solve different types ofproblems in various fields like engineering, hardware, medical, etc. This paper gives an overview about someapplications of tabu search. Nearly fifteen papers are reviewed and all are proved that tabu search is one of the bestoptimal algorithm to solve the combinatorial problems.
国家哲学社会科学文献中心版权所有