Multiple Traveling Salesman Problem (MTSP) is a generalization of the Traveling Salesman Problem (TSP). MTSP is an optimization problem to find the minimum total distance of m salesmen tours to visit several cities in which each city is only visited exactly by one salesman, starting from origin city called depot and return to depot after the tour is completed. In this paper, K-Means and Crossover Ant Colony Optimization (ACO) are used to solve MTSP. The implementation is observed on three datasets from TSPLIB with 2, 3, 4, and 8 salesmen. Analysis of results using K-Means and Crossover ACO will be compared. The effect of selecting a city as depot on the total travel distance of tour will also be analyzed.
|Journal||Journal of Physics: Conference Series|
|Publication status||Published - 29 Jan 2020|
|Event||Basic and Applied Sciences Interdisciplinary Conference 2017, BASIC 2017 - , Indonesia|
Duration: 18 Aug 2017 → 19 Aug 2017
- crossover ant colony optimization
- multiple traveling salesman problem