| TSP is one of the most famous problems in combination andoptimization. It synthesizes a large group of typical characteristics of theproblems in combination and optimization and also exists in many high-techfields in various forms, including the production of super large-scaleintegration of chips, the design for printing circuit board, the crystallographyof X-ray, robot control and so on. The present paper expatiates on severalcurrent calculation methods for solving problems in TSP, including simulatedannealing calculation method, taboo searching, ant calculation method andinheritance calculation method. Then it is concluded that most of the currentcalculation methods are based on sectional optimization, which has quickspeed but is weak in the property of convergence and usually cannot work outthe optimal solution. The present paper analyzes the properties of theMemetic calculation method and the peculiarity of the problem in TSP. Also,the paper discusses and points out an evolutionary calculation method withheuristic variation operators. Besides, the coding schemes in the calculationmethod and the realization of various evolutionary operators are expoundedin the paper. Combining the heuristic crossover and the crossover of lateralreorganization, the author designs a new crossover operator. Simulatedexperiments show that the proposed method can obtain better solutionscompared with common evolutionary calculation methods.
|
PDF Full Text Request