An Improved Dragonfly Algorithm with Higher Exploitation Capability to Optimize the Design of Hybrid Power Active Filter
Hybrid power active filter (HAPF) is an important device to suppress the harmonics of the power system. In HAPF, the parameters estimation has a great impact on ensuring the power quality in the power system. Aiming at the problem of minimizing the harmonic pollution (HP) in the power system, this p...
Gespeichert in:
Veröffentlicht in: | IEEE access 2020-01, Vol.8, p.1-1 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Hybrid power active filter (HAPF) is an important device to suppress the harmonics of the power system. In HAPF, the parameters estimation has a great impact on ensuring the power quality in the power system. Aiming at the problem of minimizing the harmonic pollution (HP) in the power system, this paper proposes a new technology namely IEDA for parameter optimization of hybrid power active filters, which is an improved dragonfly algorithm (DA) with higher exploitation capability. DA is a global search algorithm with sufficient ability to avoid falling into local optimization, however, DA performs poorly for local search. In the IEDA, we adopt a strategy of division of labor to divide particles into exploitation population and exploration population. In the exploitation population, we introduce the information exchange mechanism of the differential evolution (DE) and set up an exemplar pool to enhance its exploitation capability. In the exploration population, we use the global search ability of the DA to prevent particles from falling into a local optimum. Through the division of labor between exploitation population and exploration population, the problems of low accuracy and slow convergence of DA are effectively solved. Experimental results show that the algorithm has greatly improved accuracy and reliability compared with seven well-established algorithms. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2020.3006102 |