Investigation of Optimal Locations of Waste Containers for collecting waste from apartment with the Help of special cluster Graph
In this paper developed a model and to resolve a problem of the collection of waste from the apartment having up to fifth floor. Placed the waste collection containers in the ground and each dustbin is designated as vertex of a graph and each block as a cluster of similar type.
In this paper it is intended cluster analysis and travelling sales man problem to give the facilities to require points and find path in each cluster. Here considered a graph of G (12n+18, 38n+5) be a weighted graph for n ≥1 having 2n+3 clusters for n ≥1.