迄今为止，中国旅行商问题的最优解是15904公里。
Till now, the best published result of Chinese-Travelling Salesman Problem is 15904km.
标准遗传算法在解决旅行商问题时效率不高，容易陷于局部最优解。
Traditional genetic algorithms have low efficiency and tend to be trapped by local optimizations.
最后还将改进的算法进行适当推广，给出了求解多旅行商问题(mtsp)的具体步骤。
Finally, we develop our algorithm to solve MTSP and give the concrete method.
最后还将改进的算法进行适当推广，给出了求解多旅行商问题(mtsp)的具体步骤。
Finally, we develop our algorithm to solve MTSP and give the concrete method.
应用推荐