[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Contact us::
Site Facilities::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
Overall Journal Statistics
Published articles: 259
Acceptance rate: 84.2
Rejection rate: 15.8
Average time to review: 97 days
Average time to publish: 26 days
..
:: Volume 14, Issue 3 (12-2025) ::
تحقیقات نوین در سیستمهای قدرت هوشمند 2025, 14(3): 55-80 Back to browse issues page
Evaluation, Analysis, and Performance Comparison of the Gold Search Algorithm with Several Metaheuristic Algorithms
Ali Akbar Neghabi *1 , Babak Lotfi2 , Narges Rahmani2
1- Department of Computer Engineering and Information Technology, Sab.C., Islamic Azad University, Sabzevar, Iran , Aa_neghabi@iau.ac.ir
2- Department of Computer Engineering and Information Technology, Sab.C., Islamic Azad University, Sabzevar, Iran
Abstract:   (22 Views)
  In the present study, the Gold Search Algorithm is compared with six other metaheuristic algorithms, namely Harris Hawks Optimization, Adaptive Opposition-Based Slime Mold Algorithm, Spider Wasp Optimizer, Dandelion Optimizer, Marine Predators Algorithm, and Equilibrium Optimizer. This comparison is conducted by solving ten standard benchmark functions, F1 to F10, across dimensions of 10, 30, and 50, with 100 independent runs. Performance is evaluated using three criteria: accuracy (mean of the best solution), stability (standard deviation), and speed (execution time). The evaluation results and rankings indicate that Harris Hawks Optimization and Adaptive Opposition-Based Slime Mold Algorithm outperform the others in most functions and dimensions in terms of accuracy and stability. The Gold Search Algorithm performs well, especially on functions F1 and F8, in finding the best solutions, and ranks third overall. Regarding speed, the Spider Wasp Optimizer is the fastest, while the Dandelion and Marine Predators algorithms are the slowest. As the dimensionality increases, the efficiency of most algorithms decreases; however, the top-performing algorithms manage to maintain their stability. This study demonstrates that the choice of an appropriate algorithm depends on the nature of the function and the priority of criteria, and no single algorithm is completely superior across all conditions and criteria. Finally, it is suggested that future research employ algorithm hybridization and fine-tuning of parameters to improve performance on more complex problems and real-world applications.
Keywords: Gold Search Algorithm, Adaptive Opposition-Based Slime Mould Algorithm, Harris Hawks Algorithm, Dandelion Algorithm, Metaheuristic Optimization, Performance Comparison.
Full-Text [PDF 1825 kb]   (14 Downloads)    
Type of Study: Research | Subject: Special
Received: 2025/10/2 | Accepted: 2025/11/22 | Published: 2025/12/1
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA


XML   Persian Abstract   Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Neghabi A A, Lotfi B, Rahmani N. Evaluation, Analysis, and Performance Comparison of the Gold Search Algorithm with Several Metaheuristic Algorithms. تحقیقات نوین در سیستمهای قدرت هوشمند 2025; 14 (3) :55-80
URL: http://jeps.dezful.iau.ir/article-1-548-en.html


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 14, Issue 3 (12-2025) Back to browse issues page
تحقیقات نوین در سیستم های قدرت هوشمند Journal of Novel Researches on Smart Power Systems
Persian site map - English site map - Created in 0.14 seconds with 39 queries by YEKTAWEB 4732