Optimization of Traveling Salesman Problem

Solved TSP using SA(simulated annealing),GA(Genetic algorithm),DP(Dynamic Programming) and LP(Linear programming) and comparison between them as a function of time and distance and also made GUI of every problem.