Evidence map›Paper›PMID 40595859›Full record

ArticleScientific reports2025

Application of a novel metaheuristic algorithm inspired by Adam gradient descent in distributed permutation flow shop scheduling problem and continuous engineering problems.

Yiqiang Xia, Yanzhe Ji

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

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

2 citing papers in PubMed.

  1. Article
  2. 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

2 authors.

Yiqiang XiaCollege of Science, Liaoning Technical University, Fuxin, 123000, China. xiayiqiang0001@163.com.
Yanzhe JiCollege of Science, Liaoning Technical University, Fuxin, 123000, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Over the past few years, numerous swarm intelligence-based metaheuristic algorithms have been introduced and extensively applied. Although these algorithms draw on biological behaviors, their similar heuristic paradigms and modular designs lead to unbalanced exploration and exploitation in complex optimization problems. Metaheuristic algorithms that combine mathematical properties with stochastic search processes can help break through the traditional evolutionary paradigm and enhance individual optimization. In pursuit of this goal, this study introduces an innovative meta-heuristic algorithm grounded in mathematics, called the Adam Gradient Descent Optimizer (AGDO), designed for addressing continuous optimization and engineering challenges. AGDO is inspired by the Adam optimizer and explores the entire search process using three rules: progressive gradient momentum integration, dynamic gradient interaction system, and system optimization operator. The progressive gradient momentum integration and dynamic gradient interaction system balance exploration and exploitation well, while the system optimization operator refines the exploitation aspect. AGDO's performance, in conjunction with several well-known and newly introduced metaheuristics, is assessed on the CEC2017 benchmarks across various dimensions and six practical engineering challenges. The Wilcoxon rank-sum test confirms its efficacy. The findings from the experiment indicate that AGDO demonstrates strong performance across four dimensions-10, 30, 50, and 100-when compared to 19 other algorithms, and it achieves the highest Wilcoxon rank-sum test scores in three of these dimensions. AGDO is also compared to six SOTA algorithms, the findings show that the algorithm maintains an excellent equilibrium between exploration and exploitation, converges rapidly, and successfully evades local optima, highlighting superior optimization performance. Moreover, AGDO demonstrates significant effectiveness and excellence in addressing intricate real-life challenges. Notably, AGDO demonstrated extreme strengths in Distributed Permutation Flow Shop Scheduling Problem (DPFSP). Source codes of AGDO are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/180348-agdo .

Indexed as

Adam Gradient Descent OptimizerDPFSPEngineering applicationsGlobal optimizationMeta-heuristics

Identifiers

PMID40595859
PMCPMC12214976

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
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.