Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (6): 1458-1461.

• 软件、算法与仿真 • 上一篇    下一篇

求解TSP的改进人工鱼群算法

周永权, 谢竹诚   

  1. 广西民族大学数学与计算机科学学院, 广西, 南宁, 530006
  • 收稿日期:2008-03-18 修回日期:2008-05-19 出版日期:2009-06-20 发布日期:2010-01-03
  • 作者简介:周永权(1962- ),男,教授,博士,主要研究方向为计算智能,神经网络.E-mail:yongquanzhou@126.com
  • 基金资助:
    国家自然科学基金项目(60461001);广西自然科学基金项目(08320820991086);国家民族事务委员会科研项目(08GX01)资助课题

Improved artificial fish-school swarm algorithm for solving TSP

ZHOU Yong-quan, XIE Zhu-cheng   

  1. Coll. of Mathematics and Computer Science, Guangxi Univ. for Nationalities, Nanning 530006, China
  • Received:2008-03-18 Revised:2008-05-19 Online:2009-06-20 Published:2010-01-03

摘要: 利用遗传算法的交叉算子,并引入去交叉策略,对人工鱼群算法进行了改进,提出了一种改进型人工鱼群算法,并将该算法用于求解旅行商问题(traveling salesman problem,TSP)这一经典的NP难问题。通过实验仿真与目前TSP已知最优解进行对比分析,结果表明,改进后的人工鱼群算法在种群规模较小,迭代次数较少的情况下也可以收敛到已知最优解。

Abstract: To improve the artificial fish-school swarm algorithm,the cross operator of the genetic algorithm and the cross-removing strategy are used to solve the traveling salesman problem(TSP).The experiment results show that the algorithm,with the smaller populations and the fewer number of iterations,can converge to the current optimal solution of the TSP problem.

中图分类号: