Evidence map›Paper›PMID 40455879›Full record

ArticlePloS one2025

A study of gene expression programming algorithm for dynamically adjusting the parameters of genetic operators.

Kejia Liu, Yiping Teng, Fang Liu

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. 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.

Kejia LiuSchool of Computer Science, Shenyang Aerospace University, Shenyang, China.
Yiping TengSchool of Computer Science, Shenyang Aerospace University, Shenyang, China.ORCID 0000-0002-5870-0646
Fang LiuSchool of Computer Science, Shenyang Aerospace University, Shenyang, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The fast developments in artificial intelligence together with evolutionary algorithms have not solved all the difficulties that Gene Expression Programming (GEP) encounters when maintaining population diversity and preventing premature convergence. Its restrictions block GEP from successfully handling high-dimensional along with complex optimization problems. This research develops Dynamic Gene Expression Programming (DGEP) as an algorithm to control genetic operators dynamically thus achieving improved global search with increased population diversity. The approach operates with two unique operators which include Adaptive Regeneration Operator (DGEP-R) and Dynamically Adjusted Mutation Operator (DGEP-M) to preserve diversity while maintaining exploration-exploitation balance during evolutionary search. An extensive evaluation of DGEP occurred through symbolic regression problem tests. The study employed traditional benchmark functions and conducted evaluations versus baselines Standard GEP, NMO-SARA, and MS-GEP-A to assess fitness outcomes, R² values, population diversification, and the avoidance of local optima. All key metric evaluations showed that DGEP beat standard GEP along with alternative improved variants. DGEP produced the optimal results for 8 benchmark functions that produced 15.7% better R² scores along with 2.3 × larger population diversity. The escape rate from local optima within DGEP reached 35% higher than what standard GEP could achieve. The DGEP model serves to enhance GEP performance through the effective maintenance of diversity and improved global search functions. The results indicate that adaptive genetic methods strengthen evolutionary procedures for solving complex problems effectively.

Indexed as

AlgorithmsGene ExpressionModels, GeneticArtificial IntelligenceHumans

Identifiers

PMID40455879
PMCPMC12129357

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.