The Study Of Distributed Optimal Power Flow Algorithm

Along with the enlarging of electric network, the problems which longtime computing and slow rapidity of convergence become serious in the computing of traditional optimal power flow. The article introduces a kind of decomposition-coordinate distributed optimal power flow algorithm which based on region division and auxiliary problem principle (APP). Among them, the region division has the important influence to this algorithm computing time. Regarding this, this article proposes doing region division by the graph theory, and causing it to satisfy the request of the coarse particle size algorithm. Through the example analysis, it explains that this kind of district method based on the graph theory is feasible. Finally, through the simulation experiment, it explains that the distributed optimal power flow algorithm has the strong astringency, and can effectively reduce the computing time.