4th International Conference on Problems of Cybernetics and Informatics (PCI), Baku, Azerbaijan, 12 - 14 September 2012
Conference Paper / Full Text
traveling salesman problem, heuristic algorithms, local search
Dokuz Eylül University Affiliated:
In this study, the three new heuristic algorithms which are proposed in  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.