Evidence map›Paper›PMID 41086151›Full record

ArticlePloS one2025

Multi-objective dung beetle optimization algorithm: A novel algorithm for solving complex multi-objective optimization problems.

Wenxing Wu, Liqin Tian, Junyi Wu, Lianhai Lin

Abstract read
In one paragraph

Article in PloS one, 2025. 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. 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

4 authors.

Wenxing WuSchool of Computer Science, Qinghai Normal University, Xining, Qinghai, China.ORCID https://orcid.org/0000-0002-7333-2861
Liqin TianSchool of Computer Science, Qinghai Normal University, Xining, Qinghai, China.
Junyi WuSchool of Computer Science, Qinghai Normal University, Xining, Qinghai, China.
Lianhai LinSchool of Computer Science, Qinghai Normal University, Xining, Qinghai, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Many increasingly complex multi-objective optimization problems are emerging, and there is an urgent need to develop new multi-objective optimization algorithms to meet the challenges. This study introduces the Multi-Objective Dung Beetle Optimization Algorithm (MODBO), which integrates competitive and neighborhood mechanisms to tackle such problems, Thanks to the dung beetle optimization algorithm's fast convergence and robust optimization finding ability in single-objective optimization algorithms. The introduction of non-dominated sorting allows the Dung Beetle Optimization Algorithm to solve multi-objective optimization problems (MOPs). To make the Dung Beetle Optimization Algorithm maintain good search ability in searching, we introduce a Competition mechanism to guide the particles' global optimal search and a Neighborhood mechanism to guide the particles' local optimal value search. An external archive is introduced to make each generation positionally optimal. Finally, to analyze whether the MODBO algorithm's improved strategy is effective, a comparison with the nine algorithms on CEC2020 was made, and the 3D sensor deployment problem was used to demonstrate that the MODBO algorithm can solve realistic problems.

Indexed as

AlgorithmsColeopteraAnimals

Identifiers

PMID41086151
PMCPMC12520404

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.