Graph Partitioning Method for Distributed and Parallel Optimal Power Flow

Author

Cao, Lixia ; Li, Jiwen ; Cheng, Xingong ; Shi, Meihong

Author_Institution

Sch. of Inf. & Electr. Eng., Shandong Univ. of Archit. Eng., Jinan

fYear

2005

fDate

2005

Firstpage

1

Lastpage

6

Abstract

The power network partition is an important issue for the auxiliary problem principle based distributed and parallel optimization algorithm (APPBDPOA) as it affects the convergent performance of the algorithm. A maximum-cardinality matching based fast graph partitioning method (MCMBFGPM) is proposed. After the power network is initially partitioned into several sub-areas, this method is adopted to reduce the numbers of frontier buses and balance the numbers of interior buses of all sub-areas. The numerical results show that it converges fast and can significantly speed up the auxiliary problem principle based distributed and parallel optimization process

Keywords

convergence of numerical methods; distribution networks; load flow; optimisation; parallel algorithms; transmission networks; APPBDPOA; MCMBFGPM; auxiliary problem principle; convergent performance; distributed-parallel optimization algorithm; fast graph partitioning method; frontier bus; interior bus; maximum-cardinality matching; optimal power flow; power network partition; Convergence; Energy management; Graph theory; Load flow; Modems; Partitioning algorithms; Power engineering and energy; Power system analysis computing; Power system control; Power systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Transmission and Distribution Conference and Exhibition: Asia and Pacific, 2005 IEEE/PES

Conference_Location

Dalian

Print_ISBN

0-7803-9114-4

Type

conf

DOI

10.1109/TDC.2005.1547043

Filename

1547043