A kind of mission planning algorithm with multidepot multisalesmen problem
Liu Guan-jia · Journal of Shandong University of Technology · 2011
This paper presents a new solving method for multidepot multisalesmen problem based on K-means clustering algorithm.Algorithm defines the node attraction and classifies the set of the tour node according to node attract matrix,then applies the heuristic algorithm of single traveling salesman to solve it.The experimental results on multidepot multisalesmen problem show that this mission planning algorithm can be effectively applied in solving such problems.