Experimental Analysis of New Heuristics for the TSP

Nuriyeva F., Kizilates G., BERBERLER M. E.

4th International Conference on Problems of Cybernetics and Informatics (PCI), Baku, Azerbaycan, 12 - 14 Eylül 2012 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/icpci.2012.6486443
  • Basıldığı Şehir: Baku
  • Basıldığı Ülke: Azerbaycan
  • Anahtar Kelimeler: traveling salesman problem, heuristic algorithms, local search
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

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.