A hybrid heuristic solving the traveling salesman problem

Abstract

This paper presents a new hybrid heuristic for solving the Traveling Salesman Problem, The algorithm is designed on the frame of a general optimization procedure which acts upon two steps, iteratively. In first step of the global search, a feasible tour is constructed based on insertion approach. In the second step the feasible tour found at the first step, is improved by a local search optimization procedure. The second part of the paper presents the performances of the proposed heuristic algorithm, on several test instances. The statistical analysis shows the effectiveness of the local search optimization procedure, in the graphical representation.peer-reviewe