Two-level degradation hybrid algorithm for multiple traveling salesman problem
一种求解多旅行商问题双层降解混合算法*

This paper put forward a new two-level degradation hybrid algorithm for quickly solving the multiple traveling salesman problems. Top-level degradation divided the original problem into some sub-class problems according to the distribution property of the problem space. Low-level degradation converted these sub-class problems to some corresponding classical traveling salesman problems. The difficulty solving these sub-class problems would be cut down while decreasing the initial edge number of these problems. Finally, could solve high-quality solutions by exact algorithm. The contrast experiments with the same type algorithms show that the computation time of the new algorithm is shorter and the solving quality of the new algorithm is higher. This shows that the new algorithm is effective and efficient.