About the Authors:
Juan Wen
* E-mail: [email protected]
Affiliations College of Electrical and Information Engineering, Hunan University, Changsha, Hunan, China, College of Electrical and Information Engineering, University of south China, Hengyang, Hunan, China
Yanghong Tan
Affiliation: College of Electrical and Information Engineering, Hunan University, Changsha, Hunan, China
Lin Jiang
Affiliation: College of Electrical and Information Engineering, University of south China, Hengyang, Hunan, China
Introduction
As one of the main findings in the study of complex systems, the ubiquitous presence of networks in nature and society has attracted much attention of many researchers. The topologies of such networks have been profusely researched and some fundamental structures have been discovered [1]. These network topologies are widely employed to analyze the characteristics of complex real systems, such as electrical power systems [2–5], biomedicine systems [6–11], communication systems [12], traffic systems [13], and so on. This research interests in the power distribution networks.
In a distribution system, many feeders are interconnected with the switches. These switches are divided into two types of switches: sectionalizing switches and tie switches. By changing the status of the switches, power loads can be transferred from one feeder to another feeder. That is, the network topology can be reconfigured to improve distribution system reliability, economy and security. Under normal or abnormal operating conditions, network reconfiguration is a process that consists in altering the status of sectionalizing and tie switches. We obtain an optimal radial topology which satisfies desired objectives of balancing overloads [14], minimizing power loss [15], and improving voltage profile [16]. Traditional goal of the power loss minimization has gained much attention because excessive power loss would lead to high operating cost [15]. Other objectives are to increase the system reliability and usage life of electrical equipments [17–19]. With the growing complexity of the distribution systems, the node importance of the network is becoming more and more important because it reflects the robustness of the network structure.
An effective evaluation index of node importance is node importance degree which is applied to evaluate the robustness and survivability of power networks [20–27]. Researchers have explored the fundamental definition of node importance degree. Watts and Strogatz firstly reveal that the power system of the western United States is a small-world topology network. In this topology network, they suggest the node importance degree based on the complex theory is an index to evaluate the network robustness [20–21]. References [22–23] give the computational methods of node importance degree from the perspective of system science. And then it is used to analyze the relation of the nodes and cascade failures in [24]. Considering the topological characteristics of scale-free networks, the node importance degree is regarded as a reconfiguration index which is used to evaluate the performance of transmission line network reconfiguration [25–26]. Reference [27] adopts the maximization restoration paths as the reconfiguration objective to find an optimal restoration path with evaluation model of node importance degree. These reviews have focused on the skeleton-network reconfiguration of transmission network which aims to establish the main network and restore essential loads. The improvement of the topology structure robustness is usually omitted in the distribution network reconfiguration. Moreover, we would simulate the network reconfiguration in a particular case using these schemes. No reference examines the relationship between node importance degree and system power loss in the process of network reconfiguration.
Network reconfiguration is an importance tool to optimize and control the operation of modern distribution systems. The node importance degree is a significant index to evaluate the practicability of reconfiguration strategy as it reflects the robustness and survivability of network structures after reconstruction. Thus, this paper proposes a novel reconfiguration strategy considering the node importance degree and power loss. To balance the objectives, we formulate a compound objective function which includes two sub-objective functions of minimization of power loss and maximization of node importance degree. And the priority of the indices are determined by the weight coefficients. We employ the quantum particle swarm optimization to address the compound objective reconfiguration problem. Using the proposed strategy, we obtain the reconfiguration configurations which have improved the network economy and robustness. Instead of providing an optimal topology network in detail, this strategy intends to obtain several reconfiguration schemes with better performance as the guidance of dispatching operation. Furthermore, it reveals that the relationship among the evaluating indices. The application examples illustrate that the proposed reconfiguration strategy are more suitable for the practical distribution network compared with other strategies.
The material in this paper is arranged in the following order: section 2 deals with the evaluation method of node importance degree. Section 3 gives the reconfiguration mathematical model and objective function. The procedure of compound objective reconfiguration is presented in section 4. In section 5, we present the simulation results and discussion to assess the effectiveness of the proposed strategy. Conclusion and remarks are highlighted in section 6.
Node Importance Evaluation Model
Topology structure of a real distribution system can be represented by an abstract graph, whose nodes and branches are corresponding to bus bars and electric elements or switches, respectively. Assuming a system with n nodes and m switches, the topology graph is described as G = (V,E), where V = {v1,v2,…vn} represents the set of nodes and E = {e1,e2,…en} represents the set of branches. The nodes and branches, as the core elements of the topology graph, are significant to analyze the network connectivity. A branch exists between two nodes if there is a direct link between the associated nodes. Therefore, the network connectivity of the graph G = (V,E) is represented as an adjacency matrix A which is expressed as:(1)
Where aij is a binary variable, if there is a branch between node i and node j, then aij = 1. Otherwise, aij = 0.
The degree of node i is defined as the maximum number of branches emanating from the node. It is denoted by Di.
(2)
Generally, the node degree is used to measure the importance of each node in studying complex topology network. It is assumed that the nodes with more branches connected are more important [10]. However, some critical nodes in real network have low node degrees because there are a few branches linked them. The node degree cannot accurately express the importance of these nodes. To address the inconsistency, we introduce the node importance degree to describe the importance of nodes in the network.
The node importance degree reflects the network robustness by assessing the importance of the nodes [25]. In this section, we apply the node contraction to analyze the node importance degree. Let G = (V,E) be an original distribution network. Let G′ = (V′,E′) represent the topological structure after i-node contraction. That is, i-node and the nodes connected with i-node are merging into a new node i′. The i-node importance degree is formulated as:(3)
Where δi represents i-node importance degree, n′ is the number of nodes in new network G′, the average distance among the nodes is lave. In the new network topology, lave is described as:(4)
Where dmin represents the minimum distance between node j and node k, V′ represents the set of nodes in the new network G′.
It is observed that i-node importance degree δi lies on the node degree Di and its position in network. The original network is changed slightly or remarkably after node contraction. The number of nodes changes from n in original network G to n’ in new network G′. Similarly, the average shortest distance lave between original network and new network is different. Above all, if a node is connected with more branches, namely the larger node degree, its contraction would reduce the number of nodes considerably, the network would contract together much better. For example, only one node remains after the contraction of the center node in the special star network. So the node has large node importance degree. Secondly, if the nodes at pass location are contracted, the average shortest distance would be decreased greatly because these nodes are necessary in the shortest path of many node pairs. We obtain a large node importance degree.
According to the physical definition δi, the maximum node importance degree obtained is 1 if there is only one node in the network after contraction. In general, the average shortest distance is less than 1 [23]. Therefore, the range of node importance degree is 0 < δi ≤ 1. An initial network with 10 nodes and 9 branches is shown in Fig 1. For obtaining the node importance degree δi of node 6, we should update the original network after node contraction. It means that the nodes 1, 2, 3, 8 directly connected this node and node 6 would merge into a new node 6’. Fig 2 shows the new network after node contraction. As a result, the calculated node importance degrees of nodes 6, 7, and 8 are given in Table 1.
[Figure omitted. See PDF.]
Fig 1. Initial distribution network.
https://doi.org/10.1371/journal.pone.0168350.g001
[Figure omitted. See PDF.]
Fig 2. Network after node contraction.
https://doi.org/10.1371/journal.pone.0168350.g002
[Figure omitted. See PDF.]
Table 1. Comparison of δi and Di of nodes.
https://doi.org/10.1371/journal.pone.0168350.t001
From the Fig 1, node 8 is the most critical node in the network. But node 8 has lower degree Di than nodes 6 and 7. It is evident that the node degree cannot accurately identify the importance of some critical nodes. The importance degree of nodes 6, 7 and 8 are 0.0781, 0.0652 and 0.0833, respectively. It is obvious that the node 8 is more important than nodes 7 and 6. The obtained results illustrate that the node with larger node degree may not be more important. Moreover, nodes 7 and 8 have the same node degree (Di = 3), but node 8 is much more important than node 7 through comparing the δ. Thus, the index of node importance degree is more distinct to distinguish network node importance than node degree.
Compound Objective Function
Distribution network reconfiguration is a nonlinear combinational optimization problem which aims to find the optimal radial configurations of satisfying different optimization objectives and operation constraints. In order to improve network robustness and economy, we select the node importance degree and active power loss as the optimization indices of reconfiguration.
(1) Node importance degree index
The node importance degree is an evaluation index of network robustness. The importance degree of a node is higher, the node is more important. In the previous section, the maximum node importance degree obtained is 1 and the range is 0 < δi ≤ 1. Therefore, the objective function of network robustness is formulated as:(5)
Where n is the number of nodes in the original network, δi represents i-node importance degree.
(2) Power loss index
The active power loss of the system is considered as one of the objectives because excessive power loss would increase overheating of the electric components and additional costs. The total power loss of a distribution network is computed by summing the loss of all branches and it should be reduced during reconfiguration. In the modern distribution systems, the switches are divided into sectionalizing switches (normally closed switches) and tie switches (normally open switches). The status of switches determines the corresponding branch connected or not. If the branch is disconnected, the power loss of this branch need not be calculated. A distribution system with m nodes, the objective function of the system power loss is expressed as follows.(6)
Where floss is total active power loss of the system, m is the number of nodes, Ploss(b,b+1) is the power loss of the branch connecting the node b and node b+1. kb is the status of the branch connecting the nodes b and b+1. kb = 1 if the branch is closed, and kb = 0 represents opened the branch.
The system power loss floss formula is deduced by the power flow equations [28,29]. We get the power loss of the branch connecting the node b and node b+1.
(7)
Where Pb and Qb are the active and reactive power flows out of the node b. The resistance of the branch between nodes b and b+1 is represented as rb. Vb is voltage magnitude of node b. Thus, the system power loss can be represented as:(8)
(3) Compound objective function
Aiming to reduce power loss and improve the node importance degree, the distribution network is reconfigured. In order to optimize these objectives simultaneously, traditional method is performed by a sum of objective functions [30]. The obtained solution is not suitable for the current situation of the network if the relationship of the objectives is in conflict or competition. In this paper, we assign significance weight coefficients to the objective functions and add them up. They are denoted by w1 and w2. And the relationship between them is w1 + w2 = 1 [31]. Then a compound objective function including double sub-objective functions of node importance degree and system power loss is formulated. The terms of the compound objective are not dimensionally homogenous because they have different statistical pattern and different types of parameters. Also, the variation range of the parameters is much different. We should normalize the sub-objective functions and embed the penalty factors. Since the aim of network reconfiguration is the improvement of the performance of the network, the indices after reconfiguration are better than before reconfiguration. In the abnormal condition, the starting point of distribution network reconfiguration is the initial distribution network structure. Thus, the indices of initial network topology is regarded as the normalized standard value. The two normalized sub objective functions are expressed as:(9)(10)
Where , fploss, and fplossin are the power loss of normalization, current topology, and initial topology, respectively. , fδ, and fδin represent the node importance degree of normalization, current topology, and initial topology, respectively.
The network reconfiguration is a mixed nonlinear optimization problem. During the process of optimization, the indices after reconfiguration are better than initial network. To accelerate the speed of optimization, we assign the penalty factors (x1, x2) into the compound objective function. The penalty factors depend on the initial values and current values of the normalized function. For example, if the normalized function , it means that the obtained configuration is not suitable because the current power loss is greater than initial network. We should adjust the optimization search direction by setting a large penalty factor. On the other hand, if , we reserve the solution and the x1 set 1. So the penalty factors would impact on the speed of the optimization algorithm. The x1 and x2 are described as:(11)(12)
Where N is a decimal integer. Therefore, the compound objective function is described as:(13)
Where w1 and w2 represent the weight coefficients.
The compound objective function (13) subjects to the network operation constraints, as given by the set of Eqs (14–17).
(14)(15)(16)(17)
Where subscripts of max and min are upper and lower bounds, A is bus incidence matrix and is calculated by Eq (1). If det(A) = 1 means that the identified topology structure is a radial configuration. The Eqs (14) and (15) represent current thermal constraints and transmission power capacity constraints at each branch. The Eq (16) represents the nodal voltage constraints.
Methodology
In this paper, we propose a compound objective reconfiguration strategy for distribution networks. Under the operation constraint, the network reconfiguration aims to find the topologies which satisfies the compound objective. It is a complicated combinatorial optimization problem, making the use of classical methods to solve it optimally prohibitive. This study employs the quantum particle swarm optimization (QPSO) to address the reconfiguration problem as it has the capacity to parallel optimize combinational functions. And the QPSO has been successfully to solve the optimization problems in electrical engineering [32–34]. The QPSO is a population-based evolutionary technique that has many key advantages over other optimization algorithms [35–36]. It can hold the best solution of each particle and avoid premature convergence. Furthermore, it is less sensitive to the nature of the objective function and has ability to escape the local minima. A general structure of the QPSO is described as Fig 3.
[Figure omitted. See PDF.]
Fig 3. Flow of the network reconfiguration.
https://doi.org/10.1371/journal.pone.0168350.g003
(1) Input initial data. The inputs of the procedure are initial topology structure, population size, compound objective function, and maximum iterations. Then we calculate the initial values of node importance degree and power loss.
(2) Design variable expression and code scheme. A good variable expression is critical to improve the efficiency of optimization algorithm. A solution is considered as a particle. Assuming that a solution vector is x = (x1,x2…xn), where n is the number of bits of a particle or the number of the tie switches, xn represents the label of opened switch. For a distribution network with n tie switches, the number of fundamental loops is n. The number of bits of each particle is equal to the number of loops. Each bit indicates the branch number, located in the corresponding loop, that should be open. We obtain the each variable range by analyzing the set of each fundamental loop vector. In each loop, we randomly select a switch to open. Thus, a set of random candidate solutions is established.
(3) Check the validity of the solutions. A solution is corresponding to a possible topology. Since the distribution system operates with a radial topology, we have to check the feasible of the candidate solutions. The bus incidence matrix A of a candidate topology is generated according to Eq (1). The determinant absolute value of matrix A is represented as |det(A)|. The current topology is radial if |det(A)| = 1, then continue the next step. Else if the determinant of matrix A is equal to zero, this means that either the current topology is not radial or group of power loads are disconnected from the service. We reexamine the feasibility of next group of particles in the population.
(4) Set the weight coefficients (w1, w2). And the fitness value f of an effective particle is calculated by .
(5) Calculate the fitness value f of each particle. In k iteration generation, and are the current position and global best position of particle i. The optimal position of D-dimensional particle i is . And the global average position of each particle is obtained by the equation of .
(6) Update the position vectors of each particle in the population using the equation of , where u and φ are the uniformly distributed random number in [0,1], round() is the integral function, and β is used to control the convergence speed of the algorithm.
(7) Repeat steps (4)–(6) until a termination criterion is satisfied. The obtained Xid is the best solution of the network. Then output the optimal position.
Results and Discussion
Case I: 33-bus system
IEEE33-bus system broadly published in literatures is a standard 12.66kV network, having 33 nodes, 32 sectionalizing switches and 5 tie-switches. It is employed to demonstrate the effectiveness of the proposed strategy. The system details are given in [34]. The normally closed switches are 1 to 32, and normally open switches are 33 to 37. The active and reactive power loads of the system are 3715kW and 2300kVar, respectively. This paper formulates the distribution network reconfiguration as a compound objective optimization problem. Quantum particle swarm optimization is used to solve this problem. The population size and the maximum number of iterations are 50 and 200, respectively.
The original importance degree of each node is computed by using node contraction method. In order to describe and evaluate the relative role of each node, the original importance degrees should be normalized further into node relative importance degree. The normalized standard value is ideal maximum δi if the index of node importance degree is considered as the only reconfiguration objective. Under this circumstance, the each node importance degree obtained after reconfiguration is shown in Table 2.
[Figure omitted. See PDF.]
Table 2. Ideal node importance degree (after reconfiguration).
https://doi.org/10.1371/journal.pone.0168350.t002
Table 2 presents the obtained δi of optimal configuration by optimizing the single objective of node importance degree. It can be seen that the maximum node importance after reconfiguration is nodes 6 and 8 with 0.0061. Note that this constant value is supposed as the standard value, the node importance degree rank is regulated to 1. Therefore, the relative node importance degrees before and after reconfiguration are listed in Table 3.
[Figure omitted. See PDF.]
Table 3. Relative node importance degree.
https://doi.org/10.1371/journal.pone.0168350.t003
Following the steps presented of the reconfiguration strategy, we obtain a set of best solutions by adjusting weight coefficients. The simulation results with the values of the objective functions are shown in Table 4.
[Figure omitted. See PDF.]
Table 4. Reconfiguration results of different weight coefficients (33-bus system).
https://doi.org/10.1371/journal.pone.0168350.t004
To validate the effectiveness of the proposed reconfiguration model, the obtained extreme fitness values are compared with the results of other methods by optimizing each objective function separately that are shown in Tables 5 and 6, respectively. In the compound function model, the weight vector is (w1 = 0, w2 = 1) when only the maximization of node importance degree is considered as the reconfiguration objective. And the weight vector is equal to (w1 = 1, w2 = 0) if the reconfiguration objective is the minimization of system power loss.
[Figure omitted. See PDF.]
Table 5. Obtained results by optimizing power loss as the only objective.
https://doi.org/10.1371/journal.pone.0168350.t005
[Figure omitted. See PDF.]
Table 6. Obtained results by optimizing node importance degree as the only objective.
https://doi.org/10.1371/journal.pone.0168350.t006
Table 5 shows the results when the minimization of power loss is considered as the only objective function. It is obvious that the compound objective reconfiguration strategy is capable of finding the best configuration which is comparable to other methods. The generated best switches combination [7 14 9 32 37] represents a topology network in which all the switches are closed except the sectionalizing switches 7, 14, 9, 32, and 37. By comparing to the Tables 4 and 5, the power loss of final configuration obtained is 139.4410kW which is less than other approaches in [17, 36, 37]. Table 6 indicates that only our strategy can reach the optimal solution in optimizing the objective of the maximization of node importance degree. It can be seen that the opened switches combination is [18 12 11 31 24] which is different in references [17, 34, 36, 37]. Having found this final solution, the relative importance degree of each node is shown in Table 2. As shown, the importance degrees of all nodes have been improved after reconfiguration. And the sum of relative node importance degree has reached the maximum value 28.9344 which is increased by 30.92% compared to the initial network. Specially, The relative importance degree of 29-node after reconfiguration is increased by 39.03% of its initial value. Thus, the network robustness has been improved significantly after reconfiguration. However, it is not favorable for economic running because the power loss is higher 50.37% than initial network.
In order to verify the performance of the proposed strategy, we analyze statistically the reconfiguration results of different weight coefficients. By comparing the results obtained in Tables 3–6, it is noticeable that the proposed model is more efficient and flexible in terms of candidate reconfiguration schemes. We get a set of radial configurations of improving the network economy and robustness by adjusting weight coefficients. The decision maker can change flexibly the operation configuration according to the actual operation requirements and his experience. Hence, the proposed strategy is more suitable for the actual distribution system reconfiguration than conventional methods. To compare the change of the reconfiguration objective before and after network reconfiguration, we provide the obtained reconfiguration results when w1 = w2 = 0.5. The best configuration identified is the following: 33–7, 34–14, 35–10, 36–32, and 37–28. Fig 4 clearly shows each branch’s active power loss of the best configuration and the initial network. This amount is 140.5971kW which is approximately 30.4% reduction of initial power loss. A comparison of each node’s importance degree for both networks is presented in Fig 5. It is observed that each node importance degree of the best configuration is improved. As it can be gathered from the figure, the sum of nodes importance degree is 25.2787, which is higher than the initial network.
[Figure omitted. See PDF.]
Fig 4. Each branch power loss of 33-bus system.
https://doi.org/10.1371/journal.pone.0168350.g004
[Figure omitted. See PDF.]
Fig 5. Each node importance degree of 33-bus system.
https://doi.org/10.1371/journal.pone.0168350.g005
The weight coefficients represent the weight of each sub-objective index system. If w1 is greater than w2, the sub-objective of power loss takes priority over the node importance degree. On the contrary, when w1 < w2, the node importance degree is considered as a dominated objective. In order to investigate the relation of the objectives, weight coefficients for maximum tardiness is decreased by 0.1, and weight coefficients for maximum completion time is added by 0.1 in ascending. Table 4 gives the obtained results of different scenarios network reconfiguration. We can derive that the weight coefficients would influence the changes of the network economy and robustness. For example, in situation A (w1 = 0.3, w2 = 0.7), the best configuration obtained is 7, 14, 10, 32, and 27, where the power loss and the sum of node importance degree are 143.9131kW and 25.5902, respectively. The optimal power loss of situation B (w1 = 0.2, w2 = 0.8) is 167.1668kW which is greater than 143.9131kW. The sum of node importance degree increases to 26.4918. Compared the two solutions, an investment cost of the situation A is higher than situation B. But the network robustness of situation B are more attractive than situation A. Based on these results, it is possible to say that increment of node’s importance degree could increase the power loss (solutions listed in the third and fourth rows of Table 4). It means that the improvement of network robustness may reduce the network economy. The two sub-objectives are in conflict but not in simple inverse linear relation.
We can observe that the different weight coefficients would lead to the same reconfiguration results from Table 4. Under the circumstances, it is illustrated that the reconfiguration results are less sensitive to the weight coefficients. We can select the final topology by fixing randomly a set of weight vector. In Table 4, the scenarios of weight vectors adopted w = (0.9,0.1), (0.8,0.2), and (0.7,0.3) lead to the same experimental results. A group of w = (0.9,0.1) is selected at random, the final reconfiguration results are described as Table 7.
[Figure omitted. See PDF.]
Table 7. Final Reconfiguration results (33-bus system).
https://doi.org/10.1371/journal.pone.0168350.t007
Case II: 69-bus system
The next case is PG&E 69-bus system which is also employed to demonstrate the feasibility and effectiveness of the proposed strategy. It is comprised of 68 sectionalizing switches and 5 tie switches. The initial topology is shown in Fig 6 and the system data is given in [36]. We establish a compound objective function as the reconfiguration objective. The initial parameters of the proposed strategy are the same of the case I. The experimental results obtained in different weight vectors are shown in Table 8.
[Figure omitted. See PDF.]
Fig 6. Initial topology of the 69-bus system.
https://doi.org/10.1371/journal.pone.0168350.g006
[Figure omitted. See PDF.]
Table 8. Comparison of reconfiguration results before and after reconstruction (69-bus system).
https://doi.org/10.1371/journal.pone.0168350.t008
Similarly to verify the results presented in Table 8, the extreme points of the obtained best configuration are compared with the results of other methods by optimizing only the objective of minimum power loss that are shown in Table 9. The results presented demonstrate that the proposed model is capable of finding best solution. The power loss after reconfiguration is amount 55.72% of initial real power loss, i. e. 99.6205kW, which is comparable to [36] and [37] but less than other methods. It is again implied the effectiveness of the proposed method in terms of searching optimal reconfiguration network. Moreover, the network robustness would be reduced because the minimum relative node importance degree is reduced by 9.09% compared to the original network. Since there are no references analyzing node importance degree, the proposed model has not been compared with other schemes in view of the node importance degree index.
[Figure omitted. See PDF.]
Table 9. Obtained results by optimizing power losses as the only objective (69-bus system).
https://doi.org/10.1371/journal.pone.0168350.t009
The solution set, that is, the results obtained by applying compound reconfiguration objective function to 69-bus system reconfiguration are presented in Table 8. Once the weight vector is determined, the corresponding optimal solution would be generated. The obtained reconfigurations by modelling different scenarios network reconfiguration have improved the network robustness and economy. Thus, the proposed strategy is able to present more benefit to utility operator because of providing several high-quality schemes. Assuming that the minimum power loss is just as important as the improvement node importance, the weight vector is w = (0.5,0.5). The initial network is modified by closing the opened switches combination [69 70 71 72 73] and opening closed switches combination [63 17 14 52 47] to represent best topology which is shown in Fig 7. Fig 8 compares each branch’s power loss profiles both initial and optimal topologies. This amounts to a reduction of 46.73% in total power loss. And each node’s relative node importance degree is depicted in Fig 9. It is observed that minimum node importance degree for this modified configuration is increased to 0.8750. This shows the improvement of network robustness using the proposed reconfiguration model. Moreover, the enhancement of the node importance degree could harm the index of power loss minimization by analyzing the results of the third and fifth columns.
[Figure omitted. See PDF.]
Fig 7. Topology network of 69-bus system after reconfiguration.
https://doi.org/10.1371/journal.pone.0168350.g007
[Figure omitted. See PDF.]
Fig 8. Each branch power loss of 69-bus system.
https://doi.org/10.1371/journal.pone.0168350.g008
[Figure omitted. See PDF.]
Fig 9. Each node importance degree of 69-bus system.
https://doi.org/10.1371/journal.pone.0168350.g009
By observing the results represented in Table 8, the proposed strategy is more efficient and flexible because a set of candidate optimal configurations are appeared. Also it is observed that different weight vectors lead to same configuration. In this circumstance, we select randomly a set of weight vector. Table 10 summarizes the final reconfiguration results.
[Figure omitted. See PDF.]
Table 10. Final reconfiguration results (69-bus system).
https://doi.org/10.1371/journal.pone.0168350.t010
Conclusions
This paper presents a new reconfiguration strategy with compound objective function. Based on the complex theory, the quantitative node importance degree is an effective index of distribution network reconfiguration because it reflects the network robustness by evaluating the node importance. To evaluate the reconstructed network’s economy and robustness, we build a compound objective function which incorporates with minimization of power loss and maximization of node importance degree. Then the quantum particle swarm algorithm is used to solve this compound objective optimization problem. Simulation results and the performance assessment analysis illustrate that the effectiveness of the proposed reconfiguration strategy. By adjusting weight coefficients, the proposed strategy intends to obtain a set of best configurations of improving the network economy and robustness. Thus, the obtained solutions bring about an extra flexibility for decision maker. They can choose flexibility the appropriate plans in accordance with the operation condition and different requirements of the system. It will benefit the guidance of dispatching operation.
Acknowledgments
This work was supported by National Natural Science Foundation of China(61102039), National hi-tech research and development plan(2014AA052600). The authors would like to acknowledge the many helpful suggestions of the anonymous reviewers and the editor, which have improved the content and the presentation of this paper.
Author Contributions
1. Conceptualization: JW YHT.
2. Data curation: JW YHT LJ.
3. Formal analysis: JW LJ.
4. Investigation: JW YHT LJ.
5. Methodology: JW YHT.
6. Project administration: JW.
7. Resources: JW YHT LJ.
8. Software: JW YHT LJ.
9. Supervision: LJ.
10. Validation: JW LJ.
11. Visualization: LJ.
12. Writing – original draft: JW.
13. Writing – review & editing: JW YHT LJ.
Citation: Wen J, Tan Y, Jiang L (2016) A Reconfiguration Strategy of Distribution Networks Considering Node Importance. PLoS ONE 11(12): e0168350. https://doi.org/10.1371/journal.pone.0168350
1. Strogatz SH. Network robustness and fragility: percolation on random graphs. Physical Review Letters. 2000; 85(25):5468–5471. pmid:11136023
2. Vukovic O, Sou KC, Dan G, Sandberg H. Network-aware mitigation of data integrity attacks on power system state estimation. IEEE Journal on Selected Areas in Communications. 2012; 30(6):1108–1118.
3. Werho T, Kolluri S, Kolluri S, Wong SM. Power system connectivity monitoring using a graph theory network flow algorithm. IEEE Transactions on Power Systems. 2016; 1(1):1–8.
4. Neshvad S, Margossian H, Sachau J. Topology and parameter estimation in power systems through inverter-based broadband stimulations. IET Generation Transmission & Distribution. 2016; 10(7):1710–1719.
5. Dong D, Cvetkovic I, Boroyevich D, Zhang W, Wang RX, Mattavelli P. Grid-interface bidirectional converter for residential DC distribution systems—part one: high-density two-stage topology. IEEE Transactions on Power Electronics. 2013; 28(4): 1655–1666.
6. Zeng X, Zhang X, Zou Q. Integrative approaches for predicting microRNA function and prioritizing disease-related microRNA using biological interaction networks. Briefings in Bioinformatics. 2016; 17(2): 193–203. pmid:26059461
7. Zou Q, Li JJ, Song L, Zeng XX, Wang GH. Similarity computation strategies in the microRNA-disease network: a survey. Briefings in Functional Genomics. 2016; 15(1): 55–64. pmid:26134276
8. Wang SP, Huang GH, Hu QH, Zou Q. A network-based method for the identification of putative genes related to infertility. Biochimica Et Biophysica Acta. 2016; 1860(11): 2716–2724.
9. Zou Q, Li JJ, Wang C, Zeng XX. Approaches for recognizing disease genes based on network. Biomed Research International. 2014; 5013: e416323.
10. Liu Y, Zeng X, He Z, Zou Q. Inferring microRNA-disease associations by random walk on a heterogeneous network with multiple data sources. IEEE/ACM Transactions on Computational Biology & Bioinformatics. 2014; 1(99):1–11.
11. Zou Q, Li JJ, Hong QQ, Lin ZY, Wu Y, Shi H, et al. Prediction of microRNA-disease associations based on social network analysis methods. Biomed Research International. 2015; 2015:e810514.
12. Maghsudi S, Stanczak S. Hybrid centralized-distributed resource allocation for device-to-device communication underlaying cellular networks. IEEE Transactions on Vehicular Technology. 2016; 65(4): 2481–2495.
13. Bhuyan MH, Bhattacharyya DK, Kalita JK. A multi-step outlier-based anomaly detection approach to network-wide traffic. Information Sciences. 2016; 348: 243–271.
14. Bernadon DP, Garcia VJ, Ferreira ASQ, Cunha LN. Multi-criteria distribution network reconfiguration considering sub transmission analysis. IEEE Transactions on Power Delivery. 2010; 25(4):2684–2691.
15. Xu Y, Dong ZY, Wong KP, Liu E, Yue B. Optimal capacitor placement to distribution transformers for power loss reduction in radial distribution systems. IEEE Transactions on Power Systems. 2013; 28(4):4072–4079.
16. Tian Z, Wu W, Zhang B, Mixed-integer second-order cone programing model for VAR optimisation and network reconfiguration in active distribution networks. IET Generation Transmission & Distribution. 2016; 10(8):1938–1946.
17. Gupta N, Swarnkar A, Niazi R. Distribution network reconfiguration for power quality and reliability improvement using genetic algorithms. International Journal of Electrical Power & Energy Systems. 2014; 54(54): 664–671.
18. Mendonza JE, Lopez ME, Coello AC, Lopez EA. Microgenetic multiobjective reconfiguration algorithm considering power losses and reliability indices for medium voltage distribution networks. IET Generation, Transmission & Distribution. 2009; 3(9): 825–840.
19. Alonso FR, Oliveira DQ, Zambroni de Souza AC. Artificial immune systems optimization approach for multiobjective distribution system reconfiguration. IEEE Transactions on Power Systems. 2015; 30(2): 840–847.
20. Watts JD, Strogatz SH. Collective dynamics of ‘small-world’ networks. Nature. 1998; 393(6684): 440–442. pmid:9623998
21. Arianos SE, Carbone A, Xue F. Power grid vulnerability: a complex network approach. Physics. 2009; 19(1): 1–6.
22. Deng CH, Hu NN, Xie QY. Evaluation of the importance of network nodes based on weighted network model. In: 2009 Asia-pacific Power & Energy Engineering Conference. IEEE; 2009, p. 1–4.
23. Li CB, Liu WC, Cao YJ, Chen H, Fang BL, Zhang W, Shi HQ. Method for evaluating the importance of power grid nodes based on Page Rank algorithm. IET Generation, Transmission & Distribution. 2014; 8(1): 1843–1847.
24. Crucitti P, Latora V, Marchiori M. Model for cascading failures in complex networks. Physical Review E. 2004; 69(4) e045104.
25. Liu Y, Gu XP. Skeleton-network reconfiguration based on topological characteristics of scale-Free networks and discrete particle swarm optimization. IEEE Transactions on Power Systems. 2007; 22(3): 1267–1274.
26. Huang JK, Du L, Zhang GS. Skeleton-network reconfiguration based on node importance and line optimization. In: 2012 Asia-Pacific Power and Energy Engineering Conference. IEEE; 2012, P.1-4.
27. Zhang C, Lin ZZ, Wen FS, Ledwich G, Xue YS. Two-stage power network reconfiguration strategy considering node importance and restored generation capacity. IET Generation, Transmission & Distribution. 2014; 8(1): 91–103.
28. Ghosh S, Das D. Method for load-flow solution of radial distribution networks. IEE Proceedings-Generation, Transmission and Distribution. 1999; 146(6):641–648.
29. Rao RS, Narasimham SVL, Raju MR, Rao AS. optimal network reconfiguration of large-scale distribution system using harmony search algorithm. IEEE Transactions on Power Systems. 2011; 26(3): pp. 1080–1088,
30. Imran AM, Kowsalya M. A new power system reconfiguration scheme for power loss minimization and voltage profile enhancement using Fireworks Algorithm. International Journal of Electrical Power & Energy Systems. 2014; 62:312–322.
31. Ma J, Ma W, Xu D, Qiu Y, Wang ZP. A power restoration strategy for the distribution network based on the weighted ideal point method. International Journal of Electrical Power and Energy Systems. 2014; 63(2):1030–1038.
32. Chen W, Zhang J, Lin Y, Chen N, Zhan ZH, Chung HSH, et al. Particle swarm optimization with an aging leader and challengers. IEEE Transactions Evolutionary Computation. 2013; 17(2): 241–258.
33. Khan SU, Yang S, Wang L, Liu L. A modified particle optimization algorithm global optimizations of inverse problems. IEEE Transactions on Magnetics. 2016; 52(3):1–4.
34. Andervazh MR, Olamaei J, Haghifam R. Adaptive multi-objective distribution network reconfiguration using multi-objective discrete particles swarm optimization algorithm and graph theory. IET Generation Transmission & Distribution. 2013; 7(12):1367–1382.
35. Huang YC. Enhanced genetic algorithm-based fuzzy multi-objective approach to distribution network reconfiguration. IEE Proceedings-Generation, Transmission and Distribution. 2002; 149(5):615–620.
36. Gomes FV. A new distribution system reconfiguration approach using optimum power flow and sensitivity analysis for loss reduction. IEEE Transactions on Power Systems. 2006; 21(4): 1616–1623.
37. Mohd Zin AA, Ferdavani AK, Khairuddin AB, Reconfiguration of radial electrical distribution network through minimum-current circular-updating-mechanism method. IEEE Transactions on Power Systems. 2012; 27(2):968–974.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2016 Wen et al. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Abstract
Node importance degree is a vital index in distribution network reconfiguration because it reflects the robustness of the network structure by evaluating node importance. Since the traditional reconfiguration ignores this index, the reconstructed network structure may be vulnerable which would reduce the security and stability of the distribution systems. This paper presents a novel reconfiguration strategy considering the node importance. The optimization objectives are the improvement of the node importance degree and the reduction of power loss. To balance the objectives, the reconfiguration mathematical model is formulated as a compound objective function with weight coefficients. Then the quantum particle swarm algorithm is employed to address this compound objective optimization problem. The strategy can model different scenarios network reconfiguration by adjusting the weight vector based on the tendencies of the utility decision maker. Illustrative examples verify the effectiveness of the proposed strategy.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer