A Hybrid Multi-Step Rolling Forecasting Model Based on SSA and Simulated Annealing—Adaptive Particle Swarm Optimization for Wind Speed
With the limitations of conventional energy becoming increasing distinct, wind energy is emerging as a promising renewable energy source that plays a critical role in the modern electric and economic fields. However, how to select optimization algorithms to forecast wind speed series and improve pre...
Gespeichert in:
Veröffentlicht in: | Sustainability 2016-08, Vol.8 (8), p.754-754 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | With the limitations of conventional energy becoming increasing distinct, wind energy is emerging as a promising renewable energy source that plays a critical role in the modern electric and economic fields. However, how to select optimization algorithms to forecast wind speed series and improve prediction performance is still a highly challenging problem. Traditional single algorithms are widely utilized to select and optimize parameters of neural network algorithms, but these algorithms usually ignore the significance of parameter optimization, precise searching, and the application of accurate data, which results in poor forecasting performance. With the aim of overcoming the weaknesses of individual algorithms, a novel hybrid algorithm was created, which can not only easily obtain the real and effective wind speed series by using singular spectrum analysis, but also possesses stronger adaptive search and optimization capabilities than the other algorithms: it is faster, has fewer parameters, and is less expensive. For the purpose of estimating the forecasting ability of the proposed combined model, 10-min wind speed series from three wind farms in Shandong Province, eastern China, are employed as a case study. The experimental results were considerably more accurately predicted by the presented algorithm than the comparison algorithms. |
---|---|
ISSN: | 2071-1050 2071-1050 |
DOI: | 10.3390/su8080754 |