Introduction
Figure 1: The schematic representation of the three phases of AGRO, (a) migration, (b) collaboration and (c) panning.
We propose a metaheuristic optimization algorithm called Adaptive Gold Rush Optimizer (AGRO), a substantial evolution of the original Gold Rush Optimizer (GRO) [2].
Methodology of AGRO [1]
AGRO introduces fundamental modifications to the search equations,
eliminating the inherent attraction towards the zero coordinates,
while explicitly incorporating objective function values to guide prospectors towards promising regions.
Furthermore, unlike the standard GRO, which relies on fixed probabilities in the strategy selection process, AGRO utilizes a novel adaptive mechanism that prioritizes strategies improving solution quality. This adaptive component, that can be applied to any optimization algorithm with fixed probabilities in the strategy selection, adjusts the probabilities of the three core search strategies of GRO (Migration, Collaboration, and Panning), in real-time, rewarding those that successfully improve solution quality.
Figure 2: Qualitative analysis for the (a) F3 and (c) F12 functions from the CBF23 suite. The evolution of probability distributions p(1), p(2) and p(3) for the (b) F3 and (d) F12.
Experiments - Downloads of AGRO algorithm [1]
You can download the matlab code of the AGRO algorithm proposed in [1]
See the corresponding readme.txt files for more details.
Related Publications
[1] C. Panagiotakis, AGRO: An Adaptive Gold Rush Optimizer with Dynamic Strategy Selection, submitted to Algorithms, 2026.
[2] Zolfi, K. Gold rush optimizer: A new population-based metaheuristic algorithm. Operations Research and Decisions 2023, 33, 113–150.