New population-based simple algorithms for solving global optimisation problems
by A. Baskar; M.A. Sai Balaji; Jitendra Kumar Katiyar; Bharti Nagpal; J. Rajesh Babu
International Journal of Mathematics in Operational Research (IJMOR), Vol. 27, No. 2, 2024

Abstract: Heuristic algorithms have effectively been used for solving global optimisation problems in a continuous space. It can be applied to both constrained and unconstrained problems. Presently, several population-based algorithms were proposed by researchers and are available in the literature but those are not enough to solve the issues. Therefore, this study has proposed five new population-based simple algorithms that do not require any tuning parameter. A different strategy was used for updating the solution set. Unlike other algorithms, the solution set is constructed using three or four expressions to ensure an effective search and move towards the optimal/near-optimal solution. Each expression is used to build the population partially and the best one is selected for the next iteration. Further, it is compared with the recent popular arithmetic optimisation algorithm (AOA) using different benchmark functions and test suites of CEC2019. The dimensions are varied from 2 to 1,000. The results demonstrate the better performance of new algorithms over AOA. However, five real-world problems with constraints are also analysed to further validate their efficacy.

Online publication date: Fri, 01-Mar-2024

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 Mathematics in Operational Research (IJMOR):
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 subs@inderscience.com