Power planning scheme based on simulated annealing algorithm

With the continuous expansion of the scale and complexity of power systems, power planning has become one of the key challenges that need to be solved urgently. This study proposes a simulated annealing algorithm combined with deep learning technology to solve the power planning problem. By introducing a generative adversarial network to generate high-quality initial solutions and using a multi-task learning model to dynamically adjust the weights between optimization objectives, the improved algorithm shows excellent performance in multiple quantitative indicators. Experimental results show that the improved algorithm is superior to the traditional algorithm in terms of total cost (14.75 × 106 yuan), reliability (98.8%), balance error (0.012), and power generation efficiency (86.3%). In addition, it has fast convergence speed (3500 iterations), short calculation time (800 s), and strong robustness (standard deviation 0.6). These results show that the improved algorithm can not only effectively optimize the economy and reliability of the power system but also adapt to the needs of different load growth rates and power types and has important practical application value.

Institutions

Publication Details

Journal
AIP Advances
Published
2025-10-01
DOI
https://doi.org/10.1063/5.0247524
Primary Topic
Optimal Power Flow Distribution
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Power planning scheme based on simulated annealing algorithm

AIP Advances
Optimal Power Flow Distribution
article

Power planning scheme based on simulated annealing algorithm

article en

Abstract

With the continuous expansion of the scale and complexity of power systems, power planning has become one of the key challenges that need to be solved urgently. This study proposes a simulated annealing algorithm combined with deep learning technology to solve the power planning problem. By introducing a generative adversarial network to generate high-quality initial solutions and using a multi-task learning model to dynamically adjust the weights between optimization objectives, the improved algorithm shows excellent performance in multiple quantitative indicators. Experimental results show that the improved algorithm is superior to the traditional algorithm in terms of total cost (14.75 × 106 yuan), reliability (98.8%), balance error (0.012), and power generation efficiency (86.3%). In addition, it has fast convergence speed (3500 iterations), short calculation time (800 s), and strong robustness (standard deviation 0.6). These results show that the improved algorithm can not only effectively optimize the economy and reliability of the power system but also adapt to the needs of different load growth rates and power types and has important practical application value.

AIP AdvancesVol. 15(10)
Electric Power Research Institute (US), State Grid Corporation of China (China) (CN), Tianjin Research Institute of Electric Science (China) (CN), Shanghai Electric (China) (CN), Economic Research Institute (BG)
Openalex Percentile: Top 49%
Optimal Power Flow Distribution
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.