Surveying an Approximate Solution for Traveling Salesman Problem

One of the interesting problems in 0-l programming in operation research science is called "Traveling salesman problem". In this paper two inventional methods for calculating the approximate answer have been surveyed. The first inventional method that has been surveyed is simple and its base is selecting a chain of cities that every selected city has the minimum cost with its previous city. The second inventional method is a little harder and has a special algorithm for selecting the first city and next cities. Both inventional methods are surveyed by simulation. Then it seems that the first inventional method has a big error index but the second inventional method has an acceptable error index and it can accept as a heuristic method.