Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/23260
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGupta S.-
dc.contributor.authorDeep, K.-
dc.contributor.authorMirjalili S.-
dc.contributor.authorKim J.H.-
dc.date.accessioned2022-03-22T08:14:02Z-
dc.date.available2022-03-22T08:14:02Z-
dc.date.issued2020-
dc.identifier.citationExpert Systems with Applications, 154-
dc.identifier.issn9574174-
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2020.113395-
dc.identifier.urihttp://repository.iitr.ac.in/handle/123456789/23260-
dc.description.abstractInspired by the mathematical characteristics of sine and cosine trigonometric functions, the Sine Cosine Algorithm (SCA) has shown competitive performance among other meta-heuristic algorithms. However, despite its sufficient global search ability, its low exploitation ability and immature balance between exploitation and exploration remain weaknesses. In order to improve Sine Cosine Algorithm (SCA), this paper presents a modified version of the SCA called MSCA. Firstly, a non-linear transition rule is introduced instead of a linear transition to provide comparatively better transition from the exploration to exploitation. Secondly, the classical search equation of the SCA is modified by introducing the leading guidance based on the elite candidate solution. When the above proposed modified search mechanism fails to provide a better solution, in addition, a mutation operator is used to generate a new position to avoid the situation of getting trapped in locally optimal solutions during the search. Thus, the MSCA effectively maximizes the advantages of proposed strategies in maintaining a comparatively better balance of exploration and exploitation as compared to the classical SCA. The validity of the MSCA is tested on a set of 33 benchmark optimization problems and employed for training multilayer perceptrons. The numerical results and comparisons among several algorithms show the enhanced search efficiency of the MSCA. © 2020 Elsevier Ltd-
dc.language.isoen_US-
dc.publisherElsevier Ltd-
dc.relation.ispartofExpert Systems with Applications-
dc.subjectAlgorithm-
dc.subjectBenchmark-
dc.subjectEngineering optimization problems-
dc.subjectExploration and exploitation-
dc.subjectGenetic Algorithm-
dc.subjectGrey Wolf Optimizer-
dc.subjectMultilayer perceptron-
dc.subjectOptimization-
dc.subjectParticle Swarm Optimization-
dc.subjectSine Cosine Algorithm-
dc.titleA modified Sine Cosine Algorithm with novel transition parameter and mutation operator for global optimization-
dc.typeArticle-
dc.scopusid57209786185-
dc.scopusid8561208900-
dc.scopusid51461922300-
dc.scopusid35100406500-
dc.affiliationGupta, S., Institute for Mega Construction, Korea University, Seoul, 02841, South Korea-
dc.affiliationDeep, K., Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand 247667, India-
dc.affiliationMirjalili, S., Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, 90 Bowen Terrace, Fortitude Valley, Queensland 4006, Australia-
dc.affiliationKim, J.H., School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, 02841, South Korea-
dc.description.correspondingauthorDeep, K.; Department of Mathematics, India; email: kusumfma@iitr.ac.in-
Appears in Collections:Journal Publications [MA]

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.