用蚁群原理编写的商旅路径的优化问题，可以自动绘制各种曲线图，以反应收敛的程度-With the ant colony principle to write business path optimization problem, can be automatically draw all kinds of graph, in order to response the degree of convergence

旅行商问题(TSP)是典型的NP完全问题，遗传算法是求解NP完全问题的一种常用方法。旅行商问题(TSP)的蚁群算法实现算法。在MATLAB中用遗传算法施行对TSP问题进行了求解，进行了选择、交叉和变异算子进行了算法设计。MATLAB源代码。-Traveling Salesman Problem (TSP) is a typical NP-complete problem, genetic algorithm for solving NP-complete problems, a common m