Multi-Objective Sectoring and Balancing Algorithm

This is a description of a Multi-Objective Sectoring and Balancing Algorithm which distributes a set of points in order to obtain several sectors (clusters) that are compact and balanced. The objective function contains two objectives, the first one is to balance the potential (sum of potentials in each cluster), the second one is to balance the total distance of each cluster (sum of euclidean distances between the centroid of the cluster and all its customers). The third objective is the compactness, which is not represented in the objective function, but, it will be kept during the algorithm. The sweep heuristic is used to build the initial solution which will be enhanced in order to obtain compact clusters before performing the local search procedure. The algorithm gives good results on real instances within limited time.