Circular local search for unconstrained optimisation problems
by Mohammed A. El-Shorbagy; Aboul Ella Hassanien; Ahmad Taher Azar
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 25, No. 1/2, 2023

Abstract: In this paper, a heuristics algorithm to solve unconstrained optimisation problems (UOPs) in two dimensions is proposed. This algorithm is called as: circular local search (CLS); where it is an efficient local search. The algorithm starts with an arbitrarily chosen point in the search domain. Secondly, a radius of CLS is defined around the current search point; where any point in this region is feasible. Finally, by an angle with a decay step length, CLS can move from current search point to obtain a new base point. The radius and the angle of CLS are modified during the search. CLS is tested on evaluated by many benchmark problems taken from the literature. According to the obtained numerical results, the proposed method show that its robustness and effectiveness.

Online publication date: Thu, 11-May-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email