该程序解决10个城市的货郎担问题（TSP），主要使用简单的遗传算法实现。该过程中包括：编码、解码，选择，交叉，变异等！-The program to solve the traveling salesman problem of 10 cities (TSP), the use of simple genetic algorithm. The process includes: encoding, decoding, selection, crossover and mutation!