Experimental analysis of new heuristics for the TSP
Conference paper > Full Text
Authors: Fidan Nuriyeva, Gozde Kizilates, Murat Ersen Berberler
2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI), , , International, Full Text, pp 1-5
DOI: 10.1109/icpci.2012.6486443
Summary
In 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.