Finally, we develop our algorithm to solve MTSP and give the concrete method.
最后还将改进的算法进行适当推广，给出了求解多旅行商问题(mtsp)的具体步骤。
To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.
为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。
To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.
为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。
应用推荐