The traveling salesperson problem is a classical computer science problem (though it might also be regarded as a real-life problem). Starting at one city, the objective is to visit each of n cities...

The traveling salesperson problem is a classical computer science problem (though it might also be regarded as a real-life problem). Starting at one city, the objective is to visit each of n cities exactly once and return to the first city on a route that minimizes the distance traveled. The n cities can be regarded as variously connected. The connections can be described by a weighted graph. Write a parallel program to solve the traveling salesperson problem with real data obtained from a map to include 25 major cities.