In this paper, we propose an efficient and pow- erful crossoveroperator in the genetic algorithm for solving the traveling salesmanproblem (TSP). Our proposed crossover is called the complete subtourexchange crossover (CSEX), and in- herits as many good subtours aspossible because they are worth preserving for descendants. Beforegenerating the descendants, a prerequisite for the CSEX is that itenumerates all common subtours, which consist of the same set in apair of subtours on the given two tours of n cities.
展开▼
