ئەز   Ayad Ramadhan Ali

Swarm intelligence–based metaheuristics have emerged as powerful tools for solving complex optimization problems due to their adaptability and ease of implementation. Among them, the sine–cosine algorithm (SCA) is a well-known method, but it often suffers from slow convergence and premature stagnation in local optima. To address these limitations, this study introduces a modified sine–cosine algorithm (MSCA) that incorporates an adaptive operator to achieve a better balance between global exploration and local exploitation. The proposed MSCA was extensively evaluated using 23 classical benchmark functions, categorized into unimodal, multimodal, and fixed-dimension multimodal groups. Its performance was benchmarked against several state-of-the-art algorithms, and the standard SCA. Experimental results demonstrate that MSCA consistently outperforms the competitor algorithms in terms of convergence speed, accuracy, and robustness. Furthermore, statistical validation using the Wilcoxon rank-sum test and Friedman test confirms the significant superiority and scalability of MSCA across high-dimensional search spaces. Overall, the proposed MSCA offers a reliable and effective optimization framework with strong potential for addressing diverse and large-scale real-world applications.

In this study, we present a novel optimization technique, known as the Three-Group Exploration Strategy (TGES) algorithm, specifically inspired by collaborative group dynamics often seen in problem-solving. We showed wide testing on 26 widely-recognized benchmark functions, providing a severe comparison between TGES and several well-established optimization algorithms. These results highlight TGES’s effectiveness in finding optimal solutions with high reliability and accuracy. Furthermore, the practical applications of TGES are demonstrated by successfully solving six interesting, real-world engineering problems, showcasing its adaptability and robustness. The experimental results indicate that TGES not only exhibits superior optimization performance, but it also achieves faster convergence and higher solution quality compared to several leading algorithms. This finds TGES algorithm as a strong and adaptable tool for solving a variety of engineering optimization problems.

In this paper, we propose two hybrid gradient based methods and genetic algorithm for solving systems of linear equations with fast convergence. The first proposed hybrid method is obtained by using the steepest descent method and the second one by the Cauchy-Barzilai-Borwein method. These algorithms are based on minimizing the residual of solution which has genetic characteristics. They are compared with the normal genetic algorithm and standard gradient based methods in order to show the accuracy and the convergence speed of them. Since the conjugate gradient method is recommended for solving large sparse and symmetric positive definite matrices, we also compare the numerical results of our proposed algorithms with this method. The numerical results demonstrate the robustness and efficiency of the proposed algorithms. Moreover, we observe that our hybridization of the CBB method and genetic algorithm gives more accurate results with faster convergence than other mentioned methods in all given cases.

The steepest descent (SD) method is well-known as the simplest method in optimization. In this paper, we propose a new SD search direction for solving system of linear equations Ax = b. We also prove that the proposed SD method with exact line search satisfies descent condition and possesses global convergence properties. This proposed method is motivated by previous work on the SD method by Zubai’ah-Mustafa-Rivaie-Ismail (ZMRI)[2]. Numerical comparisons with a classical SD algorithm and ZMRI algorithm show that this algorithm is very effective depending on the number of iterations (NOI) and CPU time.