A Comparison of Many Approaches to Solving the Multiple Traveling Salesman Problem

The Multiple Traveling Salesman Problem (
$mTSP$
) is a canonical problem in multi-agent coordination, and many approaches to solving this problem have been developed over the years. An evaluation of several approaches to solving the multi-depot multiple traveling salesmen problem, including Genetic Algorithms, Ant Colony Optimization, and multiple Market-Based approaches are given. Ant Colony Optimization techniques tend to reach closer to optimality, while market-based techniques produce results very quickly.