Cracking the Vehicle Routing Problem using Google???s OR-Tools

Vehicle Routing Problem (VRP) is classified an NP-hard problem, which simply said the bigger your options, the cost of finding the best solution will grow tremendously.

Image copyright from Flynd

In the center, VRP can be said as an optimization problem, which usually goes like this:

Given my capacity of N fleet, and a set of M locations that needs to be visited, how can I achieve the best combination possible?

Read More