title: Vehicle routing using Google Maps api
body: <p>Currently I am developing a piece of software that solves vehicle routing problem using <strong>Google Maps Javascript API v3</strong>.</p>
  
  <p>The task is the following:</p>
  
  <ul>
  <li>I have several vehicles along the town</li>
  <li>I have lots of destination points along the town </li>
  <li>The number of destination points is greater than the number of available vehicles</li>
  <li>I need to calculate optimal routes through multiple points for every vehicle to minimize the average transportation time</li>
  </ul>
  
  <p>My naive approach is the following:</p>
  
  <ul>
  <li>find nearest points for each vehicle using k-means clustering with the raw euclidean distance between map points (LngLat points) </li>
  <li>for each vehicle for each destination point from the set of vehicle's nearest destination points calculate optimal routes using other destination points as intermediate points and using <code>optimize:true</code> option and find routes with smallest average transportation time</li>
  </ul>
  
  <p>It seems that this approach may give results which are not optimal. </p>
  
  <p>Is there better approach which provides better accuracy and/or smaller amount of API requests.</p>