An Improved Genetic Algorithm for TSP Problem
Lan Huang · Microcomputer Development · 2004
TSP (Traveling Salesman Problem) is a typical NP-complete problem,and the genetic algorithm (GA) is the method for solving NP-complete problem. The paper, in order to solve the problem well, puts forward a new the genetic algorithm, which use dividing periods , encouraging top and mind evolutionary computation(MEC) to enhance the convergence speed without deteriorating diversity of population. According to the analysis and test, the improved genetic algorithm can get the better result than the traditional genetic algorithm. This shows that the method has better feasibility and practicability.