Power system harmonic and interharmonic estimation using Vortex Search Algorithm
[Display omitted] •Vortex Search Algorithm is designed to estimate the power system (inter)harmonics.•It has a faster convergence performance than the other applied heuristic methods.•Computational complexity is reduced so it is suitable for real-time applications.•VSA algorithm has better convergen...
Gespeichert in:
Veröffentlicht in: | Electric power systems research 2020-05, Vol.182, p.106187, Article 106187 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | [Display omitted]
•Vortex Search Algorithm is designed to estimate the power system (inter)harmonics.•It has a faster convergence performance than the other applied heuristic methods.•Computational complexity is reduced so it is suitable for real-time applications.•VSA algorithm has better convergence results on real field data.
In this paper, a vortex search algorithm (VSA) based method designed to estimate power system harmonics and interharmonics for highly time-varying cases is presented. Time-variation in the power system is due to the nonlinear and stochastic loads such as electric arc furnaces (EAF) and it is one of the major cause of the power quality problems. The proposed algorithm is tested on both synthetic signals and also field data obtained from transmission system substations supplying EAF plants. The results are compared with other search algorithm-based methods reported in the literature and shown that VSA algorithm exhibits better estimation performance and has less computational complexity. In addition, the VSA algorithm is also tested on real field data and the results are compared with those obtained by Kalman Filtering method, which is claimed to provide fastest results in the literature. It has been shown that the proposed method has better convergence results in noisy environment with less computational complexity. |
---|---|
ISSN: | 0378-7796 1873-2046 |
DOI: | 10.1016/j.epsr.2019.106187 |