A New Algorithm of Solving TSP—Elastic Search

摘要：

A kind of new method based on elastic network is put forward in this article, which solves the problem of Traveling Salesman Problem (TSP) through imitating the process of blowing balloon, as balloon is blown, city is visited one by one. Just like the shrinkage of balloon, the city with minimum cost is searched for every time and is joined in the city ring that had been visited. Moreover, the method can promptly provide various different of solution that is secondary optimization.

关键词： elastic network Traveling Salesman Problem optimization elastic search.

作者: LI Zhong AN Weigang WANG Jianzhong

作者单位: College of Science, North University of China, Taiyuan, Shanxi, 030051, China

会议类型: 国际会议

会议名称: 第七届国际测试技术研讨会

会议地点: 北京

会议语种:英文

在线出版日期: 2007-08-05（万方平台首次上网日期，不代表论文的发表时间）