A Parametric Hybrid Method for the Traveling Salesman Problem
Articles > Article · 2013
Authors: Gözde Kızılates, Fidan Nuriyeva
Mathematical and Computational Applications, International, Scopus, 2013, vol 18, pp 459-466
DOI: 10.3390/mca18030459
Summary
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.