中文说明：遗传算法是应用较为广泛、研究历史较长的一种算法，它具有全局快速搜索能力，由于没有利用系统中的反馈信息，当求解到一定范围时往往要做大量无为的冗余迭代，求解效率较低。但是在旅行商（TSP）问题上不存在这个缺点，很好的解决了TSP问题。这里提供TSP问题的源程序。
English Description：
Genetic algorithm is widely used and has a long history of research. It has the ability of global fast search. Because it does not use the feedback information in the system, when the solution reaches a certain range, it often needs to do a lot of inaction redundant iterations, so the efficiency is low. But in the traveling salesman (TSP) problem does not exist this shortcoming, a good solution to the TSP problem. The source program of TSP problem is provided here.