GRASP heuristic for p-median problem applied to the location of concentrators
Several real practical situations, such as location of depots, hospitals and telecommunications devices (hubs, cellular towers, etc.), can be seen as a p-median problem. This paper presents a proposal for solving the p-median problem based on the backbone network of computers that will be installed...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2011 |
| Country: | Brasil |
| Institution: | Centro Federal de Educação Tecnológica de Campos dos Goytacazes |
| Repository: | Vértices (Campos dos Goitacazes. Online) |
| Language: | Portuguese |
| OAI Identifier: | oai:ojs.editoraessentia.iff.edu.br:article/1767 |
| Online Access: | https://editoraessentia.iff.edu.br/index.php/vertices/article/view/1809-2667.20110023 |
| Access Level: | Open access |
| Keyword: | p-median Combinatory optimization GRASP Heuristic p-mediana Otimização combinatória Heurística |
| Summary: | Several real practical situations, such as location of depots, hospitals and telecommunications devices (hubs, cellular towers, etc.), can be seen as a p-median problem. This paper presents a proposal for solving the p-median problem based on the backbone network of computers that will be installed at the Federal Fluminense Institute (IFF). This type of problem is known in literature as a problem of locating concentrators. To solve the problem cited was proposed a GRASP heuristic. Computational tests performed show that the heuristic developed in this work has reached satisfactory results. |
|---|