A Study of Traveling Salesman Problem Using Fuzzy Self Organizing Map

Traveling Salesman Problem (TSP) is classical and most widely studied problem in Combinatorial Optimization (Applegate D. L. et al., 2006). It has been studied intensively in both Operations Research and Computer Science since 1950s as a result of which a large number of techniques were developed to solve this problem. Much of the work on TSP is not motivated by direct applications, but rather by the fact that it provides an ideal platform for study of general methods that can be applied to a wide range of Discrete Optimization Problems. Indeed, numerous direct applications of TSP bring life to research area and help to direct future work. The idea of problem is to find shortest route of salesman starting from a given city, visiting n cities only once and finally arriving at origin city. The investigation question which arises is: