简单遗传算法求解经典旅行商问题实例，已伪码注释 -Simple genetic algorithm dsp problem instance

主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the exis

应用遗传算法解决旅行商（TSP）问题，算法中的染色体交叉过程改进了基本遗传算法的交叉办法。改程序可以求解30个城市的旅行商问题，也可以稍作修改继续扩展为更多城市的旅行商问题。-Applying the genetic algorithm to solve the traveling salesman (TSP) problem, the algorithm improves the process of chromosomal crossover compared to traditional

改进的遗传算法，基于混沌序列的遗传算法求解旅行商问题-Improved genetic algorithm, genetic algorithm based on chaotic sequence Traveling Salesman Problem