Travel Salesman Problem Algorithm

It is a classical problem in graph theory. It has no closed, analytic and algorithmic solution. This problem is soluble for smaller number(n) of cities but it breaks down as the number of cities grows:
Problem Formulation: It involves n-cities with paths connecting the cities. A tour is any path which begins with some starting city, visits each of the other cities exactly once and returns to the starting city.