A genetic algorithm approach for regrouping service sites

@article{Mansour2004AGA,
  title={A genetic algorithm approach for regrouping service sites},
  author={Nashat Mansour and Hiba Tabbara and Tarek Dana},
  journal={Computers & OR},
  year={2004},
  volume={31},
  pages={1317-1333}
}
We address the problem of regrouping service sites into a smaller number of service centers, where each center serves a region. We propose a two-phase method, based on a weighted-graph problem formulation, for providing good suboptimal solutions. In the first phase, the graph is decomposed into the required number of subgraphs (regions) using a tuned hybrid genetic algorithm. The second phase finds a suitable center within each region by using a heuristic algorithm.