A Gaussian convolutional optimization algorithm with tent chaotic mapping

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

Full description

Bibliographic Details
Main Authors: Yanying Qi, Aipeng Jiang, Yuhang Gao
Format: Article
Language:English
Published: Nature Portfolio 2024-12-01
Series:Scientific Reports
Subjects:
Online Access:https://doi.org/10.1038/s41598-024-82277-y