Title: Circular local search for unconstrained optimisation problems

Authors: Mohammed A. El-Shorbagy; Aboul Ella Hassanien; Ahmad Taher Azar

Addresses: Department of Mathematics, College of Science and Humanities Studies, Prince Sattam Bin Abdulaziz University, Al-Kharj, Kingdom of Saudi Arabia; Department of Basic Engineering Science, Faculty of Engineering, Menoufiya University, Shibin El Kom, Egypt; Scientific Research Group in Egypt (SRGE), Cairo, Egypt ' Faculty of Computers and Artificial Intelligence, Cairo University, Cairo, Egypt; Scientific Research Group in Egypt (SRGE), Cairo, Egypt ' College of Computer and Information Sciences, Prince Sultan University, Riyadh, Saudi Arabia; Faculty of Computers and Artificial Intelligence, Benha University, Benha, Egypt

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.

Keywords: circular local search; CLS; unconstrained optimisation; global optimisation.

DOI: 10.1504/IJAIP.2023.130821

International Journal of Advanced Intelligence Paradigms, 2023 Vol.25 No.1/2, pp.200 - 218

Received: 23 May 2018
Accepted: 04 Jul 2018

Published online: 11 May 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article