In previous works we developed a market-based solution to the problem of assigning mobile agents to tasks. We showed that this solution is near-optimal, quick, and can naturally incorporate fuzzy logic to deal with uncertainty in task locations to reduce sensitivity. In this work we develop a hierarchical market and show that it provides results that are more optimal than the results of the Carlsson algorithm for the Min-Max Multiple Depots Multiple Traveling Salesmen Problem. We also demonstrate the ability of this algorithm to solve problems with thousands of cities and a hundred salesmen.
['Elad H. Kivelevitch', 'Kelly Cohen', 'Manish Kumar']
On The Scalability of the Market-Based Solution to the Multiple Traveling Salesmen Problem