Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (27): 50-52.DOI: 10.3778/j.issn.1002-8331.2009.27.016

• 研究、探讨 • Previous Articles     Next Articles

Using discrete search space-oriented leaping frog algorithm to solve TSP

CHEN Yi-ying1,LI Wen-bin1,WANG Duo2,ZHU Qun-ying1

  

  1. 1.Department of Computer Science,Shijiazhuang University of Economics,Shijiazhuang 050031,China
    2.Shijiazhuang University of Railway,Shijiazhuang 050000,China
  • Received:2008-11-03 Revised:2009-01-19 Online:2009-09-21 Published:2009-09-21
  • Contact: CHEN Yi-ying

使用面向离散搜索空间的蛙跳算法求解TSP

陈嶷瑛1,李文斌1,王 舵2,朱群英1   

  1. 1.石家庄经济学院 信息工程学院,石家庄 050031
    2.石家庄铁道学院,石家庄 050000
  • 通讯作者: 陈嶷瑛

Abstract: In order to search in discrete search space,a leap-frog algorithm named DSSLFA is proposed.Detailed flow and implementation of this method are discussed in this paper.How to use DSSLFA to solve Traveling Salesman Problem(TSP) is given.The experiment results show that this algorithm is effective and practicable.

Key words: traveling salesman problem, artificial intelligence, leap-frog algorithm

摘要: 针对搜索空间是离散的问题近似求解,提出了一种名为DSSLFA的蛙跳算法;给出了该算法的具体流程和实现细节;探讨了将该算法用于求解旅行商(TSP)问题的过程。在若干公用数据集上的实验结果表明,该文算法是有效、可行的。

关键词: 旅行商问题, 人工智能, 蛙跳算法

CLC Number: