首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Evaluating the Performance of Ant Colony Algorithm for the Solution of Constraint Based Traveling Salesman Problem
  • 本地全文:下载
  • 作者:Anil Kewat ; Arvind Kumar Sharma ; P.C.Gupta
  • 期刊名称:International Journal of Engineering and Computer Science
  • 印刷版ISSN:2319-7242
  • 出版年度:2016
  • 卷号:5
  • 期号:9
  • 页码:17909-17915
  • DOI:10.18535/ijecs/v5i9.20
  • 出版社:IJECS
  • 摘要:Soft Computing is the use of inexact solution to computationally hard tasks such as the solution of NP-Complete problems.TSP is a combinatorial optimization problem. In this paper TSP problem has been solved by using ACO. The major drawback of ACO is that it traps in local optima. In order to find an optimal solution for TSP problem the presented paper proposes an improved ACO which produces better result
  • 关键词:NP-Hard Problem; Combinatorial optimization; TSP; ACO.
国家哲学社会科学文献中心版权所有