New operators of genetic algorithms for traveling salesman problem

This paper describes an application of a genetic algorithm to the traveling salesman problem. A new knowledge based multiple inversion operator and a neighborhood swapping operator are proposed. Experimental results on different benchmark data sets have been found to provide superior results compared to some other existing methods.