Memory Enhanced Fractional-Order Dung Beetle Optimization for Photovoltaic Parameter Identification

TL;DR

This paper introduces a novel memory-enhanced fractional-order Dung Beetle Optimization algorithm that significantly improves photovoltaic parameter identification by increasing accuracy, robustness, and convergence speed through innovative strategies.

Contribution

It presents a new MFO-DBO algorithm integrating fractional calculus, chaotic maps, and perturbation mechanisms to enhance optimization performance over existing methods.

Findings

Outperforms existing DBO variants and metaheuristics in accuracy and robustness.

Demonstrates superior convergence speed on benchmark and PV problems.

Maintains a good balance between exploration and exploitation.

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.