Please use this identifier to cite or link to this item:
|Title:||Simplified 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.
|Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Citation:||Rocha, 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.|
|Appears in Collections:|
Files in This Item:
|Simplified_TS_random_revised.pdf||341,53 kB||Adobe PDF||View/Open|