A Parametric Hybrid Method for the Traveling Salesman Problem
Makaleler > Tam Makale · 2013
Yazarlar: Gözde Kızılates, Fidan Nuriyeva
Mathematical and Computational Applications, Uluslararası, Scopus, 2013, cilt 18, ss 459-466
DOI: 10.3390/mca18030459
Ö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.