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.