Genetic algorithm using a Voronoi Diagram for Regrouping problem

Genetic algorithm using a Voronoi Diagram for Regrouping problem

&nbsp;&nbsp;In this paper, we consider the problem of regrouping a number of service sites into a smaller number of service sites called centers. Each service site is represented as a point in the plane and has an associated value of service demand. We aim to group the sites so that each group has the balanced service demand and the sum of distances from the sites in the group to their corresponding center is minimized.<BR>&nbsp;&nbsp;To solve this problem, we propose a hybrid genetic algorithm that is combined with Voronoi diagrams. We provide a variety of experimental results by changing the weights of the two factors: service demands and distances. Our hybrid algorithm finds good approximate solutions in a shorter computation time in comparison with optimal solution by integer programming.