Faculty of Computer Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran.
Big Data Research Center, Najafabad Branch, Islamic Azad University, Najafabad, Iran.
PLoS One. 2023 Jan 3;18(1):e0280006. doi: 10.1371/journal.pone.0280006. eCollection 2023.
Monkey king evolution (MKE) is a population-based differential evolutionary algorithm in which the single evolution strategy and the control parameter affect the convergence and the balance between exploration and exploitation. Since evolution strategies have a considerable impact on the performance of algorithms, collaborating multiple strategies can significantly enhance the abilities of algorithms. This is our motivation to propose a multi-trial vector-based monkey king evolution algorithm named MMKE. It introduces novel best-history trial vector producer (BTVP) and random trial vector producer (RTVP) that can effectively collaborate with canonical MKE (MKE-TVP) using a multi-trial vector approach to tackle various real-world optimization problems with diverse challenges. It is expected that the proposed MMKE can improve the global search capability, strike a balance between exploration and exploitation, and prevent the original MKE algorithm from converging prematurely during the optimization process. The performance of the MMKE was assessed using CEC 2018 test functions, and the results were compared with eight metaheuristic algorithms. As a result of the experiments, it is demonstrated that the MMKE algorithm is capable of producing competitive and superior results in terms of accuracy and convergence rate in comparison to comparative algorithms. Additionally, the Friedman test was used to examine the gained experimental results statistically, proving that MMKE is significantly superior to comparative algorithms. Furthermore, four real-world engineering design problems and the optimal power flow (OPF) problem for the IEEE 30-bus system are optimized to demonstrate MMKE's real applicability. The results showed that MMKE can effectively handle the difficulties associated with engineering problems and is able to solve single and multi-objective OPF problems with better solutions than comparative algorithms.
孙悟空进化算法(MKE)是一种基于种群的差分进化算法,其中单一进化策略和控制参数会影响算法的收敛性以及探索与开发之间的平衡。由于进化策略对算法的性能有很大的影响,因此协作多种策略可以显著增强算法的能力。这就是我们提出基于多尝试向量的孙悟空进化算法(MMKE)的动机。它引入了新的最佳历史尝试向量生成器(BTVP)和随机尝试向量生成器(RTVP),可以使用多尝试向量方法与经典 MKE(MKE-TVP)有效地协作,以解决具有各种挑战性的各种真实世界优化问题。预计提出的 MMKE 可以提高全局搜索能力,在探索与开发之间取得平衡,并防止原始 MKE 算法在优化过程中过早收敛。使用 CEC 2018 测试函数评估了 MMKE 的性能,并将结果与 8 种元启发式算法进行了比较。实验结果表明,与比较算法相比,MMKE 算法在准确性和收敛速度方面能够产生具有竞争力和优越性的结果。此外,还使用 Friedman 检验对获得的实验结果进行了统计检验,证明 MMKE 明显优于比较算法。此外,还优化了四个真实世界的工程设计问题和 IEEE 30 母线系统的最优潮流(OPF)问题,以证明 MMKE 的实际适用性。结果表明,MMKE 可以有效地处理工程问题的困难,并能够解决单目标和多目标 OPF 问题,提供比比较算法更好的解决方案。