Traveling Salesman Problem A salesman has to go to several cities to sell goods. The distances (or travel expenses) between the cities are known. He has to choose a route that starts from his base, passes through each city, and finally returns to his base, so that the total distance (or travel expenses) is minimized. For example: Given 4 cities {1, 2, 3, 4} and the distances between them are 1, 3, 2, 4, 1, and the shortest distance is 25
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore