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...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2011 |
| País: | Brasil |
| Recursos: | Centro Federal de Educação Tecnológica de Campos dos Goytacazes |
| Repositório: | Vértices (Campos dos Goitacazes. Online) |
| Idioma: | português |
| OAI Identifier: | oai:ojs.editoraessentia.iff.edu.br:article/1767 |
| Acesso em linha: | https://editoraessentia.iff.edu.br/index.php/vertices/article/view/1809-2667.20110023 |
| Access Level: | Acceso aberto |
| Palavra-chave: | p-median Combinatory optimization GRASP Heuristic p-mediana Otimização combinatória Heurística |
| Resumo: | 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. |
|---|