Solving Equations Systems by Spider Optimization Algorithm

Liviu Octavian Mafteiu-Scai, Roxana Teodora Mafteiu-Scai, Gabriel Gisca

© 2024 Liviu Octavian Mafteiu-Scai, published by UIKTEN. This work is licensed under the Creative Commons Attribution-NonCommercial 4.0 International. (CC BY-NC 4.0).

Citation Information: SAR Journal. Volume 7, Issue 3, Pages 169-177, ISSN 2619-9955, https://doi.org/10.18421/SAR73-01, September 2024.

Received: 31 July 2024.
Revised:   03 September 2024.
Accepted: 07 September 2024.
Published: 27 September 2024.

Abstract:

In this paper four algorithms for solving linear equations systems, based on Social Spider Optimization (SSO) algorithm are proposed, and the solving process is being viewed as an optimization problem. Experimental results showed that the proposed algorithms are able to find the solution vector for such a linear system even when math classical methods fail. One of the best improvements of SSO in the case of our problem consists in modifying the search space for each component of the system solution vector depending on the global fitness and the particular fitness of vector solution components.

Keywords – linear equation systems, social spider optimization, metaheuristics, convergence, runtime.

                   

                                                                      Full text PDF