Optimization of Multiple Vehicle Routing Problems Using Approximation Algorithms
This paper deals with generating of an optimized route for multiple Vehicle Routing Problems (mVRP). The authors used a methodology of clustering the given cities depending upon the number of vehicles and each cluster is allotted to a vehicle. K-Means clustering algorithm has been used for easy clustering of the cities. In this way the mVRP has been converted into VRP which is simple in computation compared to mVRP. After clustering, an optimized route is generated for each vehicle in its allotted cluster.