计算机科学 ›› 2009, Vol. 36 ›› Issue (8): 254-257.
• 人工智能 • 上一篇 下一篇
郭文强,秦志光,冯昊
出版日期:
发布日期:
基金资助:
GUO Wen-qiang,QIN Zhi-guang,FENG Hao
Online:
Published:
摘要: 利用传统贪心算法的基本思路针对旅行商问题,提出了一种基于归零矩阵的验证算法。该算法以归零矩阵为输入规避矩阵陷阱,以完全贪心算法为求解思路来获得最短汉密尔顿回路。通过对若干TSP-LIB中问题的求解,结果表明所提算法能够以较快速度求得较好的满意解。
关键词: 旅行商问题,贪心算法,归零矩阵
Abstract: Drawing on the basic thinking of traditional greedy algorithms, this paper proposed a new verification algorithm for solving traveling salesman problems based on return-to-zero matrix This method takes the return-to-zero matrix as input to avoid matrix traps, the full greedy algorithm as the thought of problem solving to obtain the shortest Hamilton circuit. Using this method to solve some problems in TSP-LIB, the results show that this proposed method can obtain a better satisfactory solution within a shorter time.
Key words: Traveling salesman problem, Ureedy algorithm, Return-to-zero matrix
郭文强,秦志光,冯昊. 一种基于归零矩阵的TSP求解算法[J]. 计算机科学, 2009, 36(8): 254-257. https://doi.org/
GUO Wen-qiang,QIN Zhi-guang,FENG Hao. New Solving Algorithm of TSP Based on Return-to-zero Matrix[J]. Computer Science, 2009, 36(8): 254-257. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2009/V36/I8/254
Cited