title: Travelling Salesman with multiple salesmen with a limit on number of cities per salesman?
body: <p><strong>Problem:</strong> I need to drop <strong>(n)</strong> employees from office to their homes(co-ordinates available). I have <strong>(x)</strong> 7-seater &amp; <strong>(y)</strong> 4-seater cabs available.</p>
  
  <ol>
  <li><p>I have to design an algorithm to drop all the employees to their homes while travelling minimum distance.</p></li>
  <li><p>Also, the algorithm must tell me how many 7-seater or/and 4-seater vehicles I must choose so as to travel minimum distance.</p></li>
  </ol>
  
  <p>eg. If I have 15 employees then the algorithm may tell me to use 1 (7-seater) cab &amp; 2 (4-seater) cab &amp; have the employees in each cab as following:</p>
  
  <p>[(E2, E4, E6, E8), (E1, E3, E5, E7, E9, E10, E12), (E11, E13, E14, E15)]</p>
  
  <p><strong>Approach:</strong> I'm thinking of this as a Travelling Salesman Problem with multiple salesmen with an upper limit on number of cities each can travel. Also salesmen do not need to come back to the origin. Ant's colony problem came to my mind, but I can't really choose wisely which algorithm to choose</p>
  
  <p><strong>Requirement:</strong> I really need the ALGORITHM. Either TSP or Ant's colony, doesn't matter. I'll welcome opinions, but I really need the ALGORITHM.</p>