🤖 AI Summary
To address premature convergence in photovoltaic (PV) model parameter identification—caused by nonlinearity, multimodality, and high dimensionality—this paper proposes a Memory-enhanced Fractional-order Dung Beetle Optimizer (MFDBO). The method innovatively integrates a fractional-order calculus-based memory mechanism to improve historical information utilization, employs fractional-order logistic chaotic mapping for diverse population initialization, and introduces an elite chaotic perturbation strategy to enhance local escape capability. Comprehensive evaluations on the CEC2017 benchmark suite and multiple PV models—including single-diode, double-diode, and PV module models—demonstrate that MFDBO significantly outperforms state-of-the-art DBO variants, top-performing CEC algorithms, and mainstream metaheuristic methods in terms of solution accuracy, robustness, and convergence speed. Thus, MFDBO establishes an efficient and reliable new paradigm for high-precision PV parameter identification.
📝 Abstract
Accurate parameter identification in photovoltaic (PV) models is crucial for performance evaluation but remains challenging due to their nonlinear, multimodal, and high-dimensional nature. Although the Dung Beetle Optimization (DBO) algorithm has shown potential in addressing such problems, it often suffers from premature convergence. To overcome these issues, this paper proposes a Memory Enhanced Fractional-Order Dung Beetle Optimization (MFO-DBO) algorithm that integrates three coordinated strategies. Firstly, fractional-order (FO) calculus introduces memory into the search process, enhancing convergence stability and solution quality. Secondly, a fractional-order logistic chaotic map improves population diversity during initialization. Thirdly, a chaotic perturbation mechanism helps elite solutions escape local optima. Numerical results on the CEC2017 benchmark suite and the PV parameter identification problem demonstrate that MFO-DBO consistently outperforms advanced DBO variants, CEC competition winners, FO-based optimizers, enhanced classical algorithms, and recent metaheuristics in terms of accuracy, robustness, convergence speed, while also maintaining an excellent balance between exploration and exploitation compared to the standard DBO algorithm.