Solving non-restraint realistic TSP problem in embedded system

Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (6): 225-227.

• 工程与应用 • Previous Articles Next Articles

Solving non-restraint realistic TSP problem in embedded system

HU Jun-guo^1,2,SUN Yi¹,QI Heng-nian²

1.The MOE Key Laboratory of Mechanical Manufacture and Automation，Zhejiang University of Technology，Hangzhou 310032，China
2.College of Information Engineering，Zhejiang Forestry University，Lin’an，Zhejiang 311300，China

Received:2007-06-20 Revised:2007-08-30 Online:2008-02-21 Published:2008-02-21
Contact: HU Jun-guo

在嵌入式系统中求解无约束的现实TSP问题

胡军国^1,2,孙毅¹,祁亨年²

1.浙江工业大学机械制造及自动化教育部重点实验室，杭州 310032
2.浙江林学院信息工程学院，浙江临安 311300

通讯作者: 胡军国

Abstract

Abstract: The paper introduces to use simulated annealing algorithm and combine higher-probability -nearest-neighbor-algorithm-depth-first-search-algorithm to solve non-restraint TSP problem，and uses the improved depth-first-search-algorithm to create database structure of TSP subset.And the algorithms are successful used in embedded electronic guide system and bring to a good effect.

摘要： 介绍了利用模拟退火算法思想，结合大概率最近邻深度搜索算法解决无约束的TSP问题，以及用改进的深度优先遍历建立TSP子集数据结构和求解，并成功地应用到嵌入式电子导游系统中，取得良好效果。

HU Jun-guo^1,2,SUN Yi¹,QI Heng-nian². Solving non-restraint realistic TSP problem in embedded system[J]. Computer Engineering and Applications, 2008, 44(6): 225-227.

胡军国^1,2,孙毅¹,祁亨年². 在嵌入式系统中求解无约束的现实TSP问题[J]. 计算机工程与应用, 2008, 44(6): 225-227.

Solving non-restraint realistic TSP problem in embedded system

在嵌入式系统中求解无约束的现实TSP问题

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics