Title: New population-based simple algorithms for solving global optimisation problems

Authors: A. Baskar; M.A. Sai Balaji; Jitendra Kumar Katiyar; Bharti Nagpal; J. Rajesh Babu

Addresses: Panimalar Institute of Technology, Chennai, India ' BSA Crescent Institute of Science and Technology, Chennai, India ' SRM Institute of Science and Technology, Chennai, India ' NSUT East Campus, New Delhi, India ' K.L.N. College of Engineering, Tamil Nadu, India

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.

Keywords: population-based; benchmark function; arithmetic optimisation algorithm; AOA; trigonometric algorithm; constrained optimisation; unconstrained optimisation.

DOI: 10.1504/IJMOR.2024.137039

International Journal of Mathematics in Operational Research, 2024 Vol.27 No.2, pp.199 - 222

Received: 15 Jul 2022
Accepted: 07 Jan 2023
Published online: 01 Mar 2024 *

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