Search
Data: data_mtsp for 3, 4 and 5 agents
This is a modification of the classical Traveling Salesman Problem.
Given is an undirected graph with $N$ nodes (cities), one of them serving as a depot. The depot is a node where all routes start and end. Further, there are $M$ agents (traveling salespersons). The goal is to find a set of $M$ routes such that the length of the longest one is minimal subject to
Solution quality is determined by the length of the longest tour, that is to be minimized.
If solved as a pure black-box optimization problem, one could use information about cities locations or the distance matrix only in the evaluation function. Here, it is allowed to use or analyze such a kind of information elsewhere as well, e.g., in recombination operators.