Constructive heuristic for the vertex bisection problem
The Vertex Bisection Problem (VBP) consists in partitioning a generic graph into two equally– sized subgraphs and such that the number of vertices in with at least one adjacent vertex in is minimized. This problem is NP–hard with practical applications in the telecommunication industry. In this arti...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2020 |
| País: | México |
| Institución: | Tecnológico Nacional de México |
| Repositorio: | Redalyc-TNM |
| OAI Identifier: | oai:redalyc.org:47471673005 |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=47471673005 https://www.redalyc.org/journal/474/47471673005/ https://www.redalyc.org/journal/474/47471673005/html/ https://www.redalyc.org/journal/474/47471673005/47471673005.epub https://www.redalyc.org/journal/474/47471673005/movil |
| Access Level: | acceso abierto |
| Palabra clave: | Ingeniería Constructive algorithm Heuristic optimization Vertex Bisection Problem |
| Sumario: | The Vertex Bisection Problem (VBP) consists in partitioning a generic graph into two equally– sized subgraphs and such that the number of vertices in with at least one adjacent vertex in is minimized. This problem is NP–hard with practical applications in the telecommunication industry. In this article we propose a new constructive algorithm for VBP based on the Greedy Randomized Adaptive Search Procedure (GRASP) methodology. We call our algorithm CVBP. We compare CVBP with a previously published GRASP–based constructive algorithm (LIT) in order to assess the performance of our algorithm in practice. The results of the experiment showed that CVBP outperformed LIT by 75.83 % in solution quality. The validation of the experimental evidence was performed by the well–known Wilcoxon Signed Rank Sum Test. The test found statistical significance for a confidence level of 99.99 %. Therefore, we consider that our constructive heuristic is a good alternative to stochastically solve the Vertex Bisection Problem. |
|---|