计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (17): 44-46.DOI: 10.3778/j.issn.1002-8331.2009.17.013

• 研究、探讨 • 上一篇    下一篇

适用于求解TSP问题的二点组合算法

郭文强1,2,秦志光1,冯 昊3   

  1. 1.电子科技大学 计算机科学与工程学院,成都 610054
    2.新疆财经大学 计算机科学与工程学院,乌鲁木齐 830012
    3.新疆公安厅十一处计算机科,乌鲁木齐 830000
  • 收稿日期:2009-01-19 修回日期:2009-02-19 出版日期:2009-06-11 发布日期:2009-06-11
  • 通讯作者: 郭文强

Two vertices combination algorithm for TSP problem

GUO Wen-qiang1,2,QIN Zhi-guang1,FENG hao3   

  1. 1.University of Electronic Science and Technology of China,Chengdu 610054,China
    2.Xinjiang University of Finance and Economics,Urumqi 830012,China
    3.Xinjiang Provincal Public Security Bureau,Urumqi 830000,China
  • Received:2009-01-19 Revised:2009-02-19 Online:2009-06-11 Published:2009-06-11
  • Contact: GUO Wen-qiang

摘要: 分析局部最优解与全局最优解之间关系,对局部最优解进行分类,给出一种可加入更多种局部最优类型的二点组合算法。对该算法程序进行的多角度测试结果表明这个算法在解决中小规模的旅行商问题时是实用的。

关键词: 蚁群算法, 启发式算法, 二点组合算法, 旅行商问题

Abstract: Based on the analysis of local optimal solution and the whole relationship between the optimal solution to the optimal solution for local classified,a method is designed for adding more kinds of local optimal types of two vertices combination algorithms,which is algorithm process of the multi-angle test and the results show that the algorithm of small and medium-scale is practical for traveling salesman problem.

Key words: ant colony optimization, heuristic algorithm, two vertices combination algorithm, traveling salesman problem(TSP)