| Paper title: |
A Modified Sine–Cosine Algorithm with Improved Convergence for solving Optimization Problems |
| Published in: | Issue 2, (Vol. 19) / 2025 |
| Publishing date: | 2025-11-04 |
| Pages: | 20-27 |
| Author(s): | ALI Ayad Ramadhan |
| Abstract. | 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. |
| Keywords: | Sine Cosine Algorithm, Linear Searching Path, Nature-inspired Algorithm, Optimization |
| References: | [1]. X.-S. Yang, “Metaheuristic optimization: algorithm analysis and open problems,” in International symposium on experimental algorithms, Springer, 2011, pp. 21–32. [2]. X.-S. Yang, Engineering optimization: an introduction with metaheuristic applications. John Wiley & Sons, 2010. [3]. C. A. C. Coello, G. B. Lamont, and D. A. Van Veldhuizen, Evolutionary algorithms for solving multi-objective problems. Springer, 2007. [4]. S. M. Elsayed, R. A. Sarker, and D. L. Essam, “A new genetic algorithm for solving optimization problems,” Eng. Appl. Artif. Intell., vol. 27, pp. 57–69, 2014. [5]. M. Dorigo, M. Birattari, and T. Stutzle, “Ant colony optimization,” IEEE Comput. Intell. Mag., vol. 1, no. 4, pp. 28–39, 2006. [6]. R. Storn and K. Price, “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,” J. Glob. Optim., vol. 11, pp. 341–359, 1997. [7]. J. C. Bansal, H. Sharma, and S. S. Jadon, “Artificial bee colony algorithm: a survey,” Int. J. Adv. Intell. Paradig., vol. 5, no. 1–2, pp. 123–159, 2013. [8]. Y. Zhang, “Coverage optimization and simulation of wireless sensor networks based on particle swarm optimization,” Int. J. Wirel. Inf. Networks, vol. 27, no. 2, pp. 307–316, 2020. [9]. J. Zhang, L. Lai, S. Chen, and Y. Fang, “Multi-objective optimization of pump turbine based on improved partical swarm optimization algorithm,” J. Huazhong Univ. Sci. Tech.(Natural Sci. Ed., vol. 49, no. 3, pp. 86–92, 2021. [10]. S. Mirjalili, “SCA: a sine cosine algorithm for solving optimization problems,” Knowledge-based Syst., vol. 96, pp. 120–133, 2016. [11]. S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Adv. Eng. Softw., vol. 69, pp. 46–61, 2014. [12]. S. Mirjalili, A. H. Gandomi, S. Z. Mirjalili, S. Saremi, H. Faris, and S. M. Mirjalili, “Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems,” Adv. Eng. Softw., vol. 114, pp. 163–191, 2017. [13]. S. Mirjalili, “Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm,” Knowledge-based Syst., vol. 89, pp. 228–249, 2015. [14]. S. Gupta and K. Deep, “A hybrid self-adaptive sine cosine algorithm with opposition based learning,” Expert Syst. Appl., vol. 119, pp. 210–230, 2019. [15]. L. Liu, H. Xu, B. Wang, and C. Ke, “Multi-strategy fusion of sine cosine and arithmetic hybrid optimization algorithm,” Electronics, vol. 12, no. 9, p. 1961, 2023. [16]. K. Hussain, M. N. M. Salleh, S. Cheng, and R. Naseem, “Common benchmark functions for metaheuristic evaluation: A review,” JOIV Int. J. Informatics Vis., vol. 1, no. 4–2, pp. 218–223, 2017. [17]. M. Jamil and X.-S. Yang, “A literature survey of benchmark functions for global optimisation problems,” Int. J. Math. Model. Numer. Optim., vol. 4, no. 2, pp. 150–194, 2013. [18]. M. Wang and G. Lu, “A modified sine cosine algorithm for solving optimization problems,” Ieee Access, vol. 9, pp. 27434–27450, 2021. [19]. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of ICNN’95-international conference on neural networks, ieee, 1995, pp. 1942–1948. |
| Back to the journal content | |
