Experimental Analysis of New Heuristics for the TSP

4th International Conference on Problems of Cybernetics and Informatics (PCI) -- SEP 12-14, 2012 -- Baku, AZERBAIJANWOS: 000320337500183In this study, the three new heuristic algorithms which are proposed in [1] for the solution of traveling salesman problem is developed. In addition, the new versions of 2-opt and 3-opt algorithms are proposed. These algorithms are tested and their performances are compared with the well-known heuristic algorithms such as Nearest Neighbor, and Greedy algorithms.IEE