Article ID: | iaor20043461 |
Country: | United Kingdom |
Volume: | 31 |
Issue: | 8 |
Start Page Number: | 1317 |
End Page Number: | 1333 |
Publication Date: | Jul 2004 |
Journal: | Computers and Operations Research |
Authors: | Mansour Nashat, Tabbara Hiba, Dana Tarek |
Keywords: | service, heuristics |
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.