Traveling Salesman Problem (TSP) has been an interesting problem for a long

time in classical optimization techniques which are based on linear and nonlinear

programming. TSP can be described as follows: Given a number of cities to visit

and their distances from all other cities know, an optimal travel route has to be

found so that each city is visited one and only once with the least possible distance

traveled. This is a simple problem with handful of cities but becomes complicated

as the number increases.