Experimental Analysis of New Heuristics for the TSP
Küçük Resim Yok
Tarih
2012
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Ieee
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Ö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.
Açıklama
4th International Conference on Problems of Cybernetics and Informatics (PCI) -- SEP 12-14, 2012 -- Baku, AZERBAIJAN
Anahtar Kelimeler
traveling salesman problem, heuristic algorithms, local search
Kaynak
2012 Iv International Conference Problems of Cybernetics and Informatics (Pci)
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
