Cluster partition-based two-layer expansion planning of grid–resource–storage for distribution networks

Abstract

In order to realize the optimal planning of grid–resource–storage for distribution networks (DNs) with high penetrated distributed photovoltaics (PVs), a cluster partition-based two-layer expansion planning for DNs is proposed. First, a comprehensive cluster partition index-based cluster partition method is proposed, which involves the indexes such as electrical distance, power balance of the cluster, and cluster size. Second, a cluster partition-based two-layer expansion planning model is proposed. In the upper layer, a line planning model for clusters is established to carry out the planning of cluster connection lines. In the lower layer, a robust source-storage planning model is established with the uncertainty of PVs and loads, and then, the optimal location and capacity of PVs and energy storages (ESs) can be obtained. In addition, the uncertainty regulation parameter is utilized to control the range of uncertainty sets, which can reduce the conservatism of the optimization. Finally, the proposed method is carried out in a real DN in China, which can effectively improve the economy of DN planning.

1 Introduction

With the rapid growth of energy demand, photovoltaics (PVs) are developing rapidly in China. The large amount of distributed PVs has significantly changed the power flow of the distribution network (DN) (Li Z. et al., 2022), which poses new challenges to DN planning and operation (Li et al., 2022b). How to carry out optimal DN planning is the key to realize the economic operation of the DNs with large-scale distributed PVs.

Currently, the main idea for planning the DNs with distributed PVs is to build a centralized planning model (Liu et al., 2021) by strengthening or extending the lines of the DNs (Wu H. et al., 2022), which takes into account the investment of PVs (Koutsoukis et al., 2018) and the operating costs (Shen et al., 2018). The centralized planning model is suitable for the DN planning when the proportion of distributed PVs is low. However, when large-scale distributed PV is connected to the DNs, the dimensionality of the variables in the centralized planning model increases significantly (Wu L. et al., 2022), and the planning model becomes too complex to be solved (Zhang et al., 2021). To solve the challenges of centralized optimization, a cluster partition-based planning method provides a new way for DN planning. The cluster partition-based planning method can not only decompose the centralized optimization problem into simple sub-problems of cluster optimization but also maximize the degree of power matching between PVs and the load within the cluster during the planning process, which can greatly increase the PV consumption (Hu et al., 2023).

Cluster partition-based DN planning mainly includes two aspects of cluster partition and cluster planning. In terms of cluster partition, existing research mainly establishes cluster partition indexes based on the grid structure (Xiao et al., 2017) and the power balance in the clusters (Kong et al., 2022). Cluster partition is optimized by particle swarm algorithms (Li and Yang, 2022), clustering algorithms (Wang et al., 2021), and community detection algorithms (Yang et al., 2017). By improving the community algorithm, the division of reactive and active clusters considering the power balance and node coupling degree is realized by Ge et al. (2024). The gray clustering method based on the improved whitening weight function is used to partition the distribution network by Xu L. et al. (2021), and the index weight is obtained by comprehensively applying the analytic hierarchy process and the entropy weight method. The modular index based on the electrical distance and the active power balance index are used as comprehensive division indexes by Li et al. (2022c), and the distributed photovoltaic generation in the distribution network is divided into clusters by using genetic algorithms. Based on the theory of the modularity function model in complex networks, a voltage coordination control method of partitioning the aggregated domain of reactive voltage sensitivity weights and active network loss-voltage sensitivity weights of power systems is proposed by Wang Z. et al. (2023). The nodes with a strong coupling relationship are merged to determine the initial number of partitioning by Ji et al. (2023), and then, the final partitioning result is determined according to the affiliation between each load node and each reactive power source. Combining the K-means clustering algorithm and optimized PSO algorithm for voltage regulation within the cluster ensures that the voltage crossing problem is solved by Su et al. (2023). A cluster partition index system considering the structural and functional properties is proposed by Pan et al. (2021), and the modular index that takes into account the characteristics of electric and heat networks is used on the structural property to describe the connection strength between different network nodes. However, the existing cluster partition indexes only concern the active power balance in each cluster, ignoring the impact of reactive power. Meanwhile, the existing cluster partition indexes ignore the influence of cluster size on the planning results, which can easily lead to large differences in the cluster size, even leading to isolated nodes (Li et al., 2023). In addition, the existing cluster partition methods have insufficient computational accuracy, and for a complex cluster partitioning index, the optimization results tend to fall into local optimum solutions.

The current active distribution network (ADN) planning strategy usually includes the reinforcement or expansion of distribution networks and DG integration under the active management of DG outputs (Mukherjee and Sossan, 2023). A two-level robust optimal feeder routing model for the planning of radial distribution networks is proposed by Zdraveski et al. (2023), where power demand is uncertain. The robust model is solved by implementing the column and constraint generation strategy. A method based on calculating the probability of electric vehicles (EVs) entering each parking lot is proposed by Haji-Aghajani et al. (2023) for the long-term planning of EV parking lots. An integrated power and gas systems of IPGS considering cascading effects for enhancing resilience is proposed by Wang Y. et al. (2023), and the two-phase framework containing phases of “demand reachability evaluation” and “integrated planning” is proposed. A framework for the optimal planning of battery swapping stations (BSSs) in centralized charging mode is proposed by Shaker et al. (2023), and in this mode, the batteries are charged at a central charging station. Possible equipment measures are classified into several categories by Sasaki et al. (2023), formulating the “low-voltage system configuration determination problem;” in addition, a solution algorithm based on the practical priorities of classified measures is proposed. The resilience-oriented distribution network planning problem utilizing a novel three-stage hybrid framework is proposed by Faramarzi et al. (2023), and the decision-making on the line hardening and DG placement is carried out in the first stage. In the second stage, emergency and normal operation optimization is conducted. A collaborative stochastic expansion planning model of a cyber–physical system with resilience constraints is proposed by Zhang et al. (2023), and the model can reduce the coupling risk and enhance the resilience under extreme scenarios. An appropriate probabilistic wind power capacity expansion planning method for a bundled wind–thermal generation system with retrofitted coal-fired units is reformulated as a mixed-integer second-order cone programming problem by Lei et al. (2023). In terms of cluster planning, the existing research mainly considers deterministic scenarios as the research background (Bi et al., 2019), ignoring the impact of source-load uncertainty (Cai et al., 2022). Aiming at solving the problems of resource waste caused by the large-scale access of distributed generators to distribution networks and improving the economy of energy storage systems, a cluster energy-storage control strategy for prompting the distributed generation accommodation and improving the economy of energy storage systems is proposed by Li et al. (2021). In considering the optimization of load distribution among units and introducing consumption costs, a grid evaluation index system including the coordination index of the power transmission and distribution network is constructed by Xu X. et al. (2021). A novel cluster-based distributed generation planning approach is proposed by Ding et al. (2019), and the distribution network is divided into several partitions considering the system network structure and the load characteristics, thus conducting a hierarchical and partitioned network structure. A planning model of renewable energy access is established by Hu et al. (2020) based on cluster partition considering the investments and power generation interests of power producers and the power match degree within clusters. With the increasing proportion of distributed PVs, the source-load uncertainty increases the difficulty in modeling the uncertainty of DNs (Liu et al., 2022) and increases the dimensionality of variables in the planning model (Jiang et al., 2022). How to establish a cluster planning model based on the source-load uncertainty (Zhu et al., 2018) and simplify the traditional centralized planning model need to be further researched.

The remainder of this paper is organized as follows: a comprehensive cluster partition index-based cluster partition method is proposed in Section 2; a cluster partition-based two-layer expansion planning method is proposed in Section 3; in Section 4, the case study is analyzed; and the conclusion is given in Section 5.

2 Comprehensive cluster partition index-based cluster partition method

2.1 Comprehensive cluster partition index

As the existing cluster partition index is not comprehensive, based on the DN structure and cluster function, a comprehensive cluster partition index is proposed to complete the cluster partition in this paper. The proposed comprehensive cluster partition index includes the modularity index, power balance index, and nodal size index.

2.1.1 Modularity index

The coupling degree between nodes can be measured by a modularity index based on voltage sensitivity, which is expressed as

where ρ_m is the modularity index. is the edge weight between node i and node j. S is the node set of DNs. is the sum of the edge weight of all networks. is the sum of the edge weights that are connected to node i. is the judgment function of the cluster; when node i and node j are in the same cluster, then = 1; otherwise, = 0. is determined by the electrical distance, and the electrical distance can indicate the electrical coupling degree between two nodes in the network. For a DN with N nodes, the electrical distance based on the reactive voltage sensitivity matrix is expressed as

where is the element in row i and column j of the reactive voltage sensitivity matrix, which represents the sensitivity of reactive power generation at node i to the voltage at node j. is the electrical distance between the two nodes based on the reactive voltage sensitivity matrix; the larger the value of , the smaller the electrical distance between the two nodes. Similarly, the electrical distance based on the active voltage sensitivity matrix can be obtained. The node voltages are affected by active and reactive power variations, and then, the electrical distance based on the sensitivity matrix is expressed as follows:

The relationship between the edge weight and electrical distance is that the larger the edge weight, the smaller the electrical distance. Then, the mathematical expression between the edge weight and electrical distance can be obtained as follows:

where max(L_ij) is the maximum value of the elements in the electrical distance matrix.

2.1.2 Power balance index

In order to avoid large-scale power transfer between clusters, the PV output and load demand within a cluster should be as equal as possible. In order to evaluate the ability of clusters to hold the distributed PVs, this paper proposes the power balance index. The active power balance index φ^P is given as follows:where N_k is the number of clusters. is the net power of cluster k at time t. T is the period of optimization. Similarly, the reactive power balance index φ^Q is established as follows:

where Q^sup is the maximum value of reactive power supply within the cluster and Q^need is the value of reactive power demand within the cluster.

2.1.3 Nodal size index

A reasonable cluster size will directly impact the complexity of the subsequent cluster planning, as well as avoid the differences in the complexity of optimization among different clusters caused by unbalanced cluster size. In addition, a reasonable cluster size can avoid the isolated nodes in the planning process. In order to balance the size of each cluster, a nodal size index is established as follows:where is the cluster that node i belongs to. is the affiliation degree of node x to cluster y. is the sum of the edge number in the cluster that node i belongs to. are the clusters that do not contain node i. is the sum of the edge number in clusters that do not contain cluster .

The indexes shown in Eq 1, (7), (8), and (9) are combined into a comprehensive cluster partition index for the DNs, which is expressed as follows:where ω¹, ω², ω³, and ω⁴ are the weights of each index. In the process of cluster partition, different weights can be set for each index depending on different needs.

2.2 Improved genetic algorithm-based cluster partition method

To carry out the cluster partition, a hybrid genetic-simulated annealing (HGSA) algorithm is utilized. The HGSA algorithm uses the annealing selection as the individual replacement strategy, while the global information obtained by the genetic algorithm can be completely used, and the premature convergence of the genetic algorithm can be avoided. Then, the global convergence of the algorithm is enhanced. The cluster partition is implemented as follows:

Step 1: Initial optimization parameters are set: population size n, initial temperature T⁰, termination temperature T^end, temperature cooling factor r, maximum number of genetic generations M, and objective function for the cluster partitioning index .

Step 2: The number of temperature updates is set equal to 0. Considering that the cluster partition is carried out based on the original network connectivity, this paper uses the unweighted adjacency matrix to represent the connectivity of the network, where indicates that nodes i and j are connected and indicates that nodes i and j are not connected. The clustering partition is randomly modified when = 1. The result of the modification is 0 or 1, and 0 means that the two nodes are disconnected from each other, and then, the two nodes belong to different clusters. In the iteration of the algorithm, in order to ensure that the result after crossover still satisfies the meaning of the adjacency matrix, only the upper triangle of the adjacency matrix is chosen to carry out the crossover. After the crossover step, the upper triangle of the matrix is symmetrically transferred to the lower triangle to form the newborn individuals, thus generating the initial population P_l(k).

Step 3: The individuals that satisfy the cluster constraints are screened. Considering that the reverse power flow only occurs within the cluster, the net power within each cluster needs to be greater than 0 at each moment among the cluster partition. For the individuals who cannot satisfy the constraint, the population eliminates these individuals.

Step 4: Eq. (12) is chosen as an indicator to calculate the fitness of individuals. Considering that the value of fitness intuitively reflects the superiority or inferiority of cluster partition, the individuals with greater fitness are replicated to the offspring to form the new population .

Step 5: The crossover and mutation are carried out for using the traditional genetic algorithm to obtain the population . The mutated populations are limited to accepting bad solutions by the simulated annealing algorithm to form new populations .

Step 6: is set. If the genetic algebra accumulates to the maximum number M, then step 7 is repeated; otherwise, step 3 is repeated.

Step 7: The temperature is updated, i.e., T_l=rT⁰, k = 0, . If the convergence condition T_l< T_end, then the computation to output the optimal solution is terminated. Otherwise, the temperature reduction operation is performed, i.e., T_l+1= rT_l, and step 3 is repeated.

3 Cluster partition-based two-layer expansion planning method

In this paper, a cluster partition-based two-layer expansion planning model is proposed, which involves the uncertainty of PVs and loads. In the upper layer, a line planning model is established with the objective of minimizing the line investment and network loss costs. In the lower layer, a source-storage planning model is proposed for PVs and ESs with the objective function of minimizing source-storage investment and operation costs within a cluster. Meanwhile, the box-type uncertainty set is utilized to characterize the uncertainty of PVs and loads in the lower layer, and an uncertainty parameter is used to control the range of uncertainty sets, which can reduce the conservatism of the optimization.

3.1 Upper-layer line planning model

Many isolated nodes exist in the DN that need to be connected to the system, and the penetration rate of PVs should be constrained when carrying out line planning to access these isolated nodes, which is defined as follows:

where is the planed capacity of the PV of node j in the cluster and is the load apparent power of node j in the cluster.

3.2 Lower-layer PV and ES planning model

In the lower layer, the PV and ES planning model is established to identify the “worst scenario " of the uncertain variables, and based on the worst scenario, the proposed model minimizes the investment and operation costs of source storage within the cluster. Therefore, the objective function for the PV and ES planning model within the cluster is established as

Eqs (14), (15), and (17) are referred to for the power flow constraints.

3.3 Iterative solving process

In this paper, an iterative solution method is utilized to solve the proposed planning models. For the upper layer, the planning model can be expressed by a specific form as follows:

where x is the optimization vectors. c is the coefficient matrices corresponding to the objective functions. P, k, B, C, R_x, S* u, G, and H are the coefficient matrices corresponding to the variables under the constraints. α, D, O, V, and W are the constant column vectors. l is the current number of iterations. k is the maximum iteration. y_l is the variable at the lth iteration. u* l is the value of the uncertain variable u in the “worst” scenario after the lth iteration.

The specific form of the lower-layer model is

where y is the optimization vectors. is the feasible domain of y under the given x and u. x^* is the optimization vectors obtained from the upper layer. d is the coefficient matrices corresponding to the objective functions. S_u and R* u are the coefficient matrices corresponding to the variables under the constraints. Given a set of u, the inner min. problem becomes a second-order cone programming problem, which can be transformed into a “max” form by the duality theory:where[γ,ν,π,μ,μ₁ ] are the dual variables in the lower-layer model.

After the above transformation, the proposed model can be solved by the iterative solution method as follows:

Step 1: Given a set of u values as the initial worst-case scenario, a lower bound is set on the operating cost LB =, an upper bound UB = , and the number of iterations l = 1.

Step 2: The upper model is solved based on the worst-case scenario u_l to obtain the optimal solution x* l and α* l. The value of α* l is used as the new lower bound LB = max(LB, α* l).

Step 3: The lower layer is optimized based on the optimization results of the upper layer, and the optimized results f_l (x* l) and the worst-case scenario x* l are obtained. The upper bound is updated as UB = min(UB, f_l (x* l)).

Step 4: If UB-LB < ε, where ε is a threshold of convergence, then, the optimal solutions can be obtained, and the iteration is stopped. Otherwise, the variable y^l+1 and the following constraints are added:

Let l = l + 1, and step 2 is repeated until the algorithm converges.

4 Case study

4.1 Case study system

In order to verify the effectiveness of the proposed method, an actual 35 kV/10 kV DN in China is utilized for analysis. The total loads in this DN are 7.3 MVA, and the total capacity of PVs in this DN is 4 MW. The installed PV capacity is shown in Table 1. The topology of this system is shown in Figure 1, the lines to be planned are shown in Table 2, and the line parameters of the network are shown in Table 3.

FIGURE 1

The simulated genetic annealing algorithm used in this paper sets the population size n = 40, the initial temperature T₀ = 100°C, the termination temperature T_end = 1°C, the temperature cooling factor r = 0.8, the maximum number of genetic generations N = 500, the crossover probability p_c = 0.4, and the variation probability p_m = 0.2. This paper uses MATLAB version 2019 to program the algorithm.

4.2 Analysis of cluster partition

In order to illustrate the superiority of the proposed cluster partition index in this paper, the modularity function used by Wang et al. (2021) is selected to compare with the proposed cluster partition index. The weights of the proposed cluster partition index in this paper are taken as ω¹ = ω² = ω³ = ω⁴ = 0.25. The cluster partition results under the proposed cluster partition index are shown in Figure 2, and the cluster partitioning results under the modularity function are shown in Figure 3.

FIGURE 2

FIGURE 3

Figure 2 and Figure 3 show that the size difference among sub-networks attained by the proposed cluster partition index is smaller than that attained by the modularity function, and isolated nodes forming separate clusters (cluster 3 and cluster 6) occur in modularity function. In addition, there are PVs in each cluster attained by the proposed method, while no PVs exist in cluster 1 attained by the modularity function. The differences between the two methods prove that the cluster partition index can result in a more reasonable cluster partition for the subsequent cluster control and operation.

In order to illustrate the superiority of the proposed cluster partitioning algorithm, the traditional genetic algorithm is selected to be compared. The comparison of cluster partition results obtained by the two algorithms is shown in Table 4. Table 4 shows that the optimization results of each cluster partitioning index of the proposed algorithm are greater than those of the traditional genetic algorithm, which indicates that the proposed cluster partitioning algorithm has better optimization performance.

Different combinations of partition index weights are given in Table 5. As shown in Table 5, when increasing the weight of the modularity index, the nodes within the cluster are better connected, but the cluster power complementarity decreases. When increasing the weight of the active and reactive power balance index, the cluster power complementarity characteristics improve, but the nodes within the cluster are significantly less connected. When increasing the weight of the nodal size index, the number of clusters changes. When increasing the weight of the nodal size index, the number of clusters changes, and the cluster partition is more focused on the change in cluster size.

4.3 Analysis of the proposed planning strategy

In order to verify the flexibility of the proposed two-layer expansion planning model, three sets of uncertain regulation parameters are selected and compared in terms of network connection, planned capacity of PVs and ESs, and total planning costs. Three sets of uncertain regulation parameters are set as follows:

FIGURE 4

FIGURE 5

FIGURE 6

FIGURE 7

5 Conclusion

References

• 1

  BiR.LiuX.DingM.et al (2019). A method of renewable energy power generation cluster classification with the goal of improving the consumption capacity. Chin. J. Electr. Eng.39 (22), 6583–6592. 10.13334/j.0258-8013.pcsee.182512

  • CrossRef
  • Google Scholar
  • View reference in article

• 2

  CaiZ.ShuangH.ShanJ. (2022). Optimal scheduling strategy for electric bus cluster power exchange considering operation cost. Power Syst. Autom.46 (17), 205–217. 10.7500/AEPS20210916007

  • CrossRef
  • Google Scholar
  • View reference in article

• 3

  DingM.FangH.BiR.et al (2019). Distributed photovoltaic and energy storage siting and capacity planning for distribution networks based on cluster delineation. Chin. J. Electr. Eng.39 (8), 2187–2201. 10.13334/j.0258-8013.pcsee.180757

  • CrossRef
  • Google Scholar
  • View reference in article

• 4

  FaramarziD.RastegarH.RiahyG. H.Doagou-MojarradH. (2023). A three-stage hybrid stochastic/IGDT framework for resilience-oriented distribution network planning. Int. J. Electr. Power Energy Syst.146 (5), 108738–108738.15. 10.1016/j.ijepes.2022.108738

  • CrossRef
  • Google Scholar
  • View reference in article

• 5

  GeJ.LiyY.PangD.et al (2024). Cluster division voltage control strategy of photovoltaic distribution network with high permeability. High. Volt. Eng.50 (1), 74–82. 10.13336/j.1003-6520.hve.20230816

  • CrossRef
  • Google Scholar
  • View reference in article

• 6

  Haji-AghajaniE.HasanzadehS.Heydarian-ForushaniE. (2023). A novel framework for planning of EV parking lots in distribution networks with high PV penetration. Electr. Power Syst. Res.217 (4), 109156–109156.12. 10.1016/j.epsr.2023.109156

  • CrossRef
  • Google Scholar
  • View reference in article

• 7

  HuD.DingM.BiR.et al (2020). Analysis of the impact of photovoltaic and wind power complementarity on the planning of high penetration renewable energy cluster access. Chin. J. Electr. Eng.40 (3), 821–836. 10.13334/j.0258-8013.pcsee.182308

  • CrossRef
  • Google Scholar
  • View reference in article

• 8

  HuD.SunL.DingM. (2023). Integrated planning of an active distribution network and DG integration in clusters considering a novel formulation for reliability assessment. CSEE J. Power Energy Syst.9 (2), 561–576. 10.17775/CSEEJPES.2020.00150

  • CrossRef
  • Google Scholar
  • View reference in article

• 9

  JiY.ChenX.HeP.LiuX.WuX.ZhaoC. (2023). A novel voltage/var sensitivity calculation method to partition the distribution network containing renewable energy. Recent Adv. Electr. Electron. Eng.16 (4), 380–394. 10.2174/2352096516666221130150549

  • CrossRef
  • Google Scholar
  • View reference in article

• 10

  JiangY.RenZ.LiQ.et al (2022). New energy consumption strategy in distribution networks considering coordinated scheduling of multi-flexibility resources. J. Electr. Eng. Technol.37 (7), 1820–1835. 10.19595/j.cnki.1000-6753.tces.211464

  • CrossRef
  • Google Scholar
  • View reference in article

• 11

  KongX.LiuC.ChenS.et al (2022). A multi-time-node response potential assessment method for adjustable resource clusters considering dynamic processes. Power Syst. Autom.46 (18), 55–64. 10.7500/AEPS20220501001

  • CrossRef
  • Google Scholar
  • View reference in article

• 12

  KoutsoukisN.GeorgilakisP.HatziargyriouN. (2018). Multistage coordinated planning of active distribution networks. IEEE Trans. Power Syst.33 (1), 32–44. 10.1109/tpwrs.2017.2699696

  • CrossRef
  • Google Scholar
  • View reference in article

• 13

  LeiC.WangQ.ZhouG.BuS.LinT.et al (2023). Probabilistic wind power expansion planning of bundled wind-thermal generation system with retrofitted coal-fired plants using load transfer optimization. Int. J. Electr. Power Energy Syst.151 (9), 109145–109145.18. 10.1016/j.ijepes.2023.109145

  • CrossRef
  • Google Scholar
  • View reference in article

• 14

  LiC.DongZ.LiJ.et al (2021). Optimal control strategy for distributed energy storage clusters to enhance new energy consumption capacity of distribution networks. Power Syst. Autom.45 (23), 76–83. 10.7500/AEPS20210224004

  • CrossRef
  • Google Scholar
  • View reference in article

• 15

  LiP.ShenJ.WuZ.YinM.DongY.HanJ. (2023). Optimal real-time Voltage/Var control for distribution network: droop-control based multi-agent deep reinforcement learning. Int. J. Electr. Power Energy Syst.153 (11), 109370–109370.11. 10.1016/j.ijepes.2023.109370

  • CrossRef
  • Google Scholar
  • View reference in article

• 16

  LiS.YangX. (2022). Siting and capacity determination of photovoltaic energy storage based on bi-directional dynamic reconfiguration and cluster delineation. Power Syst. Prot. Control50 (3), 51–58. 10.19783/j.cnki.pspc.210385

  • CrossRef
  • Google Scholar
  • View reference in article

• 17

  LiY.LuN.LiuX.et al (2022c). Output evaluation method of distributed photovoltaic cluster considering renewable energy accommodation and power loss of network. Electr. Power Constr.43 (10), 136–146. 10.12204/j.issn.1000-7229.2022.10.013

  • CrossRef
  • Google Scholar
  • View reference in article

• 18

  LiY.YaoT.QiaoX.et al (2022b). Optimal allocation of distributed PV and energy storage based on joint timing scenarios and source-grid-load synergy. J. Electr. Eng. Technol.37 (13), 3289–3303. 10.19595/j.cnki.1000-6753.tces.210712

  • CrossRef
  • Google Scholar
  • View reference in article

• 19

  LiZ.WangW.HanS.et al (2022a). Study on voltage adaptation of distributed photovoltaic access to distribution network considering reactive power support. Power Syst. Prot. Control50 (11), 32–41. 10.19783/j.cnki.pspc.211781

  • CrossRef
  • Google Scholar
  • View reference in article

• 20

  LiuR.ShengW.MaX.et al (2021). Research on the planning of distributed photovoltaic access to distribution networks based on multiple swarm genetic algorithms. J. Sol. Energy42 (6), 146–155. 10.19912/j.0254-0096.tynxb.2019-0370

  • CrossRef
  • Google Scholar
  • View reference in article

• 21

  LiuZ.ZhangT.WangY. (2022). Model-based predictive control for multi-scenario variable time-scale optimal scheduling of active distribution network. Power Autom. Equip.42 (4), 121–128. 10.16081/j.epae.202201001

  • CrossRef
  • Google Scholar
  • View reference in article

• 22

  MukherjeeB.SossanF. (2023). Optimal Planning of single-port and multi-port charging stations for electric vehicles in medium voltage distribution networks. IEEE Trans. Smart Grid14 (2), 1135–1147. 10.1109/tsg.2022.3204150

  • CrossRef
  • Google Scholar
  • View reference in article

• 23

  PanM.LiuN.LeiJ. (2021). A dynamic classification method for distributed energy clusters containing cogeneration units. Power Syst. Autom.45 (1), 168–176. 10.7500/AEPS20200217013

  • CrossRef
  • Google Scholar
  • View reference in article

• 24

  SasakiY.FukubaS.YokotaH.YorinoN.FukubaS.et al (2023). Comprehensive solution method considering load distribution for determining low-voltage network configurations. IEEE Trans. Electr. Electron. Eng.18 (6), 1023–1032. 10.1002/tee.23808

  • CrossRef
  • Google Scholar
  • View reference in article

• 25

  ShakerM.FarzinH.MashhourE. (2023). Joint planning of electric vehicle battery swapping stations and distribution grid with centralized charging. J. Energy Storage58 (2), 106455–106455.11. 10.1016/j.est.2022.106455

  • CrossRef
  • Google Scholar
  • View reference in article

• 26

  ShenX.ShahidehpourM.ZhuS.HanY.ZhengJ. (2018). Multi-stage planning of active distribution networks considering the co-optimization of operation strategies. IEEE Trans. Smart Grid9 (2), 1425–1433. 10.1109/tsg.2016.2591586

  • CrossRef
  • Google Scholar
  • View reference in article

• 27

  SuS.LeiJ.YanY.PanS.YangY.et al (2023). Voltage regulation strategy of distribution network with decentralized wind power based on cluster partition. Recent Adv. Electr. Electron. Eng.16 (1), 30–44. 10.2174/2352096515666220902125455

  • CrossRef
  • Google Scholar
  • View reference in article

• 28

  WangL.ZhangF.KouL.et al (2021). Scaled distributed PV power cluster classification based on Fast Unfolding clustering algorithm. J. Sol. Energy42 (10), 29–34. 10.19912/j.0254-0096.tynxb.2018-0896

  • CrossRef
  • Google Scholar
  • View reference in article

• 29

  WangY.YangY.XuQ. (2023b). Integrated planning of natural gas and electricity distribution systems for enhancing resilience. Int. J. Electr. Power Energy Syst.151 (9), 109103–109103.11. 10.1016/j.ijepes.2023.109103

  • CrossRef
  • Google Scholar
  • View reference in article

• 30

  WangZ.TanW.LiH.GeJ.WangW. (2023a). A voltage coordination control strategy based on the reactive power-active network loss partitioned aggregation domain. Int. J. Electr. Power Energy Syst.144 (1), 108585–108585.10. 10.1016/j.ijepes.2022.108585

  • CrossRef
  • Google Scholar
  • View reference in article

• 31

  WuH.SunL.XiangS.et al (2022a). Active distribution network expansion planning with high-dimensional time-series correlation of renewable energy and load. Power Syst. Autom.46 (16), 40–51. 10.7500/AEPS20220104004

  • CrossRef
  • Google Scholar
  • View reference in article

• 32

  WuL.XinJ.WangC. (2022b). Installed capacity forecasting of distributed photovoltaic taking into account user herding psychology. Power Syst. Autom.46 (14), 83–92. 10.7500/AEPS20210902006

  • CrossRef
  • Google Scholar
  • View reference in article

• 33

  XiaoC.ZhaoB.ZhouJ.et al (2017). Voltage control of high proportional distributed PV clusters in distribution networks based on network partitioning. Power Syst. Autom.41 (21), 147–155. 10.7500/AEPS20170101002

  • CrossRef
  • Google Scholar
  • View reference in article

• 34

  XuL.YangJ.XiongZ. (2021a). A method of power distribution network classification based on improved grey cluster. Electr. Eng. (13), 81–84. 10.19768/j.cnki.dgjs.2021.13.021

  • CrossRef
  • Google Scholar
  • View reference in article

• 35

  XuX.ZhengX.WangS.et al (2021b). Coordinated planning method for transmission and distribution networks based on improved genetic annealing algorithm. Power Syst. Prot. Control49 (15), 1 24–131. 10.19783/j.cnki.pspc.201236

  • CrossRef
  • Google Scholar
  • View reference in article

• 36

  YangJ.HaoJ.BoZ. (2017). Hierarchical control strategy for reactive voltage of wind farm clusters based on adjacency empirical particle swarm algorithm. Power Grid Technol.41 (6), 1823–1829. 10.13335/j.1000-3673.pst.2016.2237

  • CrossRef
  • Google Scholar
  • View reference in article

• 37

  ZdraveskiV.VuleticJ.AngelovJ.TodorovskiM. (2023). Radial distribution network planning under uncertainty by implementing robust optimization. Int. J. Electr. Power Energy Syst.149 (7), 109043–109043.12. 10.1016/j.ijepes.2023.109043

  • CrossRef
  • Google Scholar
  • View reference in article

• 38

  ZhangT.XieM.WangP.et al (2021). System dynamics simulation of the shared value of distributed photovoltaic and its impact on the distribution network. Power Syst. Autom.45 (18), 35–44. 10.7500/AEPS20200901004

  • CrossRef
  • Google Scholar
  • View reference in article

• 39

  ZhangY.LiC.WanH.ShiQ.LiuW.XuY. (2023). Collaborative stochastic expansion planning of cyber-physical system considering extreme scenarios. IET Generation, Transm. Distribution17 (10), 2419–2434. 10.1049/gtd2.12819

  • CrossRef
  • Google Scholar
  • View reference in article

• 40

  ZhuJ.GuW.ZhangH.et al (2018). An optimization method for siting and capacity determination of distributed power supplies considering dynamic reconfiguration of networks. Power Syst. Autom.42 (5), 111–119. 10.7500/APES20170605016

  • CrossRef
  • Google Scholar
  • View reference in article