Please use this identifier to cite or link to this item:

TitleSimplified tabu search with random-based searches for bound constrained global optimization
Author(s)Rocha, Ana Maria A. C.
Costa, M. Fernanda P.
Fernandes, Edite Manuela da G. P.
KeywordsGlobal optimization
Random searches
Tabu search
Issue dateJan-2020
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
CitationRocha, A. M. A., Costa, M. F. P., & Fernandes, E. M. (2020, July). Simplified Tabu Search with Random-Based Searches for Bound Constrained Global Optimization. In International Conference on Computational Science and Its Applications (pp. 606-619). Springer, Cham.
Abstract(s)This paper proposes a simplified version of the tabu search algorithm that solely uses randomly generated direction vectors in the exploration and intensification search procedures, in order to define a set of trial points while searching in the neighborhood of a given point. In the diversification procedure, points that are inside any already visited region with a relative small visited frequency may be accepted, apart from those that are outside the visited regions. The produced numerical results show the robustness of the proposed method. Its efficiency when compared to other known metaheuristics available in the literature is encouraging.
TypeConference paper
Publisher version
AccessOpen access
Appears in Collections:CAlg - Artigos em livros de atas/Papers in proceedings

Files in This Item:
File Description SizeFormat 
Simplified_TS_random_revised.pdf341,53 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID