中文说明：旅行商问题（Traveling Salesman Problem，TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本。最早的旅行商问题的数学规划是由Dantzig（1959）等人提出。该附件通过遗传算法来解决多个旅行推销员问题MTSP.
English Description：
The traveling salesman problem (Traveling Salesman Problem,TSP), also translated as the traveling salesman problem, the traveling salesman problem, referred to as the TSP problem, is the most fundamental problem, the problem is in the pursuit of a single traveler from start through after all the given requirements, and finally back to the minimum path cost. First traveling salesman problem of mathematical programming consists of Dantzig (1959), among others. More than the attachment by using genetic algorithm to solve traveling salesman problem MTSP.