行商问题是一个经典的NP完全问题,多人旅行商问题的求解则更具挑战性。以往对求解多人旅行商问题的研究局限于以所有成员路径总和最小为优化标准-Salesmen problem is a classical NP complete problem, many people are solving the traveling salesman problem more challenging. Solving the traveling salesman problem of many previous