TSP (Travelling salesman problem) for INDIA
TSP problem for India, all districts of India considered as a city that needs to be visited by salesperson and Delhi is the starting point for the salesperson.
We used the Lin-Kernighan algorithm for solving the TSP problem. The Lin-Kernighan algorithm code is directly taken from Concorde TSP Solver
