The Multiple Depots, Multiple Traveling Salesmen Problem extends the well-known Traveling Salesman Problem (TSP) to cases where there are several traveling salesmen originating from various initial locations (depots). We are interested in a variant of this problem, in which there is no constraint on visiting all the cities, but rather each city offers a benefit value associated with visiting it, and the goal is to maximize the profit by the team of salesmen. We propose a solution based on economic markets, and show that it is capable of producing near-optimal results at a much faster runtime relative to a solution based on Binary Programming.
展开▼
