Global Numerical Optimization Using Tent Chaotic Maps and Golden Sine Mechanism Enhanced Artificial Electric Field Algorithm

When improving a Metaheuristic Algorithm (MA) to address intricate problems, a key challenge lies in attaining a balance between exploration and intensification, effectively escaping local optimum, and preserving population diversity. A viable approach to tackle this challenge involves leveraging the strengths of diverse methods. In this investigation, the Artificial Electric Field Algorithm (AEFA), a recently developed metaheuristic, was employed to enhance convergence speed and the capability to evade local optima in complex problems. To tackle these challenges, the Tent Chaos Map (TCM) and Golden Sine Mechanism (GSM) were incorporated into the fundamental steps of AEFA, resulting in the modified algorithm termed TGS-AEFA. To assess the impact of these enhancements, 20 benchmark functions across various dimensions and real-world engineering problems were evaluated and contrasted against alternative algorithms. Numerical analysis, convergence analysis, and statistical evaluations, including Wilcoxon and Friedman Tests, were used to gauge the effectiveness of TGS-AEFA. The obtained results demonstrate improved optimization accuracy for TGS-AEFA, particularly in dynamic dimensions and engineering optimization problems.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/ichora65333.2025.11017001
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Global Numerical Optimization Using Tent Chaotic Maps and Golden Sine Mechanism Enhanced Artificial Electric Field Algorithm

Ezgi Deniz Ülker, Oluwatayomi Rereloluwa Adegboye, Opeoluwa Seun Ojekemi, Oluwaseun Racheal Ojekemi et al.
Metaheuristic Optimization Algorithms Research
article

Global Numerical Optimization Using Tent Chaotic Maps and Golden Sine Mechanism Enhanced Artificial Electric Field Algorithm

Ezgi Deniz Ülker, Oluwatayomi Rereloluwa Adegboye, Opeoluwa Seun Ojekemi, Oluwaseun Racheal Ojekemi, Afi Kekeli Feda, Abosede Omowumi Tibetan
article en

Abstract

When improving a Metaheuristic Algorithm (MA) to address intricate problems, a key challenge lies in attaining a balance between exploration and intensification, effectively escaping local optimum, and preserving population diversity. A viable approach to tackle this challenge involves leveraging the strengths of diverse methods. In this investigation, the Artificial Electric Field Algorithm (AEFA), a recently developed metaheuristic, was employed to enhance convergence speed and the capability to evade local optima in complex problems. To tackle these challenges, the Tent Chaos Map (TCM) and Golden Sine Mechanism (GSM) were incorporated into the fundamental steps of AEFA, resulting in the modified algorithm termed TGS-AEFA. To assess the impact of these enhancements, 20 benchmark functions across various dimensions and real-world engineering problems were evaluated and contrasted against alternative algorithms. Numerical analysis, convergence analysis, and statistical evaluations, including Wilcoxon and Friedman Tests, were used to gauge the effectiveness of TGS-AEFA. The obtained results demonstrate improved optimization accuracy for TGS-AEFA, particularly in dynamic dimensions and engineering optimization problems.

European University of Lefke (TR), University of Mediterranean Karpasia (CY)
Openalex Percentile: Top 94%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.