Global Journal of Computer Science and Technology, D: Neural & Artificial Intelligence, Volume 22 Issue 1

Global Journal of Computer Science and Technology Volume XXII Issue I Version I 61 ( )D Year 2022 © 2022 Global Journals Vehicle Routing Problem with Time Window Constrain using KMeans Clustering to Obtain the Closest Customer RC101(25)- Fuel and cost Co efficient solution set and its multidimension interpolation for 25 customers RC101(50)- Fuel and cost Co efficient solution set and its multidimension interpolation for 50 customers RC101(75 )- Fuel and cost Co efficient solution set and its multidimension interpolation for 75 customers The Figueres 11 to figure 24 shows case 1 and case 2 shows optimal path, cost and fuel efficiency. shows the obtained Pareto optimal solution and its multidimensional linear interpolation by using the c101 (25) to c(101)100 customers test table for the above table 4. Figure 11: c201(25) vehicle distribution route Figure 12.: c201(50) vehicle distribution route Figure 13.: c201(75) vehicle distribution route Figure 14.: c201(100) vehicle distribution route Figure 15.: r201(25) vehicle distribution route Figure 16.: r201(50) vehicle distribution route