File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: An efficient graph partition method for fault section estimation inlarge-scale power network

TitleAn efficient graph partition method for fault section estimation inlarge-scale power network
Authors
KeywordsGraph partition
Fault section estimation
Large-scale power network
Issue Date2001
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000580
Citation
IEEE Power Engineering Society Winter Meeting, Ohio, USA, 28 January - 1 December 2001, v. 3, p. 1335-1340 How to Cite?
AbstractIn order to make fault section estimation (FSE) in large scale power networks using a distributed artificial intelligence approach, we have to develop an efficient way to partition the large-scale power network into the desired number of connected sub-networks such that each sub-network should have balanced working burden in performing FSE. In this paper, a new efficient multiple-way graph partition method is suggested for the partition task. The method consists of three basic steps. The first step is to form the weighted depth-first-search tree of the power network. The second step is to further partition the network into connected balanced sub-networks. The last step is an iterative process, which tries to minimize the number of the frontier nodes of the sub-networks in order to reduce the required interaction of the adjacent sub-networks. The proposed graph partition approach has been implemented with applications of sparse storage technique. It is further tested in the IEEE 14-bus, 30-bus and 118-bus systems respectively. Computer simulation results show that the proposed multiple-way graph partition approach is suitable for FSE in large-scale power networks and is compared favorably with other graph partition methods suggested in references.
Persistent Identifierhttp://hdl.handle.net/10722/46335
ISSN

 

DC FieldValueLanguage
dc.contributor.authorTianshu, Ben_HK
dc.contributor.authorNi, Yen_HK
dc.contributor.authorShen, CMen_HK
dc.contributor.authorWu, FFen_HK
dc.date.accessioned2007-10-30T06:47:37Z-
dc.date.available2007-10-30T06:47:37Z-
dc.date.issued2001en_HK
dc.identifier.citationIEEE Power Engineering Society Winter Meeting, Ohio, USA, 28 January - 1 December 2001, v. 3, p. 1335-1340en_HK
dc.identifier.issn0195-6825en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46335-
dc.description.abstractIn order to make fault section estimation (FSE) in large scale power networks using a distributed artificial intelligence approach, we have to develop an efficient way to partition the large-scale power network into the desired number of connected sub-networks such that each sub-network should have balanced working burden in performing FSE. In this paper, a new efficient multiple-way graph partition method is suggested for the partition task. The method consists of three basic steps. The first step is to form the weighted depth-first-search tree of the power network. The second step is to further partition the network into connected balanced sub-networks. The last step is an iterative process, which tries to minimize the number of the frontier nodes of the sub-networks in order to reduce the required interaction of the adjacent sub-networks. The proposed graph partition approach has been implemented with applications of sparse storage technique. It is further tested in the IEEE 14-bus, 30-bus and 118-bus systems respectively. Computer simulation results show that the proposed multiple-way graph partition approach is suitable for FSE in large-scale power networks and is compared favorably with other graph partition methods suggested in references.en_HK
dc.format.extent1280199 bytes-
dc.format.extent2950 bytes-
dc.format.extent12538 bytes-
dc.format.extent11910 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000580en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectGraph partitionen_HK
dc.subjectFault section estimationen_HK
dc.subjectLarge-scale power networken_HK
dc.titleAn efficient graph partition method for fault section estimation inlarge-scale power networken_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0195-6825&volume=3&spage=1335&epage=1340&date=2001&atitle=An+efficient+graph+partition+method+for+fault+section+estimation+inlarge-scale+power+networken_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/PESW.2001.917278en_HK
dc.identifier.hkuros73282-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats