Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
Revista Ingenierías Universidad de Medellín
Print version ISSN 1692-3324
Abstract
GARCIA, Andrea; RESTREPO, Ángela and VELASQUEZ, Juan D.. CHAOS-BASED REPETITIVE RANDOM SEARCH. Rev. ing. univ. Medellín [online]. 2013, vol.12, n.22, pp.137-146. ISSN 1692-3324.
In this paper, we present a modification of the repetitive random search algorithm. In our proposal, we change the fixed parameters which values are set by the user, by deterministic values following a chaotic map. The proposed algorithm is used to optimize four well known test functions for 10, 20 and 30 dimensions. For all cases, our proposal converges to better points that the optimal points obtained using the traditional version with fixed values in the parameters. The obtained results encourage us to continue the development and testing of the proposal algorithm with a major suite of test functions, and to compare it with other well established heuristic algorithms.
Keywords : Algorithms; chaos; minimization methods; operations research; optimization methods; search methods.