Abstract
A mathematical model for distribution network restoration after system blackout is developed. By changing the parameters of the goal function, the model can adapt to various cases of available power capacity in different restoration schemes. The genetic algorithm (GA) encodes with the ratio of branch and is decoded via the minimum spanning tree algorithm-Prim algorithm to bypass the generation of infeasible solutions, thus greatly improving the GA's efficiency. The backward/forward sweep algorithm is then adopted to solve the distribution power flow, and the sequence of nodes for power flow calculation is directly determined by the intermediate results of the Prim algorithm. Computational results on two test systems demonstrate the satisfactory performance of the robustness and convergence of the algorithm proposed.
| Translated title of the contribution | Distribution network restoration based on the genetic algorithm with minimum spanning tree decoding |
|---|---|
| Original language | Chinese |
| Pages (from-to) | 81-84 |
| Number of pages | 4 |
| Journal | Dianli Xitong Zidonghua/Automation of Electric Power Systems |
| Volume | 31 |
| Issue number | 14 |
| State | Published - Jan 2007 |
Indexed by
- Scopus
Fingerprint
Dive into the research topics of 'Distribution network restoration based on the genetic algorithm with minimum spanning tree decoding'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver