Power distribution network distributed power supply configuration method

The invention discloses a power distribution network distributed power supply configuration method, which optimizes the capacity and position of a power distribution network distributed power supply through an ant lion algorithm to obtain optimal capacity and position configuration. The method compr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	WANG TINGHUANG
Format:	Patent
Sprache:	chi ; eng
Schlagworte:	CALCULATING CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTINGELECTRIC POWER COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING CONVERSION OR DISTRIBUTION OF ELECTRIC POWER COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ELECTRICITY GENERATION PHYSICS SYSTEMS FOR STORING ELECTRIC ENERGY SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The invention discloses a power distribution network distributed power supply configuration method, which optimizes the capacity and position of a power distribution network distributed power supply through an ant lion algorithm to obtain optimal capacity and position configuration. The method comprises the following steps: firstly, initializing, defining iteration times, constraint conditions andpopulation quantity, and setting power loss and voltage stability as optimization indexes; randomly generating an ant position and an ant lion position, calculating the power loss and the voltage stability index of the ant lion position, and selecting the optimal position as the best configuration at the present stage; and randomly selecting one ant lion position and walking between the two positions by each ant. Ant lion algorithm iteration is carried out, the ant position is updated, and if the optimization index of the position is superior to the ant lion position, the ant position is replaced with a new ant lion