<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232020000400187</article-id>
<article-id pub-id-type="doi">10.22201/icat.24486736e.2020.18.4.1194</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Constructive heuristic for the vertex bisection problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Castillo-García]]></surname>
<given-names><![CDATA[Norberto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hernández-Hernández]]></surname>
<given-names><![CDATA[Paula]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Tecnológico Nacional de México Department of Engineering ]]></institution>
<addr-line><![CDATA[Altamira ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2020</year>
</pub-date>
<volume>18</volume>
<numero>4</numero>
<fpage>187</fpage>
<lpage>196</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232020000400187&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232020000400187&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232020000400187&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The Vertex Bisection Problem (VBP) consists in partitioning a generic graph into two equally-sized subgraphs  A and  B such that the number of vertices in  A with at least one adjacent vertex in  B 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.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Vertex Bisection Problem]]></kwd>
<kwd lng="en"><![CDATA[Constructive algorithm]]></kwd>
<kwd lng="en"><![CDATA[Heuristic optimization]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brandes]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Fleischer]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Vertex bisection is hard, too]]></article-title>
<source><![CDATA[Journal of Graph Algorithms and Applications]]></source>
<year>2009</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>119-31</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Castillo-García]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández]]></surname>
<given-names><![CDATA[P. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two new integer linear programming formulations for the vertex bisection problem]]></article-title>
<source><![CDATA[Computational Optimization and Applications]]></source>
<year>2019</year>
<volume>74</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>895-918</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duarte]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pantrigo]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gallego]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheurísticas]]></source>
<year>2007</year>
<publisher-loc><![CDATA[Madrid ]]></publisher-loc>
<publisher-name><![CDATA[Dykinson]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dunna]]></surname>
<given-names><![CDATA[E. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Reyes]]></surname>
<given-names><![CDATA[H. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Barrón]]></surname>
<given-names><![CDATA[L. E. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Simulación y análisis de sistemas con ProModel]]></source>
<year>2006</year>
<publisher-name><![CDATA[Pearson Educación]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fraire]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Terán-Villanueva]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[N. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Barbosa]]></surname>
<given-names><![CDATA[J. J. G.]]></given-names>
</name>
<name>
<surname><![CDATA[del Angel]]></surname>
<given-names><![CDATA[E. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rojas]]></surname>
<given-names><![CDATA[Y. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exact methods for the vertex bisection problem]]></article-title>
<source><![CDATA[Recent Advances on Hybrid Approaches for Designing Intelligent Systems]]></source>
<year>2014</year>
<page-range>567-77</page-range><publisher-name><![CDATA[Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[J. A. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Villanueva]]></surname>
<given-names><![CDATA[J. D. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Huacuja]]></surname>
<given-names><![CDATA[H. J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Barbosa]]></surname>
<given-names><![CDATA[J. J. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Flores]]></surname>
<given-names><![CDATA[J. A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Valdez]]></surname>
<given-names><![CDATA[G. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Saldivar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Control difuso del parámetro &#946; de una heurística constructiva tipo GRASP para el problema de la bisección de vértices de un grafo]]></article-title>
<source><![CDATA[Research Computing Science]]></source>
<year>2015</year>
<volume>92</volume>
<page-range>49-58</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Herrán]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Colmenar]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Duarte]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A variable neighborhood search approach for the vertex bisection problem]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2019</year>
<volume>476</volume>
<page-range>1-18</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Saran]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Srivastava]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new integer linear programming and quadratically constrained quadratic programming formulation for vertex bisection minimization problem]]></article-title>
<source><![CDATA[Journal of Automation Mobile Robotics and Intelligent Systems]]></source>
<year>2016</year>
<page-range>10</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Saran]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Srivastava]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Branch and bound algorithm for vertex bisection minimization problem]]></article-title>
<source><![CDATA[Advanced Computing and Communication Technologies]]></source>
<year>2016</year>
<page-range>17-23</page-range><publisher-loc><![CDATA[Singapore ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Saran]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Srivastava]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On minimizing vertex bisection using a memetic algorithm]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2016</year>
<volume>369</volume>
<page-range>765-87</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Klasing]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>1998</year>
<volume>83</volume>
<numero>1-3</numero>
<issue>1-3</issue>
<page-range>229-46</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Terán-Villanueva]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Fraire-Huacuja]]></surname>
<given-names><![CDATA[H. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[S. I.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Reyes]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Rocha]]></surname>
<given-names><![CDATA[J. A. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Santillán]]></surname>
<given-names><![CDATA[C. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Menchaca]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Cellular processing algorithm for the vertex bisection problem: Detailed analysis and new component design]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2019</year>
<volume>478</volume>
<page-range>62-82</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wilcoxon]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Individual comparisons by ranking methods]]></article-title>
<source><![CDATA[Biom Bull]]></source>
<year>1945</year>
<volume>1</volume>
<page-range>80-3</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
