Cracking the Vehicle Routing Problem using Google’s OR-Tools
<p><em>Vehicle Routing Problem (VRP) is classified an </em><a href="https://en.wikipedia.org/wiki/NP-hardness" rel="noopener ugc nofollow" target="_blank"><em>NP-hard</em></a><em> problem, which simply said the bigger your options, the cost of finding the best solution will grow tremendously.</em></p>
<p><img alt="" src="https://miro.medium.com/v2/resize:fit:630/1*soaESmZK7ozgv5PGH8d7KA.png" style="height:316px; width:700px" /></p>
<p>Image copyright from <a href="https://www.transflynd.com/" rel="noopener ugc nofollow" target="_blank">Flynd</a></p>
<p>In the center, VRP can be said as an optimization problem, which usually goes like this:</p>
<p><em>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?</em></p>
<p><a href="https://medium.com/@samueladam/cracking-the-vehicle-routing-problem-using-googles-or-tools-f7a86d31dd11"><strong>Read More</strong></a></p>