Chaotic Search-Based Salp Swarm Algorithm for Dealing with System of Nonlinear Equations and Power System Applications

The system of nonlinear equations (SNLEs) is one of the eminent problems in science and engineering, and it is still open to research. A new hybrid intelligent algorithm is presented in this research to solve SNLEs. It is a composite of the salp swarm algorithm (SSA) and chaotic search technique (CS...

Full description

Bibliographic Details
Main Authors: Mohammed A. El-Shorbagy, Islam M. Eldesoky, Mohamady M. Basyouni, Islam Nassar, Adel M. El-Refaey
Format: Article
Language:English
Published: MDPI AG 2022-04-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/10/9/1368
Description
Summary:The system of nonlinear equations (SNLEs) is one of the eminent problems in science and engineering, and it is still open to research. A new hybrid intelligent algorithm is presented in this research to solve SNLEs. It is a composite of the salp swarm algorithm (SSA) and chaotic search technique (CST). The proposed methodology is named chaotic salp swarm algorithm (CSSA). CSSA is designed as an optimization process, whereby feasible and infeasible solutions are updated to move closer to the optimum value. The use of this hybrid intelligent methodology aims to improve performance, increase solution versatility, avoid the local optima trap, speed up convergence and optimize the search process. Firstly, SNLEs are transformed into an optimization problem. Secondly, CSSA is used to solve this optimization problem: SSA is used to update the feasible solutions, whereas the infeasible solutions are updated by CST. One of the most significant advantages of the suggested technique is that it does not ignore infeasible solutions that are updated, because these solutions are often extremely near to the optimal solution, resulting in increased search effectiveness and effective exploration and exploitation. The algorithm’s mathematical model is presented in detail. Finally, the proposed approach is assessed with several benchmark problems and real-world applications. Simulation results show that the proposed CSSA is competitive and better in comparison to others, which illustrates the effectiveness of the proposed algorithm. In addition, a statistical analysis by the Wilcoxon rankings test between CSSA and the other comparison methods shows that all <i>p</i>-values are less than 0.05, and CSSA achieves negative ranks’ sum values (R<sup>−</sup>) much better than the positive ranks’ sum values (R<sup>+</sup>) in all benchmark problems. In addition, the results have high precision and show good agreement in comparison with similar methods, and they further proved the ability of CSSA to solve real-world applications.
ISSN:2227-7390