Topology Algorithm of Power Network Based on Breadth-First-Search

Abstract:

Aiming at the defects of repeating searching the path, low efficiency and the slow speed of the traditional topology algorithm, proposes a network topology algorithm based on Breadth-First-Search in this paper.Introduces the topology modeling method,and the electric equipment is abstracted into nodes and branches,making the topology process not constrained by the network connection and structure,enhancing universal property of the algorithm.Then introduces the traditional method, and analysises the disadvantages. At the same time,puts forward a new method. Uses node-branch adjacency list in the new method,which improves the topology speed.When the local switch information is changed, can modify the node-branch adjacency list to conduct the local re-topology,so it improves the topology flexibility. Finally, through the example, proves the superiority and practicability of this algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 556-562)
• Pages: 4591-4595
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.556-562.4591
• Online since: May 2014
• Authors: Lin Wei Li*, Xing He Ma, Lian Ming Zhang
• Keywords: Model, New Method, Power Network, Superiority, Topology, Traditional

References

[1] Christophe Duhamel, Philippe Lacomme, Caroline Prodhon. A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems[J]. Engineering Applications of Artificial Intelligence. 2012, vol. 25(2): 345-358.

DOI: 10.1016/j.engappai.2011.10.002

[2] Christophe Duhamela, Philippe Lacommea, Caroline Prodhonb. Efficient frameworks for greedy split and new depth first search split procedures for routing problems[J]. Computers & Operations Research. 2011, vol. 38(4): 723-739.

DOI: 10.1016/j.cor.2010.09.010

[3] An Huaming, Lin Bin, Lv lixing. Positioning Mine Ventilation Recirculation Winds Based on the Depth-First Search Method[J]. Procedia Engineering, 2011, vol. 24: 400-403.

DOI: 10.1016/j.proeng.2011.11.2665

[4] Defu Zhang, Yu Peng, Stephen C.H. Leung. A heuristic block-loading algorithm based on multi-layer search for the container loading problem[J]. Computers & Operations Research, 2012, vol. 39(10): 2267-2276.

DOI: 10.1016/j.cor.2011.10.019

[5] Wen-Tsai Sung. Multi-sensors data fusion system for wireless sensors networks of factory monitoring via BPN technology[J]. Expert Systems with Applications, 2010, vol. 37(3): 2124-2131.

DOI: 10.1016/j.eswa.2009.07.062

[6] Xiong Yun-feng, Wang Shisheng, Zhang Wenqian. A Line-Selection Method of Data Fusion Based on Neural Network[J]. Procedia Engineering, 2012, vol. 29: 520-525.

DOI: 10.1016/j.proeng.2011.12.754

[7] Enrico Mastrostefano, Massimo Bernaschi. Efficient breadth first search on multi-GPU systems[J]. Journal of Parallel and Distributed Computing, 2013, vol. 73(9): 1292-1305.

DOI: 10.1016/j.jpdc.2013.05.007

[8] Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel. On end-vertices of Lexicographic Breadth First Searches[J]. Discrete Applied Mathematics, 2010, vol. 158(5): 434-443.

DOI: 10.1016/j.dam.2009.10.001

[9] Chia-Chang Hu, Wei-Cheng Luo. Modified K-best breadth-first assisted antenna selection for dual-hop MIMO AF multiple-relay systems in correlated channels[J]. AEU-International Journal of Electronics and Communications, 2013, vol. 67(2): 149-156.

DOI: 10.1016/j.aeue.2012.07.002