GR-252 Solving Multiple Traveling Salesman Problem using K Means Clustering and Mixed Integer Programming - An Integrated Approach

GR-252 Solving Multiple Traveling Salesman Problem using K Means Clustering and Mixed Integer Programming - An Integrated Approach

In this research paper, we explore an efficient algorithm for multiple Traveling Salesman Problem (m-TSP) using an approach which combines K Means clustering algorithm and Mixed Integer Programming (MIP). The Traveling Salesman problem is an NP hard problem which relates to generation of minimum cost round trip tours for multiple salesmen visiting several cities in their territory. Our novel approach has the promise of reaching closer to the optimal solution as compared to heuristics-based approaches such as genetic algorithms.