Improvements on Heuristic Algorithms for Solving Traveling Salesman Problem

Abstract

In this paper, four new heuristics are proposed in order to solve the traveling salesman problem. Comparisons are made between the results obtained from those heuristics. A new version of 2-opt and 3-opt methods are developed namely as 2-opt + 3-opt Shifting method. In addition, a new hybrid algorithm based on NN and Greedy algorithms is proposed. Computational experiments and comparisons are made on library problems for Hybrid, NN, and Greedy algorithms. Obtained results show the efficiency of the algorithms.

Keywords: Traveling salesman problem; heuristic algorithms; hyper-heuristic algorithms; hybrid algorithms