title: k-Traveling Repairmen Problem, with multiple repairmen visiting the same job lowering service time
body: <p>For my Thesis, I want to create an algorithm that optimizes the k-Traveling Repairmen Problem, with the extension that sending multiple repairmen to the same location lowers the service time. I cannot find any literature on this topic, and I was wondering if this has ever been studied before?</p>
  <p>I have looked at variants of the VRP, TSP, TRP, OP, but am yet to come across anything like my problem.</p>