The Travelling Salesman Problem

The Travelling Salesman Problem is to find the shortest path for a set of locations to visit. The salesman needs to start from a location and return to the same location visiting all locations in the path. 

In existing system sales, man is provided with a list of cities that are to be visited, after every visit he will reach the center of the city and move to other location.

In this system, the accurate path is not maintained. In order to solve this problem, we need to work on following constraints.

Sales man who had visited certain location should find the shortest path to reach other location.There should not be multiple visits for each city.

Tools used: Core Java, JSP & servlet, Tomcat, HTML, SQL, Eclipse.

Leave a Reply

Your email address will not be published. Required fields are marked *