Distribution planning using capacitated clustering and vehicle routing problem: A case of Indian cooperative dairy

摘要: The purpose of this paper is to reduce the distribution cost an Indian cooperative dairy. reduction was achieved with application clustering method (k-means clustering) and capacitated vehicle routing problem (cheapest link algorithm (CLA)).,Capacitated k-means used split delivery locations into similar size groups (i.e. clusters) based on proximity without exceeding a specified total cluster capacity. Each would be served by local stockist. CLA then find routes from dairy depot) stockist in each all other within cluster.,K-means suggested optimal which vehicles will run. complete able provide solution 30 s.,Clustering use heterogeneous fleet can result considerable savings daily operational cost.,Most research related demand improve has been theoretical, do not take account real-world limitations like vehicle’s specific limitations. authors tried address that gap taking case compared existing This work dairies or companies according their scenario.