Enhancing Sine–Cosine mutation strategy with Lorentz distribution for solving engineering design problems

Mousumi Banerjee, Vanita Garg (), Kusum Deep, Muhammed Basheer Jasser (), Salah Kamel and Ali Wagdy Mohamed ()
Additional contact information
Mousumi Banerjee: Galgotias University
Vanita Garg: Galgotias University
Kusum Deep: Indian Institute of Technology, Roorkee
Muhammed Basheer Jasser: Sunway University
Salah Kamel: Aswan University
Ali Wagdy Mohamed: Cairo University

International Journal of System Assurance Engineering and Management, 2024, vol. 15, issue 4, No 17, 1536-1567

Abstract: Abstract To solve global optimization, this paper proposes an improved sine–cosine algorithm to address the limitation of the basic sine cosine algorithm problems such as low solution precision and sluggish convergent speed. To overcome this weakness and to increase its search capabilities, two strategies were involved. Firstly, exponential decreasing conversion parameter which is used to balance the global exploration and local search ability of the algorithm. Secondly the Lorentz search strategy to generate new candidate individual and the capacity to avoid early convergence to effectively explore the search space. Sine Cosine Algorithm is developed to solve difficult problems, implying it has a higher accuracy and convergence rate based on the position updating equations incorporation of the objective function component and the trigonometric function term. Sometimes the search path does not search towards the global best and the result obtained is only a local optimum when solving multi-parameter optimization and highly ill-conditioned problems. Therefore, in the present study new method called Lorentz-SCA is introduced, which tries to alleviate all these problems. The suggested proposed algorithm has been put to the test against a standard set of 23 well-known benchmark functions and 12 highly non -linear engineering design problems to test the effectiveness of the design algorithm. The experimental results show that the proposed algorithm can effectively avoid falling into the local optimum, and it has faster convergence speed and higher optimization accuracy.

Keywords: Sine–cosine algorithm; Mutation; Lorentz distribution (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13198-023-02008-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ijsaem:v:15:y:2024:i:4:d:10.1007_s13198-023-02008-w

Ordering information: This journal article can be ordered from
http://www.springer.com/engineering/journal/13198

DOI: 10.1007/s13198-023-02008-w

Access Statistics for this article

International Journal of System Assurance Engineering and Management is currently edited by P.K. Kapur, A.K. Verma and U. Kumar

More articles in International Journal of System Assurance Engineering and Management from Springer, The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().