Evidence map›Paper›PMID 34358237›Full record

ArticlePloS one2021

A new Multi Sine-Cosine algorithm for unconstrained optimization problems.

Muhammad Zubair Rehman, Abdullah Khan, Rozaida Ghazali, Muhammad Aamir, Nazri Mohd Nawi

Abstract read
In one paragraph

Article in PloS one, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Muhammad Zubair RehmanSoft Computing & Data Mining Centre (SMC), Faculty of Computer Science & Information Technology (FSKTM), Universiti Tun Hussein Onn Malaysia, Parit Raja, Malaysia.ORCID 0000-0003-2589-4189
Abdullah KhanInstitute of Computer Sciences and IT (ICS/IT), The University of Agriculture, Peshawar, Pakistan.
Rozaida GhazaliSoft Computing & Data Mining Centre (SMC), Faculty of Computer Science & Information Technology (FSKTM), Universiti Tun Hussein Onn Malaysia, Parit Raja, Malaysia.ORCID 0000-0003-0119-0873
Muhammad AamirSoft Computing & Data Mining Centre (SMC), Faculty of Computer Science & Information Technology (FSKTM), Universiti Tun Hussein Onn Malaysia, Parit Raja, Malaysia.ORCID 0000-0002-4999-7740
Nazri Mohd NawiSoft Computing & Data Mining Centre (SMC), Faculty of Computer Science & Information Technology (FSKTM), Universiti Tun Hussein Onn Malaysia, Parit Raja, Malaysia.ORCID 0000-0003-0685-7892

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The Sine-Cosine algorithm (SCA) is a population-based metaheuristic algorithm utilizing sine and cosine functions to perform search. To enable the search process, SCA incorporates several search parameters. But sometimes, these parameters make the search in SCA vulnerable to local minima/maxima. To overcome this problem, a new Multi Sine-Cosine algorithm (MSCA) is proposed in this paper. MSCA utilizes multiple swarm clusters to diversify & intensify the search in-order to avoid the local minima/maxima problem. Secondly, during update MSCA also checks for better search clusters that offer convergence to global minima effectively. To assess its performance, we tested the MSCA on unimodal, multimodal and composite benchmark functions taken from the literature. Experimental results reveal that the MSCA is statistically superior with regards to convergence as compared to recent state-of-the-art metaheuristic algorithms, including the original SCA.

Identifiers

PMID34358237
PMCPMC8345889

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.