Referenced Items are not available for this document.
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
Published in:
Transmission and Distribution Conference and Exhibition: Asia and Pacific, 2005 IEEE/PES
Date of Conference: 2005
- Page(s):
- 1 - 6
- Print ISBN:
- 0-7803-9114-4
- INSPEC Accession Number:
- 9262696
- Conference Location :
- Dalian
- Digital Object Identifier :
- 10.1109/TDC.2005.1547043
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
