*3.2. Solution Approaches: Weighted k-Means Algorithm*

The target zoning problem *P*<sup>∗</sup> *zoning* is solved by a weighted *K*-means algorithm (WKMA), based on the Hartigan algorithm for *k*-means clustering [32]. Instead of using the mean and squared distance when updating centroids, we use the weighted mean and squared weighted distance in order to account for the arrival rate. The WKMA implementation is described in Algorithm 1. The computational complexity of the algorithm is *<sup>γ</sup>* · O(*<sup>K</sup>* · *<sup>D</sup>*), where *γ* is the number of iterations performed by the algorithm until the clustering solution is converged, and *D* is the number of demand nodes.

