A parametric hybrid method for the traveling salesman problem
Küçük Resim Yok
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The traveling salesman problem (TSP) is one of the typical NP-Hard problems of combinatorial optimization area. This paper proposes a new hyper heuristic algorithm named Parametric Hybrid Method (PHM) based on The Farthest Vertex (FV) and Greedy heuristics for solving the traveling salesman problem. In addition, many problem instances from TSPLIB (traveling salesman problem library) were solved with NN, Greedy and PHM algorithms. The experimental results show that the new hybrid algorithm is more effective and efficient than both Greedy and Nearest Neighbor algorithms.
Açıklama
Anahtar Kelimeler
Greedy algorithm, Hyper heuristic algorithm, Nearest neighbor algorithm, Parametric hybrid algorithm, Traveling salesman problem
Kaynak
Mathematical and Computational Applications
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
18
Sayı
3
