There is no algorithm that can solve the travelling salesman's problem, especially for a large number of cities, because it is considered an "NP-Hard" problem. As of now, simulations on supercomputers is used to get an approximation for the solution.