A hybrid algorithm with modified Inver-over operator and genetic algorithm search for traveling salesman problem

Abstract

In this article, we develop a novel hybrid approach to solve the traveling salesman problem (TSP). In this approach, we first initialize suboptimal solution using Nearest Neighbor (NN) tour construction method, followed modified Inver-over operator and then proposed crossover with 2-opt mutation applied to improve for optimal solution. We use 14 TSP data sets from TSPLIB to evaluate the performance of proposed hybrid method. The proposed hybrid method gives better results in terms of best and average error. In experimental results of the tests we show that the proposed hybrid method is superior to available algorithm in literature.