Toyota Kirloskar Auto Parts (TKAP)

Abstract

The Vehicle Routing Problem (VRP) calls for the determination of the optimal set of routes to be performed by a fleet of vehicles to serve a given set of customers or take material from a given set of suppliers, and it is one of the most important, and studied, combinatorial optimization problems. The vehicle begins and ends at the same node i.e. the plant with consideration that it fulfils the demand at each travelling node. The travelling vehicle has capacity constraint and Distances between all the suppliers and plant and among the suppliers are known. Here we used the Google OR tools in python to develop the code. Based on the code the optimised milk run routes were found out along with the appropriate truck.