Mohammad Sedighpour
Instructor, Department of Mathematics, Hamedan Branch, Islamic Azad University, Hamedan, Iran
[ 1 ] - An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
نویسندگان همکار