Description: Will introduce a local optimization operator TSP problem genetic algorithm, in order to increase the performance of algorithm. Specific measures in the standard genetic algorithm to increase the final phase of step-by-step, that is optimal for each individual to carry out on behalf of a certain number of local search, in order to improve the best individual. First put forward the anti-sequence hybridization to introduce a local optimization process. With several ' common edge of a local optimization method, the anti-sequence of a hybridization of the most outstanding performance. Experimental results show that the optimization method can effectively force a solution of 300 cities within the TSP problem.
- [GA_TSP] - The use of genetic algorithm to solve TS
- [TSP_GSA] - tsp problem is a typical NP-complete pro
- [tsp] - Genetic Algorithm for Traveling Salesman
File list (Check if you may need any files):
几种局部优化算子在求解TSP中的性能比较.kdh
Download