Short-term Power Load Forecasting Based on Improved BP Neural Network from Genetic Algorithm and Simulated Annealing Algorithm

As one of the common methods of load forecasting, the traditional BP neural network algorithm has been favored by scholars for many years due to its strong learning ability and adaptive ability, and is often used by scholars to forecast power load. However, BP neural network also has its own shortco...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 2401; číslo 1; s. 12087 - 12092
Hlavní autoři: Zhong, Licheng, Wang, Yulu
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.12.2022
Témata:
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:As one of the common methods of load forecasting, the traditional BP neural network algorithm has been favored by scholars for many years due to its strong learning ability and adaptive ability, and is often used by scholars to forecast power load. However, BP neural network also has its own shortcomings, that is, low algorithm efficiency, local minimization and other problems. In this paper, GA algorithm and SA algorithm are used to modify the weights of BP neural network, and a short-term load forecasting model, namely BP-GSA model, is established. The least mean square error prediction model is obtained through training. Then using BP-GSA model and traditional BP neural network model, using MATLAB software to predict the daily power load of a city from July 1 to July 10. The forecast results show that the load forecast curve obtained by BP-GSA model is closer to the actual load curve. That is to say, BP-GSA load forecasting error is less than the traditional BP neural network load forecasting error, which proves that BP-GSA model has better forecasting effect.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2401/1/012087