Evidence map›Paper›PMID 39590236›Full record

ArticleBiomimetics (Basel, Switzerland)2024

Multitask Level-Based Learning Swarm Optimizer.

Jiangtao Chen, Zijia Wang, Zheng Kou

Abstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

3 authors.

Jiangtao ChenSchool Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China.
Zijia WangSchool Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China.
Zheng KouInstitute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China.ORCID 0000-0003-4758-2872

Funding

Guangdong Natural Science Foundation 2022A1515011825 and 2021B1515120078Guangzhou Science and Technology Planning Project 2023A04J0388 and 2023A03J0662National Natural Science Foundation of China 62106055 and 62176094
6 · The paper itself

Abstract

Evolutionary multitasking optimization (EMTO) is currently one of the hottest research topics that aims to utilize the correlation between tasks to optimize them simultaneously. Although many evolutionary multitask algorithms (EMTAs) based on traditional differential evolution (DE) and the genetic algorithm (GA) have been proposed, there are relatively few EMTAs based on particle swarm optimization (PSO). Compared with DE and GA, PSO has a faster convergence speed, especially during the later state of the evolutionary process. Therefore, this paper proposes a multitask level-based learning swarm optimizer (MTLLSO). In MTLLSO, multiple populations are maintained and each population corresponds to the optimization of one task separately using LLSO, leveraging high-level individuals with better fitness to guide the evolution of low-level individuals with worse fitness. When information transfer occurs, high-level individuals from a source population are used to guide the evolution of low-level individuals in the target population to facilitate the effectiveness of knowledge transfer. In this way, MTLLSO can obtain the satisfying balance between self-evolution and knowledge transfer. We have illustrated the effectiveness of MTLLSO on the CEC2017 benchmark, where MTLLSO significantly outperformed other compared algorithms in most problems.

Indexed as

evolutionary multitasking optimization (EMTO)evolutionary operatorsparticle swarm optimization (PSO)

Identifiers

PMID39590236
PMCPMC11591564

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.