抽象的

The performance research on solvingTSPby four typicalAI algorithms

Yue Wu, Zheng-qiang Jiang


Travelling Salesmen Problem(VRP) has an important theoretical value and practical significance inmathematical and logistics field. ItÂÂ’s a typical NPHard problem, and artificial intelligent (AI) Algorithm has been already proven to be a very effect way in solving this problem. This paper carried out the performance research on solving TSP by four typicalAI algorithms after in-depth analyzed the TSP and these four algorithms (genetic algorithm, particle swarmoptimization algorithm, simulated annealing algorithmand ant colony algorithm). This paper verified the TSP solving performance by China travelling salesmen problem experiments and MATLAB programming. The results showed that: considering the average iteration time, SA < PSO< ACA


索引于

  • 中国社会科学院
  • 谷歌学术
  • 打开 J é—¨
  • 中国知网(CNKI)
  • 引用因å­
  • 宇宙IF
  • 研究期刊索引目录 (DRJI)
  • 秘密æœç´¢å¼•æ“Žå®žéªŒå®¤
  • 学术文章影å“å› å­ï¼ˆSAJI))
  • ICMJE

查看更多

期刊国际标准å·

期刊 h 指数

Flyer