Evidence map›Paper›PMID 37998180›Full record

ArticleEntropy (Basel, Switzerland)2023

An Entropy-Balanced Orthogonal Learning Bamboo Forest Growth Optimization Algorithm with Quasi-Affine Transformation Evolutionary and Its Application in Capacitated Vehicle Routing Problem.

Jeng-Shyang Pan, Xin-Yi Zhang, Shu-Chuan Chu, Ru-Yu Wang, Bor-Shyh Lin

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2023. 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

5 authors.

Jeng-Shyang PanCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.ORCID 0000-0002-3128-9025
Xin-Yi ZhangCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.
Shu-Chuan ChuCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.ORCID 0000-0003-2117-0618
Ru-Yu WangCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.
Bor-Shyh LinInstitute of Imaging and Biomedical Photonics, National Yang Ming Chiao Tung University, Tainan City 71150, Taiwan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The bamboo forest growth optimization (BFGO) algorithm combines the characteristics of the bamboo forest growth process with the optimization course of the algorithm. The algorithm performs well in dealing with optimization problems, but its exploitation ability is not outstanding. Therefore, a new heuristic algorithm named orthogonal learning quasi-affine transformation evolutionary bamboo forest growth optimization (OQBFGO) algorithm is proposed in this work. This algorithm combines the quasi-affine transformation evolution algorithm to expand the particle distribution range, a process of entropy increase that can significantly improve particle searchability. The algorithm also uses an orthogonal learning strategy to accurately aggregate particles from a chaotic state, which can be an entropy reduction process that can more accurately perform global development. OQBFGO algorithm, BFGO algorithm, quasi-affine transformation evolutionary bamboo growth optimization (QBFGO) algorithm, orthogonal learning bamboo growth optimization (OBFGO) algorithm, and three other mature algorithms are tested on the CEC2017 benchmark function. The experimental results show that the OQBFGO algorithm is superior to the above algorithms. Then, OQBFGO is used to solve the capacitated vehicle routing problem. The results show that OQBFGO can obtain better results than other algorithms.

Indexed as

bamboo forest growth optimization algorithmcapacitated vehicle routing problemheuristic optimization algorithmorthogonal learningquasi-affine transformation evolution

Identifiers

PMID37998180
PMCPMC10670682

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.