National Travelling Salesman Problem for Indian Cities: a Case Study

National traveling salesman problem (NTSP) is the subset of the World traveling salesman problem. NTSP has solved for twenty-six countries not of the country India. In the national traveling salesman problem, the user has to travel all the cities without revisiting the visited city of the given country. In this paper, the NTSP is solved for the Indian cities using the genetic algorithm, artificial neural network self-organizing map (SOM), and Simulated Annealing (SA). The early results show that the self-organizing map is an efficient method than the genetic algorithm and simulated annealing. But if the input is noisy then the genetic algorithm and simulated annealing perform better than the self-organizing map.