<?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>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332019000100099</article-id>
<article-id pub-id-type="doi">10.15517/rmta.v26i1.35528</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Método de búsqueda tabú para optimización combinatoria apoyado con el software wolfram mathematica]]></article-title>
<article-title xml:lang="en"><![CDATA[Tabu search method for combinatorial optimization supported with wolfram mathematica software]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[López]]></surname>
<given-names><![CDATA[Erasmo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vílchez]]></surname>
<given-names><![CDATA[Enrique]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Ministerio de Educación Pública Colegio Técnico Profesional de Upala ]]></institution>
<addr-line><![CDATA[Upala ]]></addr-line>
<country>Costa Rica</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Nacional Escuela de Informática ]]></institution>
<addr-line><![CDATA[ Heredia]]></addr-line>
<country>Costa Rica</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2019</year>
</pub-date>
<volume>26</volume>
<numero>1</numero>
<fpage>99</fpage>
<lpage>114</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332019000100099&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332019000100099&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332019000100099&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen [14] En este trabajo se presentan los resultados obtenidos de un algoritmo basado en la Búsqueda Tabú que fue programado utilizando el software comercial Wolfram Mathematica. En Wolfram Language se realizaron dis- tintas implementaciones de instancias aleatorias y otras disponibles en la biblioteca TSPLIB, comparándolas posteriormente con los resultados pro- vistos del mismo algoritmo en el ambiente de programación Visual Ba- sic 6.0. Las mejoras que se obtuvieron obedecen a la estructuración de funciones prediseñadas que permitieron analizar específicamente dos as- pectos: la optimización de la solución y su exploración en las vecindades donde ya se conocía la presencia del óptimo. Para ello, nos centramos en desarrollar una oscilación en la matriz tabú de manera análoga a lo que se aplica a las soluciones en donde se percibe que podría estar el óptimo global. Finalmente, se muestran resultados concluyentes que permiten ob- servar el buen desempeño del programa Wolfram Mathematica para tratar este tipo de problemas, mediante la estructuración adecuada de sus fun- ciones internas.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract [18] In this paper we present the results obtained from an algorithm based on the Tabu Search that was programmed using the commercial software Wolfram Mathematica. In Wolfram Language different implementations of random instances and others available in the library TSPLIB were made, comparing them later, with the results provided with the same algorithm, in the programming environment Visual Basic 6.0. The improvements that were obtained are due to the structuring of predesigned functions that al- lowed specifically analyzing two aspects: the optimization of the solution and its exploration in the neighborhoods where the presence of the opti- mum was already known. For this we focus on developing an oscillation in the tabu matrix analogously to what is applied to solutions where it is perceived that the global optimum could be. Finally, conclusive results are shown that allow observing the good performance of the program Wol- fram Mathematica to deal with this type of problems, through the proper structuring of its internal functions.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[software comercial]]></kwd>
<kwd lng="es"><![CDATA[búsqueda tabú]]></kwd>
<kwd lng="es"><![CDATA[oscilación]]></kwd>
<kwd lng="es"><![CDATA[funciones inter- nas]]></kwd>
<kwd lng="es"><![CDATA[problema del agente viajero]]></kwd>
<kwd lng="es"><![CDATA[solución óptima]]></kwd>
<kwd lng="en"><![CDATA[commercial software]]></kwd>
<kwd lng="en"><![CDATA[tabu search]]></kwd>
<kwd lng="en"><![CDATA[oscillation]]></kwd>
<kwd lng="en"><![CDATA[internal functions]]></kwd>
<kwd lng="en"><![CDATA[traveling salesman problem]]></kwd>
<kwd lng="en"><![CDATA[optimal solution]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De los Cobos]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Goddard]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gutiérrez]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bús- queda y Exploración Estocástica.]]></source>
<year>2010</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Autónoma Metropolitana]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search, part I]]></article-title>
<source><![CDATA[ORSA Journal on Computing]]></source>
<year>1989</year>
<volume>1</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>190-206</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search, part II]]></article-title>
<source><![CDATA[ORSA Journal on Computing]]></source>
<year>1990</year>
<volume>2</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>4-31</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Laguna]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Colin]]></surname>
<given-names><![CDATA[R. Reeves]]></given-names>
</name>
</person-group>
<source><![CDATA[Modern Heuristic Techniques for Combinatorial Problems]]></source>
<year>1993</year>
<page-range>70-150</page-range><publisher-loc><![CDATA[Oxford ]]></publisher-loc>
<publisher-name><![CDATA[Blackwell Sci- entific Publications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Melián]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Búsqueda tabú]]></article-title>
<source><![CDATA[Revista Iberoamericana de Inteligencia Artificial]]></source>
<year>2003</year>
<volume>7</volume>
<numero>19</numero>
<issue>19</issue>
<page-range>29-48</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[El Agente Viajero: Un Algoritmo Determinístico.]]></source>
<year>2011</year>
<publisher-loc><![CDATA[Heredia, Costa Rica ]]></publisher-loc>
<publisher-name><![CDATA[, Facultad de Ciencias Exactas y Naturales, Universidad Nacional]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Salas]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Murillo]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[El problema del agente via- jero: un algoritmo determinístico usando búsqueda tabú]]></article-title>
<source><![CDATA[Revista de Matemática: Teoría y Aplicaciones]]></source>
<year>2014</year>
<volume>21</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>127-44</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reinelt]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[TSPLIB, travelling salesman problem]]></source>
<year>2004</year>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vílchez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Álgebra Lineal Apoyada con Mathematica]]></source>
<year>2012</year>
<publisher-loc><![CDATA[Cartago, Costa Rica ]]></publisher-loc>
<publisher-name><![CDATA[Editorial Tecnológica de Costa Rica]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vílchez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[VilCretas package: educational resource through the use of Mathematica software in the field of discrete mathematics]]></source>
<year>2016</year>
<conf-name><![CDATA[ Wol- fram Technology Conference]]></conf-name>
<conf-date>2016</conf-date>
<conf-loc>Champaign, Illinois </conf-loc>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vílchez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Matemática Discreta a Través del Uso del Paquete Vil- Cretas]]></article-title>
<source><![CDATA[Revista Digital Matemática, Educación e Internet, Costa Rica]]></source>
<year>2018</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="">
<collab>Wolfram Mathematica 11: Documentation Center</collab>
<source><![CDATA[Mathemat- ica functions and tutorials.]]></source>
<year>2017</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
