article · International Journal of Computational Intelligence Systems
This paper presents an enhanced version of the Parrot Optimizer (PO), termed the Enhanced Parrot Optimizer (EPO), which integrates hierarchical leadership, mimicry-based behavior, and a weighted behavior selection mechanism to improve convergence behavior and robustness in complex optimization landscapes. The proposed EPO is evaluated through comprehensive benchmark tests, including unimodal, multimodal, and non-convex functions, specifically Sphere, Rosenbrock, and Ackley, as well as a real-world business intelligence (BI) portfolio optimization problem. Experimental results show that EPO consistently outperforms the original PO and other established metaheuristic algorithms, including Harris Hawks Optimization (HHO), Whale Optimization Algorithm (WOA), and Remora Optimization Algorithm (ROA). On the Sphere Function, EPO achieved a mean fitness of 47,200 with a low standard deviation of 1600, outperforming HHO, which obtained a mean of 47,000 with a standard deviation of 2500. In the more challenging Rosenbrock Function, EPO reached the best fitness of 8.42E + 07 and a mean of 1.01E + 08, surpassing the other algorithms in both precision and consistency. For the multimodal Ackley Function, EPO reported the lowest mean fitness of 19.60, with a deviation of 0.19, indicating high robustness and stability. Statistical analysis using the Wilcoxon signed-rank test confirmed the superiority of EPO, with p-values below 10⁻⁸ in most comparisons. Despite the algorithmic enhancements, EPO preserved the computational efficiency, with only a 10 to 12 percent increase in runtime compared to the original PO. Moreover, EPO was used to optimize a real-world BI portfolio case study and scored the Maximum portfolio utility, 92.6, and the extreme individual fitness, 94.21, and had the minimum Maximum average running time of 1.24 s. These results show two things: first, EPO is useful not only in raising average performance but also in raising the quality and reliability of solutions in both synthetic and pragmatic optimization applications.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1007/s44196-025-00980-8
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.