Affiliation:
1. Faculty of Information Technology, American University of Madaba, Madaba, Jordan
Abstract
Abstract
Finding global optima for functions is a very important problem. Although a large number of methods have been proposed for solving this problem, more effective and efficient methods are greatly required. This paper proposes an innovative method that combines different effective techniques for speeding up the convergence to the solution and greatly improving its precision. In particular, the method uses feedback-guided random search technique to identify the promising regions of the domains and uses the biased mapping technique to focus the search on these promising regions, without ignoring the other regions of the domains. Therefore, at any point of time, the domain of each variable is entirely covered with much more emphasis on the promising regions. Experiments with our prototype implementation showed that our method is efficient, effective, and outperformed the state-of-art techniques.
Publisher
Oxford University Press (OUP)
Reference36 articles.
1. Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems;Rao;Int. J. Ind. Eng. Comput.,2016
2. Constrained optimization based on modified differential evolution algorithm;Mohamed;Inf. Sci.,2012
3. Optimization of high-dimensional functions through hypercube evaluation;Abiyev;Comput. Intell. Neurosci.,2015
4. JADE: self-adaptive differential evolution with optional external archive;Zhang;IEEE Trans. Evol. Comput.,2009