A Parametric Hybrid Method for the Traveling Salesman Problem

Mathematical and Computational Applications

Kızılates, Gözde¹ 

关键词: traveling salesman problem;    nearest neighbor algorithm;    greedy algorithm;    parametric hybrid algorithm;    hyper heuristic algorithm;   

DOI  :  10.3390/mca18030459

学科分类：计算数学

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY