A genetic algorithm approach for regrouping service sites

Authors:
Nashat Mansour;Hiba Tabbara;Tarek Dana
Affiliations:
Computer Science Program, Lebanese American University, P.O. Box 13-5053, Beirut, Lebanon;Computer Science Program, Lebanese American University, P.O. Box 13-5053, Beirut, Lebanon;Computer Science Program, Lebanese American University, P.O. Box 13-5053, Beirut, Lebanon
Venue:
Computers and Operations Research
Year:
2004

Citing 8
Cited 3

Genetic search and the dynamic facility layout problem

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
A genetic approach to the quadratic assignment problem

Computers and Operations Research - Special issue on genetic algorithms
On the distribution approach to location problems

Computers and Industrial Engineering
Approximation algorithms

Approximation algorithms
Practical Handbook of Genetic Algorithms

Practical Handbook of Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
An approach to determine storage locations of containers at seaport terminals

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Migrating birds optimization: a new meta-heuristic approach and its application to the quadratic assignment problem

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Regrouping service sites: a genetic approach using a voronoi diagram

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.