中文说明：对于一个经典的TSP问题而言，遗传算法能有效、迅速的解决并得到最优解。通过选择、交叉、变异等仿生学相关的算子，能有效的实现全局搜索，并能有效避免陷入局部最优解
English Description：
For a classical TSP problem, genetic algorithm can solve the problem effectively and quickly. The bionics of selection, crossover and mutation operator can effectively achieve global search, and can effectively avoid falling into local optimal solution