Approach a VRP case with Google OR-Tools

The classical vehicle routing problem (VRP) aims to find a set of routes at a minimal cost (finding the shortest path, minimizing the number of vehicles, etc.) beginning and ending the route at the depot. The study of the VRP has a considerable importance on the logistic systems. Many works on the VRP and its variants have been reported. In this study, we are not dealing with proposing a new algorithm to solve the VRP. Instead, we apply and practice an open source software, Google OR-Tools, for combinatorial optimization to obtain a feasible solution for the Hodges Warehouse and Logistics (Hodges) transportation data.