Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix

The traditional method of searching transmission section generally has the problem of omission and time-consuming. A topology converging algorithm of power grid adjacency matrix is proposed in this paper. It aggregates neighboring buses based on a simple matrix transformation rule, and identify key...

Full description

Bibliographic Details
Main Authors: Dabo Zhang, Naijing Wang, Hejun Yang, Yinghao Ma, Yigang He, Wei Tang, Jingjing Wang
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9112183/
id doaj-2439f35c07e84eaeb19aafee064e6d0a
record_format Article
spelling doaj-2439f35c07e84eaeb19aafee064e6d0a2021-03-30T02:54:44ZengIEEEIEEE Access2169-35362020-01-01810823510824610.1109/ACCESS.2020.30010779112183Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency MatrixDabo Zhang0https://orcid.org/0000-0003-2149-6511Naijing Wang1Hejun Yang2https://orcid.org/0000-0001-8333-5823Yinghao Ma3Yigang He4https://orcid.org/0000-0002-6642-0740Wei Tang5Jingjing Wang6School of Electrical Engineering and Automation, Hefei University of Technology, Hefei, ChinaSchool of Electrical Engineering and Automation, Hefei University of Technology, Hefei, ChinaSchool of Electrical Engineering and Automation, Hefei University of Technology, Hefei, ChinaSchool of Electrical Engineering and Automation, Hefei University of Technology, Hefei, ChinaSchool of Electrical Engineering and Automation, Hefei University of Technology, Hefei, ChinaState Grid Anhui Electric Power Company Ltd., Hefei, ChinaState Grid Anhui Electric Power Company Ltd., Hefei, ChinaThe traditional method of searching transmission section generally has the problem of omission and time-consuming. A topology converging algorithm of power grid adjacency matrix is proposed in this paper. It aggregates neighboring buses based on a simple matrix transformation rule, and identify key transmission sections based on matrix operations and power flow distribution factors. This method has the advantage of no presetting the sub-zone, which can avoid the simplification of the grid topology in the sub-zone and improve the calculation accuracy. The complex logical operations of the traversal algorithm adopted by most of traditional methods can be avoided, and the calculation speed can be effectively improved. Besides, the algorithm also has a memory characteristic which can be applied to the online search of key transmission sections. The results of several IEEE test systems show the effectiveness of the proposed algorithm.https://ieeexplore.ieee.org/document/9112183/Key transmission sectionspower grid operation monitoringadjacency matrixtopology convergingblackouts
collection DOAJ
language English
format Article
sources DOAJ
author Dabo Zhang
Naijing Wang
Hejun Yang
Yinghao Ma
Yigang He
Wei Tang
Jingjing Wang
spellingShingle Dabo Zhang
Naijing Wang
Hejun Yang
Yinghao Ma
Yigang He
Wei Tang
Jingjing Wang
Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix
IEEE Access
Key transmission sections
power grid operation monitoring
adjacency matrix
topology converging
blackouts
author_facet Dabo Zhang
Naijing Wang
Hejun Yang
Yinghao Ma
Yigang He
Wei Tang
Jingjing Wang
author_sort Dabo Zhang
title Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix
title_short Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix
title_full Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix
title_fullStr Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix
title_full_unstemmed Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix
title_sort fast search algorithm for key transmission sections based on topology converging adjacency matrix
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description The traditional method of searching transmission section generally has the problem of omission and time-consuming. A topology converging algorithm of power grid adjacency matrix is proposed in this paper. It aggregates neighboring buses based on a simple matrix transformation rule, and identify key transmission sections based on matrix operations and power flow distribution factors. This method has the advantage of no presetting the sub-zone, which can avoid the simplification of the grid topology in the sub-zone and improve the calculation accuracy. The complex logical operations of the traversal algorithm adopted by most of traditional methods can be avoided, and the calculation speed can be effectively improved. Besides, the algorithm also has a memory characteristic which can be applied to the online search of key transmission sections. The results of several IEEE test systems show the effectiveness of the proposed algorithm.
topic Key transmission sections
power grid operation monitoring
adjacency matrix
topology converging
blackouts
url https://ieeexplore.ieee.org/document/9112183/
work_keys_str_mv AT dabozhang fastsearchalgorithmforkeytransmissionsectionsbasedontopologyconvergingadjacencymatrix
AT naijingwang fastsearchalgorithmforkeytransmissionsectionsbasedontopologyconvergingadjacencymatrix
AT hejunyang fastsearchalgorithmforkeytransmissionsectionsbasedontopologyconvergingadjacencymatrix
AT yinghaoma fastsearchalgorithmforkeytransmissionsectionsbasedontopologyconvergingadjacencymatrix
AT yiganghe fastsearchalgorithmforkeytransmissionsectionsbasedontopologyconvergingadjacencymatrix
AT weitang fastsearchalgorithmforkeytransmissionsectionsbasedontopologyconvergingadjacencymatrix
AT jingjingwang fastsearchalgorithmforkeytransmissionsectionsbasedontopologyconvergingadjacencymatrix
_version_ 1724184386468839424