English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

espanolEn este trabajo se presentan los resultados obtenidos de un algoritmo basado en la Busqueda Tabu que fue programado utilizando el software comercial Wolfram Mathematica. En Wolfram Language se realizaron distintas implementaciones de instancias aleatorias y otras disponibles en la biblioteca TSPLIB, comparandolas posteriormente con los resultados provistos del mismo algoritmo en el ambiente de programacion Visual Basic 6.0. Las mejoras que se obtuvieron obedecen a la estructuracion de funciones predisenadas que permitieron analizar especificamente dos aspectos: la optimizacion de la solucion y su exploracion en las vecindadesdonde ya se conocia la presencia del optimo. Para ello, nos centramos en desarrollar una oscilacion en la matriz tabu de manera analoga a lo que se aplica a las soluciones en donde se percibe que podria estar el optimo global. Finalmente, se muestran resultados concluyentes que permiten observar el buen desempeno del programa Wolfram Mathematica para tratar este tipo de problemas, mediante la estructuracion adecuada de sus funciones internas. EnglishIn 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 allowed specifically analyzing two aspects: the optimization of the solution and its exploration in the neighborhoods where the presence of the optimum 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 Wolfram Mathematica to deal with this type of problems, through the properstructuring of its internal functions.

Método de búsqueda tabú para optimización combinatoria apoyado con el Software Wolfram Mathematica