.png){kind=icon}
.png){kind=icon}
Return
A New Optimization Idea: Parallel Search-Based Golden Jackal Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3312684.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As the variety and scope of optimization problems continue to expand, the applicability of a single algorithm may not be universal. To address this challenge, this paper introduces an enhanced iteration of the Golden Jackal Optimization (GJO) algorithm, termed the Parallel Search-based Golden Jackal Optimization (PGJO) algorithm. This algorithm integrates the concept of parallel search into the initialization, updating, and selection mechanisms. It includes a chaotic mapping preselection during the initialization phase, employs a cloning-like strategy for population updates, and incorporates an advanced simulated annealing approach during the selection phase. Through a comprehensive comparison of PGJO with various intelligent optimization algorithms across diverse benchmark functions and real-world scenarios, we affirm its effectiveness in terms of enhanced convergence accuracy and reduced required iterations.
Keywords:
Optimization
Statistics
Sociology
Behavioral sciences
Search problems
Particle swarm optimization
Approximation algorithms
Globalization
Golden jackal optimization
parallel search
global search
initialization mechanism
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W