Time filter

Source Type

Xu J.-J.,Northeast Petroleum University | Xu J.-J.,Harbin Institute of Technology | Sha L.-N.,Northeast Petroleum University | Zhang Y.,Northeast Petroleum University | And 4 more authors.
Dianli Xitong Baohu yu Kongzhi/Power System Protection and Control | Year: 2011

Prim and Kruskal algorithms of minimum spanning tree commonly used in solving minimum spanning tree are more suitable for working directly on the map but not suitable for computer solving. Aiming at that, this paper presents a new minimum spanning tree algorithm. According to the definition and nature of the minimum spanning tree, the weight matrix is operated. The advantages are that the solving process is simple and clear, vivid, fast and effective, easy to program, and it has a broader applicability. When solving the minimum spanning tree with multi-node network, the superiority of its calculation speed can be better reflected. Finally, Daqing oil field power is taken as a specific instance to verify the validity of the algorithm. Source

Yan L.-M.,Northeast Petroleum University | Yan L.-M.,Harbin Institute of Technology | Liu G.-C.,Daqing Oil Field Power Group | Zhang Y.,Northeast Petroleum University | And 3 more authors.
Dianli Xitong Baohu yu Kongzhi/Power System Protection and Control | Year: 2011

In this paper, the existing algorithm of the frame optimization based on the improved minimum spanning tree has been improved. On the basis of the original algorithm, we propose a new algorithm to get the minimum spanning tree. The algorithm is simple and easy to program, and improves the efficiency of computation. We take the sum of user power loss and line construction costs and operating costs as the objective function, and build the model with constraint conditions of non-over load of lines, and use the circle iteration method to get the final frame. Finally, taking Daqing oil-field grid for example, we conduct the grids optimization and get a frame optimization result, which realizes the optimal coordination between the efficiency and the reliability of the network. Source

Discover hidden collaborations