New Genetic Operators for Solving TSP: Application to Microarray Gene Ordering

This paper deals with some new operators of genetic algorithms for solving the traveling salesman problem (TSP). These include a new operator called, ”nearest fragment operator” based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. Superiority of these operators has been established on different benchmark data sets for symmetric TSP. Finally, the application of TSP with these operators to gene ordering from microarray data has been demonstrated.