Makespan minimizing on multiple travel salesman problem with a learning effect of visiting time
-The multiple traveling salesman problem (MTSP) involves the assignment and sequencing procedure simultaneously. The assignment of a set of nodes to each visitors and determining the sequence of visiting of nodes for each visitor. Since specific range of process is needed to be carried out in nodes in commercial environment, several factors associated with routing problem are required to be taken into account. This research considers visitors’ skill and category of customers which can affect visiting time of visitors in nodes.