Paper The following article is Open access

An improved sine cosine algorithm with multiple updating ways for individuals

, , and

Published under licence by IOP Publishing Ltd
, , Citation Zheng-Ming Gao et al 2020 J. Phys.: Conf. Ser. 1678 012079 DOI 10.1088/1742-6596/1678/1/012079

1742-6596/1678/1/012079

Abstract

The sine cosine (SC) algorithm was very popular for scientists and engineers since it was raised in 2016, it was an efficient, simple algorithm that could be applied in real problems. In this paper, an improved version of the SC algorithm with multiple updating ways for individuals in swarms during iterations was proposed. Inspired by the slime mould (SM) algorithm, the algorithm was re-constructed and consequently, the individuals would update their positions in three ways, parts of them would be reinitialized, parts of them following the same traditional ways, and parts of them would explore further according to their own historical trajectories. Simulation experiments were carried out and the averaged results proved that the improved version would perform better, faster, and steadier than the original one.

Export citation and abstract BibTeX RIS

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

Please wait… references are loading.
10.1088/1742-6596/1678/1/012079