An Improved Heuristic Crossover Operator for TSP

TSP (traveling salesman problem) is one of the typical NP-hard problem in combination optimization. For salving the problem, genetic algorithm is better than traditional ones obviously, and there are also many crossover operators used to get hypo-optimization route. Base on heuristic crossover by Lixin Tang, a new crossover operator is conducted. The crossover preservers the segment of effective genes, then mobile window operator and neighborhood identification operator are used to fasten the algorithm convergence. The example shows that the new crossover operator is useful.