New for: D1, D2, D3, D4, D5
The k-TRP problem states: given a set of cities, a number of mechanics and the matrix of distances between the cities, find an assignment of the repairmen to serve all the cities, with a cost function as small as possible.
Because there has not been found yet any methods of solving this problem through genetic algorithms, this presentation proposes such methods.