An efficient genetic algorithm for the traveling salesman problem

Abstract

Based on an existing Genetic algorithm (GA) to TSP (IGT algorithm), by amending the original mapping operator and Inver-over operator and introducing differing operator for the first time, a new GA to TSP is proposed. Empirical results show that this new algorithm outperforms IGT algorithm in terms of solution quality, means and variances. Moreover, T-test exhibits the comprehensive advantage of the new algorithm. © 2010 Springer-Verlag.