Rana Z. Al-Kawaz, Huda I. Ahmed, Abbas Y. Al-Bayati
الملخص الانجليزي
Recent modern optimization algorithms are often very successful in solving NP-hard improvement problems. One of the main disadvantages of the search algorithm in cuckoo (CS) is the weakness of its ability as a local search algorithm and slow in its speed of convergence, which results in a limited access to the target. There are two categories that can be solved by this algorithm: First, the unconstrained functions are solved. Second, which is the focus of this article, is the constraint functions and how to deal with them using a rational formula of the Barrier function. The results show that the CRB (Cuckoo & Rational Barrier Function) algorithm has a better convergence velocity than the algorithm (CS) by observing the separation of the numerical results of the browser in which the accuracy of the new algorithm on some engineering functions.
تاريخ النشر
01/09/2018
الناشر
Transstellar Journal Publications & Research Consultancy (TJPRC)