Out of 317,520 possible paths, only 6 minimize distance traveled equally. The vehicle routing problem defines n sites carrying an inventory that must be delivered back to the start point. In this rendition of the problem, 7 sites with a random inventory between 1 and 10 were placed randomly on a 100 by 100 grid.