中文说明： TSP (旅行商问题—Traveling SalesmanProblem)，是典型的NP完全问题，即其最坏情况下的时间复杂性随着问题规模的增大按指数方式增长，到目前为止不能找到一个多项式时间的有效算法。遗传算法是一种进化算法，其基本原理是仿效生物界中的“物竞天择、适者生存”的演化法
English Description：
TSP (travelling salesman problem-Traveling SalesmanProblem), is a classical NP-complete problem, namely, the worst-case time complexity as the problem grows exponentially, up to now cannot find a polynomial-time algorithm. Genetic algorithm is a kind of evolutionary algorithm, its basic principle is modeled on the biology of "natural selection, survival of the fittest" laws of evolution. Genetic algorithm approach is parameter encoded as a chromosomal problem, reuse of iteration methods of selection, crossover and mutation operation to exchange information on chromosomes in the population and eventually produce conforms to the target chromosome. Practice has proved that the genetic algorithm for solving TSP problems of combinatorial optimization problem has a better search performance.