Evidence map›Paper›PMID 39730896›Full record

ArticleScientific reports2024

A Gaussian convolutional optimization algorithm with tent chaotic mapping.

Yanying Qi, Aipeng Jiang, Yuhang Gao

Abstract read
In one paragraph

Article in Scientific reports, 2024. 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

3 authors.

Yanying QiHangzhou Dianzi University, Baiyang Street, Hangzhou, 310018, China.
Aipeng JiangHangzhou Dianzi University, Baiyang Street, Hangzhou, 310018, China. jiangaipeng@hdu.edu.cn.
Yuhang GaoHangzhou Dianzi University, Baiyang Street, Hangzhou, 310018, China.

Funding

Pioneer" and "Leading Goose" R&D Program of Zhejiang 2023C01024
6 · The paper itself

Abstract

To solve the problems of the traditional convolution optimization algorithm (COA), which are its slow convergence speed and likelihood of falling into local optima, a Gaussian mutation convolution optimization algorithm based on tent chaotic mapping (TCOA) is proposed in this article. First, the tent chaotic strategy is employed for the initialization of individual positions to ensure a uniform distribution of the population across a feasible search space. Subsequently, a Gaussian convolution kernel is used for an extensive depth search within the search space to mitigate the likelihood of any individuals converging to a local optimum. The proposed approach is validated by simulation using 23 benchmark functions and six recent evolutionary algorithms. The simulation results show that the TCOA achieves superior results in low-dimensional optimization problems and solves practical, spring-related industrial design problems. This algorithm has important applications to solving optimization problems.

Indexed as

Convolutional optimization algorithmGaussian convolutionTent chaotic mapping

Identifiers

PMID39730896
PMCPMC11680939

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.