Evidence map›Paper›PMID 38921196›Full record

ArticleBiomimetics (Basel, Switzerland)2024

MOBCA: Multi-Objective Besiege and Conquer Algorithm.

Jianhua Jiang, Jiaqi Wu, Jinmeng Luo, Xi Yang, Zulu Huang

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. Cited by 3 papers.

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

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Multitask Level-Based Learning Swarm Optimizer.Biomimetics (Basel, Switzerland) · 2024
    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

5 authors.

Jianhua JiangCenter for Artificial Intelligence, Jilin University of Finance and Economics, Changchun 130117, China.ORCID 0000-0002-9149-2922
Jiaqi WuCenter for Artificial Intelligence, Jilin University of Finance and Economics, Changchun 130117, China.ORCID 0009-0007-9233-9851
Jinmeng LuoCenter for Artificial Intelligence, Jilin University of Finance and Economics, Changchun 130117, China.
Xi YangCenter for Artificial Intelligence, Jilin University of Finance and Economics, Changchun 130117, China.ORCID 0009-0006-8001-8092
Zulu HuangCollege of Foreign Languages, Jilin Agricultural University, Changchun 130118, China.

Funding

Foundation of Social Science of Jilin Province No.2022B84Foundation of the Jilin Provincial Department of Science and Technology No.YDZJ202201ZYTS565
6 · The paper itself

Abstract

The besiege and conquer algorithm has shown excellent performance in single-objective optimization problems. However, there is no literature on the research of the BCA algorithm on multi-objective optimization problems. Therefore, this paper proposes a new multi-objective besiege and conquer algorithm to solve multi-objective optimization problems. The grid mechanism, archiving mechanism, and leader selection mechanism are integrated into the BCA to estimate the Pareto optimal solution and approach the Pareto optimal frontier. The proposed algorithm is tested with MOPSO, MOEA/D, and NSGAIII on the benchmark function IMOP and ZDT. The experiment results show that the proposed algorithm can obtain competitive results in terms of the accuracy of the Pareto optimal solution.

Indexed as

evolutionary algorithmheuristic algorithmmeta-heuristicmulti-objective optimization

Identifiers

PMID38921196
PMCPMC11201474

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.