多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提

出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题,

并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of practical significance. M TSP in the study of the characteristics of solutions based on the smallest share of the total number of traveling salesman tour and visit the points, the smallest share of the total trip distance to visit more than two goals of the M TSP problem and were given the corresponding mathematical model, algorithm and application examples, examples show that the model is correct.