A distribution network reconfiguration algorithm based on Multi-agent system and minimum spanning tree led by particle swarm optimization
A novel distribution network reconfiguration algorithm is proposed, which is based on minimum spanning tree algorithm led by particle swarm optimization proposed on the basis of minimum spanning tree, and combines with collaborative learning between particles, self-learning of excellent particles, s...
Uložené v:
| Vydané v: | Dianli Xitong Baohu yu Kongzhi Ročník 39; číslo 6; s. 24 - 33 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | Chinese |
| Vydavateľské údaje: |
16.03.2011
|
| Predmet: | |
| ISSN: | 1674-3415 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | A novel distribution network reconfiguration algorithm is proposed, which is based on minimum spanning tree algorithm led by particle swarm optimization proposed on the basis of minimum spanning tree, and combines with collaborative learning between particles, self-learning of excellent particles, survival of the fittest and the features of multi-agent system. The proposed method enhances information transmission in the process, and effectively solves the problems of the blindness of the minimum spanning tree, uncertainty of the value of edge, bionic significance ambiguity of improved particle swarm optimization and so on. In the Multi-agent system, the approach improves the interaction between particles and finds the global optimal solution quickly by competitive and cooperative operation. The convergence speed is further improved through collaborative learning and self-learning. The proposed method is evaluated on a typical example of PG&E 69 nodes distribution system. The result shows that the method has g |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 ObjectType-Article-2 ObjectType-Feature-1 |
| ISSN: | 1674-3415 |