Evidence map›Paper›PMID 35500006›Full record

ArticlePloS one2022

A twinning bare bones particle swarm optimization algorithm.

Jia Guo, Binghua Shi, Ke Yan, Yi Di, Jianyu Tang, Haiyang Xiao, Yuji Sato

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
5citing 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

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
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

7 authors.

Jia GuoSchool of Information and Communication Engineering, Hubei University of Economics, Wuhan, China.ORCID 0000-0001-5042-4045
Binghua ShiSchool of Information and Communication Engineering, Hubei University of Economics, Wuhan, China.ORCID 0000-0003-4469-5759
Ke YanSmart Business Department of China Construction Third Engineering Bureau Installation Engineering Co., Ltd., Wuhan, China.
Yi DiSchool of Information and Communication Engineering, Hubei University of Economics, Wuhan, China.
Jianyu TangSchool of Information and Communication Engineering, Hubei University of Economics, Wuhan, China.
Haiyang XiaoSchool of Information and Communication Engineering, Hubei University of Economics, Wuhan, China.
Yuji SatoFaculty of Computer and Information Science, Hosei University, Tokyo, Japan.ORCID 0000-0001-8387-7710

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

A twinning bare bones particle swarm optimization(TBBPSO) algorithm is proposed in this paper. The TBBPSO is combined by two operators, the twins grouping operator (TGO) and the merger operator (MO). The TGO aims at the reorganization of the particle swarm. Two particles will form as a twin and influence each other in subsequent iterations. In a twin, one particle is designed to do the global search while the other one is designed to do the local search. The MO aims at merging the twins and enhancing the search ability of the main group. Two operators work together to enhance the local minimum escaping ability of proposed methods. In addition, no parameter adjustment is needed in TBBPSO, which means TBBPSO can solve different types of optimization problems without previous information or parameter adjustment. In the benchmark functions test, the CEC2014 benchmark functions are used. Experimental results prove that proposed methods can present high precision results for various types of optimization problems.

Indexed as

Algorithms

Identifiers

PMID35500006
PMCPMC9060357

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.