Is there a clustering method with fixed starting centers?

Question

Clustering

Goodnight. I am developing a model of cargo transportation. There are coordinates of the centers (they are warehouses), they are fixed. And also there are several tens or hundreds of orders for the supply of goods (they also have their own coordinates on the map). And this whole thing needs to be divided into zones (clusters) in which goods will be delivered: there is a separate car for each zone. So the question arose: what method (algorithm) is most suitable for this scheme? I know there is a k-means method, but there the centers are not fixed, they are calculated by the algorithm itself. I have a slightly different situation, but similar, because I also need to cluster. Can you make a simplified k-means method with already given centers, or what do you recommend?

Answer 1

If the center is fixed, then the clusters are fixed - measure the distances from each point to each warehouse, attach the point to the warehouse with the smallest distance to it - that's your clusters ...
Thus, clustering should be replaced by calculating distances.
__________
You can also use graph theory to solve this problem.