A genetic algorithm approach for regrouping service sites

LAUR Repository

Show simple item record

dc.contributor.author Mansour, Nashat
dc.contributor.author Dana, Tarek
dc.contributor.author Tabbara, Hiba
dc.date.accessioned 2016-01-26T08:32:55Z
dc.date.available 2016-01-26T08:32:55Z
dc.date.copyright 2004
dc.date.issued 2016-01-26
dc.identifier.issn 0305-0548 en_US
dc.identifier.uri http://hdl.handle.net/10725/2955
dc.description.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. Scope and purpose Public and private organizations are sometimes interested in consolidating their resources by regrouping their service sites into a smaller number of existing sites, henceforth referred to as service centers. These centers are intended to provide more economic and, perhaps, higher quality services to the clients. Also, the objective is to locate centers with balanced service loads such that the distances that the clients have to travel are kept low. A good example is where educational authorities regroup a number of geographically spread and ill-equipped public schools into a smaller number of schools that are better-equipped in terms of human and physical resources and that also reduces the overall cost. en_US
dc.language.iso en en_US
dc.title A genetic algorithm approach for regrouping service sites en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 198629170 en_US
dc.author.idnumber 198701700
dc.author.woa N/A en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal Computers & Operations Research en_US
dc.journal.volume 31 en_US
dc.journal.issue 8 en_US
dc.article.pages 1317-1333 en_US
dc.keywords Genetic algorithms en_US
dc.keywords Heuristics en_US
dc.keywords Graph decomposition en_US
dc.keywords Regrouping service sites en_US
dc.identifier.doi http://dx.doi.org/10.1016/S0305-0548(03)00093-5 en_US
dc.identifier.ctation Mansour, N., Tabbara, H., & Dana, T. (2004). A genetic algorithm approach for regrouping service sites. Computers & Operations Research, 31(8), 1317-1333. en_US
dc.author.email nmansour@lau.edu.lb
dc.author.email tdana@lau.edu.lb
dc.identifier.url http://www.sciencedirect.com/science/article/pii/S0305054803000935

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account