数学优化
元启发式
计算机科学
局部搜索(优化)
粒子群优化
局部最优
最大值和最小值
多群优化
Boosting(机器学习)
算法
机器学习
数学
数学分析
作者
Mohammed Qaraad,Souad Amjad,Nazar K. Hussein,M. A. Farag,Seyedali Mirjalili,Mostafa A. Elhosseini
标识
DOI:10.1016/j.eswa.2023.121417
摘要
The Particle Swarm Optimization technique (PSO) is widely used in practical applications due to its flexibility and strong optimization performance. However, like other metaheuristic algorithms, PSO has limitations, such as a propensity to become trapped in local minima and an uneven distribution of effort between exploration and exploitation stages. A novel local search technique called QPSOL, based on PSO is the proposed solution to mitigate these issues. QPSOL aims to increase diversity and achieve a closer balance between the exploration and exploitation phases. The QPSOL incorporates a dynamic optimization strategy to enhance the method's efficiency. Unlike the novel local search strategy, which uses a new local search approach (LSA) to break out of local optima, QPSOL employs quadratic interpolation around the optimal search agent to enhance its exploitation capability and solution accuracy. These strategies complement each other and contribute to boosting PSO's convergence efficiency while seeking to balance exploration and exploitation. The proposed method is assessed using the IEEE CEC'2021 test suite, and its efficacy is evaluated against other metaheuristics and cutting-edge algorithms to determine its trustworthiness. The optimal parameters of three PV models are determined using the proposed technique and compared to different well-established algorithms. Systematic comparisons show that QPSOL is competitive with, and often outperforms, commonly used methods in research for predicting model parameters.
科研通智能强力驱动
Strongly Powered by AbleSci AI