<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1355606</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2024.1355606</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A dynamic hierarchical partition method for optimal power balance of urban power system with high renewables</article-title>
<alt-title alt-title-type="left-running-head">Ye et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fenrg.2024.1355606">10.3389/fenrg.2024.1355606</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Ye</surname>
<given-names>Jun</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Xianfeng</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>He</surname>
<given-names>Yibing</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Lin</surname>
<given-names>Rouyu</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2603954/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Tian</surname>
<given-names>Wei</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Hangzhou Electric Power Design Institute</institution>, <addr-line>Hangzhou</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>College of Electrical Engineering</institution>, <institution>Zhejiang University</institution>, <addr-line>Hangzhou</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2337497/overview">Zhengmao Li</ext-link>, Aalto University, Finland</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2607381/overview">Xinyue Chang</ext-link>, Taiyuan University of Technology, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1624743/overview">Mingfei Ban</ext-link>, Northeast Forestry University, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Rouyu Lin, <email>22310065@zju.edu.cn</email>; Wei Tian, <email>wtian@zju.edu.cn</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>18</day>
<month>01</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>12</volume>
<elocation-id>1355606</elocation-id>
<history>
<date date-type="received">
<day>14</day>
<month>12</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>05</day>
<month>01</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2024 Ye, Li, He, Lin and Tian.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Ye, Li, He, Lin and Tian</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>With the development of new urban power systems, the centralized-distributed hierarchical partition management architecture has gradually become a consensus. Existing hierarchical partition methods are mostly static. And if the partition results are determined, it will remain unchanged for a relatively long time. However, the new type power system experiences more frequent and larger fluctuations in power generation and load, requiring dynamic responses to the system&#x2019;s real-time operation. In this case, traditional partition methods are no longer applicable, and new hierarchical partition methods for system operation need to be adopted. Therefore, this paper proposes a power balance mechanism of urban power system based on dynamic hierarchical partition method, including dynamic hierarchical partition method and corresponding decoupling power balance models. The former can continuously change the results of hierarchical partition according to the real-time state of the power system, so as to reduce the inter-regional liaison cost and improve the economy. The latter improves the independence of the region and the security of the power system through decoupling power balance. Eventually, the proposed method is validated with an modified Hawaii 37-node system.</p>
</abstract>
<kwd-group>
<kwd>hierarchical partition</kwd>
<kwd>power balance</kwd>
<kwd>urban power system</kwd>
<kwd>high renewables</kwd>
<kwd>hierarchical clustering</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Process and Energy Systems Engineering</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>With the development of renewable energy technologies, the generation cost of wind power and photovoltaic power continues to decrease while their generation efficiency continues to improve. The cleanliness and low-cost characteristic of new energy make their installed capacity in the power system continue to rise, and promote the development of power system into a new phase. However, at the same time, the volatility and uncertainty of new energy, as well as their different operational characteristics compared with traditional power sources, have made the operating environment of urban power systems more complex and the management more challenging, which poses risks to the reliability of the power system (<xref ref-type="bibr" rid="B16">Li et al., 2021</xref>; <xref ref-type="bibr" rid="B13">Li et al., 2022</xref>; <xref ref-type="bibr" rid="B26">Yang et al., 2023a</xref>; <xref ref-type="bibr" rid="B9">Hou et al., 2023</xref>). In this situation, traditional grid morphology and management architecture can no longer meet the operational requirements of new urban power systems (<xref ref-type="bibr" rid="B25">Xu et al., 2019</xref>; <xref ref-type="bibr" rid="B4">Chen et al., 2023</xref>).</p>
<p>As a result, scholars at home and abroad have made many attempts and gradually reached a consensus that the urban power systems will be managed in a hierarchical and partitioned manner in the future (<xref ref-type="bibr" rid="B12">Lai et al., 2014</xref>; <xref ref-type="bibr" rid="B8">Hao et al., 2020</xref>; <xref ref-type="bibr" rid="B1">Adeyanju and Canha, 2021</xref>; <xref ref-type="bibr" rid="B24">Wang et al., 2022</xref>). The hierarchical partition management architecture which combines the advantages of centralized management and distributed management (<xref ref-type="bibr" rid="B17">Li et al., 2023</xref>), aligns more with the requirement of safe and reliable operation of urban power systems (<xref ref-type="bibr" rid="B21">Pan et al., 2023</xref>; <xref ref-type="bibr" rid="B31">Zhao et al., 2023</xref>; <xref ref-type="bibr" rid="B28">Yang Y. et al., 2023b</xref>).</p>
<p>As for the hierarchical partition methods for urban power systems, heuristic methods and clustering methods have been extensively studied. Heuristic methods include simulated annealing (<xref ref-type="bibr" rid="B11">Irving and Sterling, 1990</xref>; <xref ref-type="bibr" rid="B6">Gil et al., 2006</xref>), genetic algorithms (<xref ref-type="bibr" rid="B20">Orero and Irving, 1996</xref>; <xref ref-type="bibr" rid="B10">Hu et al., 2005</xref>), tabu search (<xref ref-type="bibr" rid="B3">Chang et al., 1999</xref>; <xref ref-type="bibr" rid="B18">Liu et al., 2002</xref>), evolutionary computation (<xref ref-type="bibr" rid="B14">Li et al., 2009</xref>), etc. In reference (<xref ref-type="bibr" rid="B11">Irving and Sterling, 1990</xref>), the simulated annealing algorithm was used to determine the network partition, and the cost function was set to find the global optimal. But it took a lot of time to seek out the solution. So <xref ref-type="bibr" rid="B20">Orero and Irving (1996)</xref> used genetic algorithms to partition the system by balancing the number of lines and nodes between partitions. Obviously, the main issues with heuristic algorithms are slow optimization and difficult selection of control parameter, which necessitates a considerable number of prior experiments for parameter selection on specific problems.</p>
<p>Clustering methods have been widely used in hierarchical partitioning of power systems, including k-means clustering (<xref ref-type="bibr" rid="B2">Biserica et al., 2013</xref>; <xref ref-type="bibr" rid="B23">Wang et al., 2013</xref>; <xref ref-type="bibr" rid="B15">Li et al., 2014</xref>), hierarchical clustering (<xref ref-type="bibr" rid="B29">Zhang et al., 2021</xref>; <xref ref-type="bibr" rid="B7">Han et al., 2023</xref>), fuzzy clustering (<xref ref-type="bibr" rid="B27">Yang et al., 2006</xref>; <xref ref-type="bibr" rid="B5">Dai et al., 2011</xref>; <xref ref-type="bibr" rid="B19">Mezquita et al., 2011</xref>), etc. <xref ref-type="bibr" rid="B2">Biserica et al. (2013)</xref> applied k-means clustering for power grid partitioning, and used the minimum sum of squared electrical distances within each cluster as the objective function, ensuring that the injection or outflow power from any node in the same partition has an approximately effect on the area. Reference (<xref ref-type="bibr" rid="B5">Dai et al., 2011</xref>) employed both the spectral coefficient averaging and fuzzy C-means clustering for grid partitioning, and selected a weighted objective function by node controllability and representativeness indexes to determine the dominant nodes. The aforementioned k-means clustering and fuzzy clustering methods require given and sensitive values, while the hierarchical clustering method does not require the given cluster trees (Y. <xref ref-type="bibr" rid="B30">Zhang, 2018</xref>). <xref ref-type="bibr" rid="B31">Zhao et al. (2023)</xref> performed hierarchical partitioning of the grid based on hierarchical clustering and determined the partitioning results with the objective of minimizing the average value of the net load value and geographical proximity.</p>
<p>Once the above hierarchical partitioning methods are determined, the partitioning results will remain unchanged for a relatively long period of time (<xref ref-type="bibr" rid="B22">S&#xe1;nchez-Garc&#xed;a et al., 2014</xref>; <xref ref-type="bibr" rid="B31">Zhao et al., 2023</xref>). Therefore, most of these methods are merely applicable to power system planning in the new type power system with a large amount of wind and solar energy integration. When applied to power system operation, they may lead to a large number of problems such as wind and light abandonment, tidal overruns, etc., due to the inability to respond to system source load changes in a timely manner, and increase the liaison cost of power scheduling. However, with further advancement in renewable energy generation technologies, the future generation costs of new power systems will continue to decrease, while the proportion of system interconnection costs and accident maintenance costs in the overall operating costs of power systems will gradually increase. In this regard, the traditional static hierarchical partition methods are neither economical nor safe for the urban power system in the future.</p>
<p>Therefore, this paper proposes a hierarchical partitioned electric power balance mechanism for urban power systems applicable to system operation, including a dynamic hierarchical partition method and a partitioned decoupled electric power balance mechanism, which can improve the overall economy and security of future urban power system by exchanging small power generation cost for large reduction of interconnection cost. The main contributions of this paper are as follows:<list list-type="simple">
<list-item>
<p>1) Propose a partitioning result determination method that comprehensively considers the consumption of interconnection coordination resources and the independent operation capability within each partition, achieving dynamic hierarchical partitioning of the power grid;</p>
</list-item>
<list-item>
<p>2) Achieve the partitioned decoupling operation of the power balance model by decoupling the constraints;</p>
</list-item>
<list-item>
<p>3) Introduce a dynamic operation mechanism to ensure that the hierarchical partitioning as well as the power balance model meets the system operation requirements.</p>
</list-item>
</list>
</p>
<p>The rest of the paper is organized as follows. <xref ref-type="sec" rid="s2">Section 2</xref> describes the dynamic hierarchical partitioning method for urban power system. <xref ref-type="sec" rid="s3">Section 3</xref> presents partitioned decoupling power balance model. Power balance mechanism of urban power system based on dynamic hierarchical partition method is described in <xref ref-type="sec" rid="s4">Section 4</xref>. Case study of modified Hawaiian 37-node system is presented in <xref ref-type="sec" rid="s5">Section 5</xref>. <xref ref-type="sec" rid="s6">Section 6</xref> summarizes the observations through the case study and Section 7 concludes this paper.</p>
</sec>
<sec id="s2">
<title>2 A dynamic hierarchical partition method for urban power system</title>
<p>The hierarchical partition management architecture of future urban power system is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. The centralized layer coordinates and controls the distribution layer, implementing power dispatch among different zones in the distribution layer to improve the efficiency of interconnection resource allocation and the economy of the power grid operation. The different partition in distribution layer operates independently from each other, which, on one hand, facilitates the local consumption of renewable energy and enhances the flexibility of the power grid operation, and on the other hand, assist in reducing the regional net load density to ensure that the power shortage caused by partitioned islanding is minimized in the event of an accident, thus avoiding chain reactions and reducing the cost of accidents.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>The hierarchical partitioning management architecture of future urban power system.</p>
</caption>
<graphic xlink:href="fenrg-12-1355606-g001.tif"/>
</fig>
<sec id="s2-1">
<title>2.1 Hierarchical method</title>
<p>The centralized layer and distribution layer are the main entities that distinguish the control authority levels in urban power systems. The centralized layer consists of network nodes in the 110&#xa0;kV and above, which are connected to the transmission network and high-voltage distribution network. The distribution layer consists of network nodes in the 110&#xa0;kV and below, directly connected to the low-voltage distribution network and end-users.</p>
</sec>
<sec id="s2-2">
<title>2.2 Partition method</title>
<p>Distribution layer partitions are the fundamental units for the operation and control of urban power systems, and as shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, the division of partitions should be consistent with the physical reality. Therefore, based on the principle of geographic proximity, the hierarchical clustering method is used to cluster the grid nodes participating in the partition, and a clustering tree is obtained. Afterwards, the number of partitions is determined, i.e., the level of the clustering tree, and the final partition results are obtained.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Partition cluster process diagram.</p>
</caption>
<graphic xlink:href="fenrg-12-1355606-g002.tif"/>
</fig>
<p>The specific hierarchical clustering process is described as follows:<list list-type="simple">
<list-item>
<p>1) Step1: Input the two-dimensional geographical location data for each node in the power grid and normalize the data;</p>
</list-item>
<list-item>
<p>2) Step2: Consider each grid node as a class and then identify the two classes with the closest average distance to be merged;</p>
</list-item>
<list-item>
<p>3) Step3: Repeat the merging process until all grid nodes are merged into one class, and output the clustering results after each merge.</p>
</list-item>
</list>
</p>
<p>Through the aforementioned partition clustering process, the clustering tree shown in <xref ref-type="fig" rid="F3">Figure 3</xref> is obtained. The branches of the clustering tree represent the lower level, indicating that each node is a separate partition, while the trunk of the clustering tree represents the top level, indicating that all nodes are merged into one partition.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Clustering tree diagram.</p>
</caption>
<graphic xlink:href="fenrg-12-1355606-g003.tif"/>
</fig>
<p>In <xref ref-type="fig" rid="F3">Figure 3</xref>, the number of intersections between the dashed lines and the clustering tree represents the number of partitions, which is denoted as <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents the total number of nodes involved in the partitioning. By determining the position of the dashed lines, which corresponds to the number of partitions, the final system partitioning results can be obtained.</p>
<p>The determination of the number of partitions needs to consider the following issues:<list list-type="simple">
<list-item>
<p>1) Having no partition (number of partition is 1) or too few partitions, which is not conducive to the flexibly local consumption of renewable energy and independent operation of partitions.</p>
</list-item>
<list-item>
<p>2) Having excessive number of partitions, which leads to a significant increase in the number of inter-regional liaison lines, and excessive consumption of resources.</p>
</list-item>
</list>
</p>
<p>It can be seen that too many or too few partitions are not favorable to the flexible and economical operation of the power grid. Therefore, it is necessary to find a reasonable partition scheme that takes into account the independent operational capacity within each partition and the consumption of interconnection resources. To this end, the following objective function is proposed to determine the number of partitions, as shown below.<disp-formula id="e1">
<mml:math id="m4">
<mml:mrow>
<mml:mi mathvariant="italic">min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
<disp-formula id="e2">
<mml:math id="m5">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
<disp-formula id="e3">
<mml:math id="m6">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mstyle>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:msubsup>
</mml:mstyle>
<mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mtext>&#x2009;</mml:mtext>
</mml:mrow>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
<disp-formula id="e4">
<mml:math id="m7">
<mml:mrow>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
<disp-formula id="e5">
<mml:math id="m8">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mstyle>
<mml:msubsup>
<mml:mi>c</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf4">
<mml:math id="m9">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the square root of the sum of the squares of the total predicted net load values of nodes in each partition at time <inline-formula id="inf5">
<mml:math id="m10">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, when the number of partitions is <inline-formula id="inf6">
<mml:math id="m11">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf7">
<mml:math id="m12">
<mml:mrow>
<mml:msubsup>
<mml:mi>q</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the predicted net load value of the node <inline-formula id="inf8">
<mml:math id="m13">
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> in the partition <inline-formula id="inf9">
<mml:math id="m14">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf10">
<mml:math id="m15">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, when the number of partitions is <inline-formula id="inf11">
<mml:math id="m16">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf12">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the number of nodes in partition <inline-formula id="inf13">
<mml:math id="m18">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf14">
<mml:math id="m19">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the value of <inline-formula id="inf15">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> after being normalized by the <inline-formula id="inf16">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> norm; <inline-formula id="inf17">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the total number of interconnection lines in each partition at time <inline-formula id="inf18">
<mml:math id="m23">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> when the number of partitions is <inline-formula id="inf19">
<mml:math id="m24">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; after normalizing it with the <inline-formula id="inf20">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> norm, we obtain <inline-formula id="inf21">
<mml:math id="m26">
<mml:mrow>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf22">
<mml:math id="m27">
<mml:mrow>
<mml:msubsup>
<mml:mi>c</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the number of interconnection lines in the partition <inline-formula id="inf23">
<mml:math id="m28">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf24">
<mml:math id="m29">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> when the number of partitions is <inline-formula id="inf25">
<mml:math id="m30">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf26">
<mml:math id="m31">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the weighting coefficient.</p>
<p>The partition number <inline-formula id="inf27">
<mml:math id="m32">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> obtained through (1) has the following implications. When the number of partitions decreases from <inline-formula id="inf28">
<mml:math id="m33">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> to <inline-formula id="inf29">
<mml:math id="m34">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, the weighted value of the reduction in interconnection line quantity and the sum of the square of the total net load in each partition is maximized due to partition merging. The interconnection line quantity and the square of the total net load can respectively estimate the consumption of interconnection resources and the independent operational capability of that partition. The closer the regional net load sum of squares is to zero, the smaller the inward or outward transfer of electricity from the partition, indicating a stronger capability of independent operation. Therefore, when the partition number changes from <inline-formula id="inf30">
<mml:math id="m35">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> to <inline-formula id="inf31">
<mml:math id="m36">
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, the rate of reduction in resource consumption of interconnection lines and the rate of improvement in comprehensive independent operation capability of each partition are maximized, indicating that the partition merging process has the greatest overall impact on the power balance.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Partiton decoupling power balance model</title>
<p>In the hierarchical partition control framework of centralized-distributed form, when the urban power system operates in practice, the distribution layer operates independently in each partition, thus the power balance is ensured by power transmission among network nodes within each partition. If the power balance of the partition cannot be achieved, the centralized layer will coordinate and control interconnection resources to ensure power supply in case of power shortage. In order to realize the hierarchical partition operation process aforementioned, it is necessary to perform calculations of the power balance on a regional basis, which is specifically manifested in the partition weighting of the objective function and the partition decoupling of the constraint conditions.</p>
<sec id="s3-1">
<title>3.1 Objective function</title>
<p>Taking into account the economy of system operation and the independent operation capability of each partition, the optimization objective of the power balance model is to minimize the weighted sum of the total generation cost of units and the power imbalance of each partition. Specifically, it can be expressed as (6) below.<disp-formula id="e6">
<mml:math id="m37">
<mml:mrow>
<mml:mi mathvariant="italic">min</mml:mi>
<mml:mstyle displaystyle="true">
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mstyle>
<mml:mstyle displaystyle="true">
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>u</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:msub>
</mml:mstyle>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mstyle>
<mml:msup>
<mml:mi>&#x3b7;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf32">
<mml:math id="m38">
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the set of partitions obtained by hierarchical partition of the power system; <inline-formula id="inf33">
<mml:math id="m39">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is a specific partition in the set of partitions; <inline-formula id="inf34">
<mml:math id="m40">
<mml:mrow>
<mml:msup>
<mml:mi>u</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is the set of units in region <inline-formula id="inf35">
<mml:math id="m41">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf36">
<mml:math id="m42">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is a specific unit in the set of units; <inline-formula id="inf37">
<mml:math id="m43">
<mml:mrow>
<mml:msubsup>
<mml:mi>f</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the cost function of unit <inline-formula id="inf38">
<mml:math id="m44">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, which is generally a quadratic function; <inline-formula id="inf39">
<mml:math id="m45">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the output of unit <inline-formula id="inf40">
<mml:math id="m46">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf41">
<mml:math id="m47">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf42">
<mml:math id="m48">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the power imbalance of partition <inline-formula id="inf43">
<mml:math id="m49">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf44">
<mml:math id="m50">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf45">
<mml:math id="m51">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3b7;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is the penalty term for power imbalance in partition <inline-formula id="inf46">
<mml:math id="m52">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2">
<title>3.2 Constraint condition</title>
<p>In the hierarchical partition management framework, each partition operates independently, so the system constraints are decomposed into regional constraints. For any partition in the set of partitions, the following regional constraints and operational constraints must be satisfied.</p>
<sec id="s3-2-1">
<title>3.2.1 Power balance constraint</title>
<p>
<disp-formula id="e7">
<mml:math id="m53">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">B</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msup>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">&#x3b8;</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">R</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:msubsup>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf47">
<mml:math id="m54">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">B</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf48">
<mml:math id="m55">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">&#x3b8;</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf49">
<mml:math id="m56">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">R</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf50">
<mml:math id="m57">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the nodal admittance matrix, nodal phase angle matrix, adjacency matrix, and interconnection line flow matrix of partition <inline-formula id="inf51">
<mml:math id="m58">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf52">
<mml:math id="m59">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf53">
<mml:math id="m60">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf54">
<mml:math id="m61">
<mml:mrow>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf55">
<mml:math id="m62">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf56">
<mml:math id="m63">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the sum of conventional unit output, load, actual wind power output, and actual photovoltaic power output in partition <inline-formula id="inf57">
<mml:math id="m64">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf58">
<mml:math id="m65">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, respectively.</p>
</sec>
<sec id="s3-2-2">
<title>3.2.2 Phase angle constraint of reference node</title>
<p>
<disp-formula id="e8">
<mml:math id="m66">
<mml:mrow>
<mml:msubsup>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>f</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>where <inline-formula id="inf59">
<mml:math id="m67">
<mml:mrow>
<mml:msubsup>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>f</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the reference node phase angle for partition <inline-formula id="inf60">
<mml:math id="m68">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. If there is no reference node in partition <inline-formula id="inf61">
<mml:math id="m69">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, this equation does not need to be considered.</p>
</sec>
<sec id="s3-2-3">
<title>3.2.3 Power flow constraints of line in the partition</title>
<p>
<disp-formula id="e9">
<mml:math id="m70">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mfenced open="|" close="" separators="|">
<mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">B</mml:mi>
<mml:mi mathvariant="bold-italic">f</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
<mml:mi mathvariant="bold-italic">&#x3b8;</mml:mi>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="|" close="" separators="|">
<mml:mrow>
<mml:mo>&#x2264;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">F</mml:mi>
<mml:mi mathvariant="bold-italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="bold-italic">a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="bold-italic">max</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf62">
<mml:math id="m71">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">B</mml:mi>
<mml:mi mathvariant="bold-italic">f</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the power flow transfer matrix of partition <inline-formula id="inf63">
<mml:math id="m72">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, which is the product of the inverse of the branch reactance matrix and the transpose of the node-branch incidence matrix; <inline-formula id="inf64">
<mml:math id="m73">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="bold-italic">F</mml:mi>
<mml:mi mathvariant="bold-italic">L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="bold-italic">a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="bold-italic">max</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is the matrix of upper power flow limits of intra-partition lines in partition <inline-formula id="inf65">
<mml:math id="m74">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf66">
<mml:math id="m75">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the upper power flow limit of line <inline-formula id="inf67">
<mml:math id="m76">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf68">
<mml:math id="m77">
<mml:mrow>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf69">
<mml:math id="m78">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the set of lines within the partition <inline-formula id="inf70">
<mml:math id="m79">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2-4">
<title>3.2.4 Power flow constraints of interconnection line</title>
<p>
<disp-formula id="e10">
<mml:math id="m80">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi mathvariant="normal">&#x393;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>where <inline-formula id="inf71">
<mml:math id="m81">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the power flow of interconnection line <inline-formula id="inf72">
<mml:math id="m82">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> passing through partition <inline-formula id="inf73">
<mml:math id="m83">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf74">
<mml:math id="m84">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf75">
<mml:math id="m85">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the upper limit of the power flow on interconnection line <inline-formula id="inf76">
<mml:math id="m86">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> within partition <inline-formula id="inf77">
<mml:math id="m87">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf78">
<mml:math id="m88">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">&#x393;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the set of interconnection lines within partition <inline-formula id="inf79">
<mml:math id="m89">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf80">
<mml:math id="m90">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf81">
<mml:math id="m91">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the phase angles of node <inline-formula id="inf82">
<mml:math id="m92">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf83">
<mml:math id="m93">
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> on line <inline-formula id="inf84">
<mml:math id="m94">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time, respectively; <inline-formula id="inf85">
<mml:math id="m95">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the reactance value of line <inline-formula id="inf86">
<mml:math id="m96">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2-5">
<title>3.2.5 Regional power imbalance constraints</title>
<p>
<disp-formula id="e11">
<mml:math id="m97">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi mathvariant="normal">&#x393;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mstyle>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>where <inline-formula id="inf87">
<mml:math id="m98">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the power imbalance of partition <inline-formula id="inf88">
<mml:math id="m99">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf89">
<mml:math id="m100">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2-6">
<title>3.2.6 Unit operation constraints</title>
<p>
<disp-formula id="e12">
<mml:math id="m101">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>u</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e13">
<mml:math id="m102">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>R</mml:mi>
<mml:msubsup>
<mml:mi>U</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>u</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>
<disp-formula id="e14">
<mml:math id="m103">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>R</mml:mi>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>u</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
</p>
<p>Where (12) is the upper and lower limits constraints of unit output; (13)&#x2013;(14) are the unit ramping constraints. <inline-formula id="inf90">
<mml:math id="m104">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf91">
<mml:math id="m105">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the output of conventional unit <inline-formula id="inf92">
<mml:math id="m106">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf93">
<mml:math id="m107">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf94">
<mml:math id="m108">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf95">
<mml:math id="m109">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf96">
<mml:math id="m110">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the minimum and maximum values of the output of conventional unit <inline-formula id="inf97">
<mml:math id="m111">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. <inline-formula id="inf98">
<mml:math id="m112">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:msubsup>
<mml:mi>U</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf99">
<mml:math id="m113">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:msubsup>
<mml:mi>D</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the maximum upward and downward ramping rates of unit <inline-formula id="inf100">
<mml:math id="m114">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2-7">
<title>3.2.7 Operational constraints of wind and solar energy sources</title>
<p>
<disp-formula id="e15">
<mml:math id="m115">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
<disp-formula id="e16">
<mml:math id="m116">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>where <inline-formula id="inf101">
<mml:math id="m117">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf102">
<mml:math id="m118">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the actual output of wind power and solar power at time <inline-formula id="inf103">
<mml:math id="m119">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, respectively; <inline-formula id="inf104">
<mml:math id="m120">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf105">
<mml:math id="m121">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the theoretical output of renewable unit at time <inline-formula id="inf106">
<mml:math id="m122">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf107">
<mml:math id="m123">
<mml:mrow>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf108">
<mml:math id="m124">
<mml:mrow>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the collection of wind power units and solar power units in region <inline-formula id="inf109">
<mml:math id="m125">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2-8">
<title>3.2.8 Operational constraints of energy storage</title>
<p>
<disp-formula id="e17">
<mml:math id="m126">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>E</mml:mi>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>
<disp-formula id="e18">
<mml:math id="m127">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msubsup>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mi>E</mml:mi>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(18)</label>
</disp-formula>
<disp-formula id="e19">
<mml:math id="m128">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(19)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf110">
<mml:math id="m129">
<mml:mrow>
<mml:msubsup>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the output power of energy storage <inline-formula id="inf111">
<mml:math id="m130">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf112">
<mml:math id="m131">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, with positive values indicating discharge and negative values indicating charge; <inline-formula id="inf113">
<mml:math id="m132">
<mml:mrow>
<mml:msubsup>
<mml:mi>E</mml:mi>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the maximum output power of energy storage <inline-formula id="inf114">
<mml:math id="m133">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>; <inline-formula id="inf115">
<mml:math id="m134">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf116">
<mml:math id="m135">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the state of charge of the energy storage <inline-formula id="inf117">
<mml:math id="m136">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> at time <inline-formula id="inf118">
<mml:math id="m137">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf119">
<mml:math id="m138">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, respectively; <inline-formula id="inf120">
<mml:math id="m139">
<mml:mrow>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> represents the collection of energy storages in partition <inline-formula id="inf121">
<mml:math id="m140">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<title>4 Power balance mechanism of urban power system based on dynamic hierarchical paetition method</title>
<p>The power balance mechanism of urban power system based on dynamic hierarchical partition method determines the partitioning results first for each operating moment, and then performs power balancing calculations. The determination of partitioning results is based on both clustering tree and the net load forecast value at the current moment. For clustering tree, as the number of power grid nodes in the same area and their geographical locations remain constant in the long term, it can be considered fixed during the operating phase. Therefore, the partitioning clustering process only needs to be performed once at the beginning of the operation, and the clustering tree remains unchanged during subsequent hierarchical partitioning, eliminating the need for repeated calculations.</p>
<p>As for the current net load forecast value, it is obtained by predicting the historical net load data with a fixed timing length. In this study, the least squares support vector machine based on wavelet packet decomposition is used for net load forecasting. Due to the volatility and uncertainty of renewable energy and power load, the net load of power grid nodes changes in real-time, and the magnitude of the changes can be significant. In order to better meet the real-time absorption demand of renewable energy, improve the real-time independent operation capability of the power grid, and reduce the consumption of interconnection resources, it is necessary to adjust the partitioning results accordingly to achieve an improvement in the optimality of power balance results.</p>
<p>The specific operational process of the dynamic hierarchical partitioning and the power balance mechanism is shown in <xref ref-type="fig" rid="F4">Figure 4</xref>. In the figure, <inline-formula id="inf122">
<mml:math id="m141">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>s</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the starting operating moment; <inline-formula id="inf123">
<mml:math id="m142">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the sliding window length, which denotes the length of historical net load data used for predicting the net load data of each node; <inline-formula id="inf124">
<mml:math id="m143">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the current operating moment, and <inline-formula id="inf125">
<mml:math id="m144">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the ending operating moment. The specific process is described as follows:<list list-type="simple">
<list-item>
<p>1) Input the geographical location data of the grid nodes and obtain the clustering tree through partition clustering;</p>
</list-item>
<list-item>
<p>2) Input the historical operating data of the time period <inline-formula id="inf126">
<mml:math id="m145">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> before the current running moment <inline-formula id="inf127">
<mml:math id="m146">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, which includes historical load data and historical generation data. Calculate the net load data of all nodes in the power system at each moment within the time period <inline-formula id="inf128">
<mml:math id="m147">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, and predict the net load value at the current moment based on historical net load data;</p>
</list-item>
<list-item>
<p>3) Based on the clustering tree and the predicted net load values of each node, obtain the hierarchical partitioning results of the power system at the current moment using <xref ref-type="disp-formula" rid="e1">(1</xref>&#x2013;<xref ref-type="disp-formula" rid="e5">5)</xref>;</p>
</list-item>
<list-item>
<p>4) Based on the hierarchical partitioning results of the power system at the current moment, calculate the power balancing results of the power system using <xref ref-type="disp-formula" rid="e6">(6</xref>&#x2013;<xref ref-type="disp-formula" rid="e19">19)</xref> and output them;</p>
</list-item>
<list-item>
<p>5) Determine if the current moment <inline-formula id="inf129">
<mml:math id="m148">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the ending operating moment <inline-formula id="inf130">
<mml:math id="m149">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>e</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. If yes, end the operation; if no, set <inline-formula id="inf131">
<mml:math id="m150">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> and go to Step 2, which is to enter the calculation of hierarchical partitioning and power balance for the next moment.</p>
</list-item>
</list>
</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Flowchart of the dynamic hierarchical partitioning and power balance mechanism.</p>
</caption>
<graphic xlink:href="fenrg-12-1355606-g004.tif"/>
</fig>
</sec>
<sec id="s5">
<title>5 Case study</title>
<p>As shown in <xref ref-type="fig" rid="F5">Figure 5</xref>, this section analyzes the dynamic hierarchical partitioned power balance mechanism based on the modified Hawaiian 37-node system, which consists of two voltage levels, 138 and 69&#xa0;kV, and the nodes in parentheses in the figure are all 138&#xa0;kV.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Modified Hawaiian 37-node system diagram.</p>
</caption>
<graphic xlink:href="fenrg-12-1355606-g005.tif"/>
</fig>
<p>The total duration of the data is 48&#xa0;h with a granularity of 1&#xa0;h, and the base capacity is <inline-formula id="inf132">
<mml:math id="m151">
<mml:mrow>
<mml:mn>100</mml:mn>
<mml:mi>M</mml:mi>
<mml:mi>V</mml:mi>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. The initial operating time is 25&#xa0;h, using data from 1 to 24&#xa0;h as historical data. And the final operating time is 48&#xa0;h, using data from 24 to 47&#xa0;h as historical data. The weighting coefficient <inline-formula id="inf133">
<mml:math id="m152">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is set to 0.4, and the penalty term <inline-formula id="inf134">
<mml:math id="m153">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3b7;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> for power imbalance in each partition is 1,000.</p>
<p>In order to analyze and validate the effectiveness of the dynamic operating mechanism proposed in this paper, the following three operating modes are established. The problem is modeled and solved by MATLAB.<list list-type="simple">
<list-item>
<p>1) Mode 1: no hierarchical partitioning, which can be considered as all nodes belonging to a single partition or each node being a separate partition;</p>
</list-item>
<list-item>
<p>2) Mode 2: static hierarchical partitioning, i.e., the partitioning result is fixed during operation, which can be used to simulate the hierarchical partitioning method proposed in existing studies for system planning;</p>
</list-item>
<list-item>
<p>3) Mode3: dynamic hierarchical partitioning, which refers to mechanism proposed in this paper.</p>
</list-item>
</list>
</p>
<sec id="s5-1">
<title>5.1 System operation results study</title>
<p>Based on the aforementioned system parameters and data, the system operating results under three different operating modes are analyzed. The total generation cost and the tie-line power of the 24-h system under different operating modes are shown in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>System operation results in different modes.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Operation modes</th>
<th align="center">Total generation cost/$</th>
<th align="center">Tie-line power/100&#xa0;MVA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Mode 1</td>
<td align="center">115,458.10</td>
<td align="center">272.48</td>
</tr>
<tr>
<td align="center">Mode 2</td>
<td align="center">115,850.07</td>
<td align="center">216.33</td>
</tr>
<tr>
<td align="center">Mode 3</td>
<td align="center">115,944.99</td>
<td align="center">213.71</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From the results in <xref ref-type="table" rid="T1">Table 1</xref>, it can be observed that the ynamic hierarchical partitioning reduces the total power transmission on tie lines (i.e., the sum of absolute values of power imbalances in each partition) by 21.57% and 1.21% compared with the non-partitioned and static hierarchical partitioning modes, respectively. Meanwhile, the generation cost increases by 0.422% and 0.082% respectively, indicating that the percentage reduction in total power transmission on tie lines is 51 times and 14 times higher than the percentage increase in generation cost. This demonstrates that through dynamic hierarchical partitioning, a large reduction in total power transmission on tie lines can be achieved at a relatively small increase in generation cost, which implies lower interconnection costs.</p>
</sec>
<sec id="s5-2">
<title>5.2 Partition operation results study</title>
<p>The total tie-line power under different operating modes in some periods are shown in <xref ref-type="table" rid="T2">Table 2</xref>. The clustering tree for the partitioning process is illustrated in <xref ref-type="fig" rid="F2">Figure 2</xref>. Based on the clustering tree and (1)&#x2013;(5), the final static and dynamic partitioning results are determined and depicted in <xref ref-type="fig" rid="F6">Figures 6</xref>, <xref ref-type="fig" rid="F7">7</xref>, respectively. The 138&#xa0;kV node is located in the central layer and does not participate in the partitioning process. The new energy units are connected to nodes 23, 26, 27, 28, and 33.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Total tie-line power under different operating modes in some periods.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Time/h</th>
<th align="center">Mode1</th>
<th colspan="2" align="center">Mode2</th>
<th colspan="2" align="center">Mode3</th>
</tr>
<tr>
<th align="center">Tie-line power/100&#xa0;MVA</th>
<th align="center">k</th>
<th align="center">Tie-line power/100&#xa0;MVA</th>
<th align="center">k</th>
<th align="center">Tie-line power/100&#xa0;MVA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">38</td>
<td align="center">9.9206</td>
<td rowspan="7" align="center">6</td>
<td align="center">7.7679</td>
<td align="center">6</td>
<td align="center">7.7679</td>
</tr>
<tr>
<td align="center">39</td>
<td align="center">9.6368</td>
<td align="center">8.1023</td>
<td align="center">6</td>
<td align="center">8.1023</td>
</tr>
<tr>
<td align="center">40</td>
<td align="center">11.0015</td>
<td align="center">10.7478</td>
<td align="center">4</td>
<td align="center">9.4274</td>
</tr>
<tr>
<td align="center">41</td>
<td align="center">13.3739</td>
<td align="center">9.0022</td>
<td align="center">4</td>
<td align="center">8.4586</td>
</tr>
<tr>
<td align="center">42</td>
<td align="center">14.4043</td>
<td align="center">12.0514</td>
<td align="center">6</td>
<td align="center">12.4107</td>
</tr>
<tr>
<td align="center">43</td>
<td align="center">14.8631</td>
<td align="center">11.6698</td>
<td align="center">6</td>
<td align="center">11.4045</td>
</tr>
<tr>
<td align="center">44</td>
<td align="center">15.0425</td>
<td align="center">10.0469</td>
<td align="center">6</td>
<td align="center">10.0175</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Static partition results.</p>
</caption>
<graphic xlink:href="fenrg-12-1355606-g006.tif"/>
</fig>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Dynamic partition results.</p>
</caption>
<graphic xlink:href="fenrg-12-1355606-g007.tif"/>
</fig>
<p>In <xref ref-type="table" rid="T2">Table 2</xref>, &#x201c;k&#x201d; represents &#x201c;power number&#x201d;. It can be observed from <xref ref-type="table" rid="T2">Table 2</xref> that after implementing hierarchical partitioning (including static and dynamic partitioning), the total power transmission on tie lines in the system is always lower than that without partitioning. And in most operating time periods, the total power transmission on tie lines under dynamic partitioning is lower than that under static partitioning. The net load values for each partition under different modes during the 40-h period are shown in <xref ref-type="table" rid="T3">Table 3</xref>.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Net load values for each partition under different modes during the 40-h period.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th colspan="3" align="center">Net load for partitions/100MVA</th>
</tr>
<tr>
<td align="center">Partition sequence number</td>
<td align="center">Mode 2</td>
<td align="center">Mode 3</td>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">1</td>
<td align="center">0.6057</td>
<td align="center">0.6257</td>
</tr>
<tr>
<td align="center">2</td>
<td align="center">&#x2212;0.0263</td>
<td align="center">&#x2212;0.0263</td>
</tr>
<tr>
<td align="center">3</td>
<td align="center">4.3480</td>
<td align="center">4.5668</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">0.0000022</td>
<td align="center">&#x2212;0.6328</td>
</tr>
<tr>
<td align="center">5</td>
<td align="center">0.4002</td>
<td align="center">0.4002</td>
</tr>
<tr>
<td align="center">A</td>
<td align="center">&#x2014;</td>
<td align="center">0.5994</td>
</tr>
<tr>
<td align="center">B</td>
<td align="center">&#x2014;</td>
<td align="center">3.9340</td>
</tr>
<tr>
<td align="center">C</td>
<td align="center">&#x2014;</td>
<td align="center">0.4002</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Comparing the net load values of different partitions under the two hierarchical partitioning methods in <xref ref-type="table" rid="T3">Table 3</xref>, it can be observed that the dynamic partitioning process follows the change of the system source-load operation state, and merges partition 1, partition 2, partition 3 and partition 4, which are geographically close to each other and have opposite signs of net load values. After the merger of partition 3 and partition 4, the partition decoupling power balance process fully utilizes the regulation capability of the units, reducing the output of units in the original partition 4, so that the 0.00022 <inline-formula id="inf135">
<mml:math id="m154">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>V</mml:mi>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> of new energy generation capacity, which was not consumed in the static partitioning of partition 4, is fully consumed after the dynamic partitioning, and reduces the total net load value of the merged partition B by 9.48% compared with the original partition 3.</p>
<p>It can be seen that the dynamic hierarchical partitioning and partition decoupling power balance processes complement each other, enabling the system to adapt to operational changes, improve the local accommodation capacity of new energy, and reduce regional power imbalance. In the event of an accident scenario, a smaller amount of regional power imbalance implies a smaller instantaneous power variation in the system, resulting in reduced losses, which is crucial for the safe operation of the system.</p>
</sec>
</sec>
<sec sec-type="conclusion" id="s6">
<title>6 Conclusion</title>
<p>This paper proposes a power balance mechanism of urban power system based on dynamic hierarchical partition method, which can be applied to the operation of future urban power systems. Compared with the existing static method, the dynamic hierarchical partition method proposed in this paper can change the partition result according to the real-time operation state of the power system, which aims to reduce the coordination cost at the cost of smaller generation cost, improve the local consumption capacity of new energy, and enhance the regional independent operation ability. In addition, a partition decoupling power balance model is proposed in this paper, which make the power balance process can be carried out in a hierarchical way and further improve the independent operation ability of the region.</p>
<p>In this study, the performance of dynamic partitioning results is closely related to the weight coefficient, and the weighting coefficients in the objective function for the determination of the number of partitions may vary for different systems, which needs to be determined in advance. How to choose the appropriate weight coefficient is a difficult point, and the adaptive selection of weight coefficient may be an effective way.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s7">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding authors.</p>
</sec>
<sec id="s8">
<title>Author contributions</title>
<p>JY: Conceptualization, Data curation, Investigation, Methodology, Project administration, Writing&#x2013;original draft. XL: Formal Analysis, Investigation, Software, Writing&#x2013;original draft. YH: Funding acquisition, Project administration, Resources, Visualization, Writing&#x2013;original draft. RL: Conceptualization, Methodology, Visualization, Writing&#x2013;original draft, Writing&#x2013;review and editing. WT: Data curation, Formal Analysis, Project administration, Software, Writing&#x2013;original draft, Writing&#x2013;review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This work was supported by the Hangzhou Electric Power Design Institute. Management technology project&#x2013;Research on macroeconomics and energy consumption forecasting technology based on energy big data (2022YF-113).</p>
</sec>
<sec sec-type="COI-statement" id="s10">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Adeyanju</surname>
<given-names>O. M.</given-names>
</name>
<name>
<surname>Canha</surname>
<given-names>L. N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Decentralized multi-area multi-agent economic dispatch model using select meta-heuristic optimization algorithms</article-title>. <source>Electr. Power Syst. Res.</source> <volume>195</volume>, <fpage>107128</fpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2021.107128</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Biserica</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Foggia</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Chanzy</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Passelergue</surname>
<given-names>J. C.</given-names>
</name>
</person-group> (<year>2013</year>). &#x201c;<article-title>Network partition for coordinated control in active distribution networks</article-title>,&#x201d; in <conf-name>Paper presented at the 2013 IEEE Grenoble Conference</conf-name>, <conf-loc>Grenoble, France</conf-loc>, <conf-date>June 2013</conf-date>, <fpage>16</fpage>&#x2013;<lpage>20</lpage>.</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wen</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>1999</year>). <article-title>Power system network partitioning using tabu search</article-title>. <source>Electr. Power Syst. Res.</source> <volume>49</volume> (<issue>1</issue>), <fpage>55</fpage>&#x2013;<lpage>61</lpage>. <pub-id pub-id-type="doi">10.1016/s0378-7796(98)00119-9</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Review of new power system balance calculation and Analysis techniques</article-title>. <source>Power Syst. Technol.</source>, <fpage>1</fpage>&#x2013;<lpage>20</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2023.1609</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dai</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xv</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Voltage partition and pilot nodes selecting of Henan power grid based on secondary voltage control</article-title>. <source>Power Syst. Prot. Control</source> <volume>39</volume> (<issue>24</issue>), <fpage>101</fpage>&#x2013;<lpage>105</lpage>. <pub-id pub-id-type="doi">10.3969/j.issn.1674-3415.2011.24.017</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gil</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ba&#xf1;os</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Montoya</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>G&#xf3;mez</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>Performance of simulated annealing, tabu search, and evolutionary algorithms for multi-objective network partitioning</article-title>. <source>Algorithmic Operations Res.</source> <volume>1</volume> (<issue>1</issue>), <fpage>55</fpage>&#x2013;<lpage>64</lpage>.</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Partiton strategy of power system containing new energy based on system clustering method</article-title>. <source>A Publ. Chin. Soc. Univ. Elcetric Power Syst. its Automation</source>, <fpage>1</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.19635/j.cnki.csu-epsa.001292</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hao</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Review of dispatch and control methods for tradition power system and highrate renewable energy generation power system</article-title>. <source>A Publ. Chin. Soc. Univ. Elcetric Power Syst. its Automation</source> <volume>32</volume> (<issue>09</issue>), <fpage>10</fpage>&#x2013;<lpage>19</lpage>. <pub-id pub-id-type="doi">10.19635/j.cnki.csu-epsa.000392</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hou</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Bai</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Su</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Process simulation on the planning of wind-PV-storage for near-zero carbon emission</article-title>. <source>Front. Energy Res.</source> <volume>11</volume>, <fpage>1217279</fpage>. <pub-id pub-id-type="doi">10.3389/fenrg.2023.1217279</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>A two-layered network partition approach for optimal reactive power dispatching</article-title>. <source>Power Syst. Technol.</source> (<issue>24</issue>), <fpage>37</fpage>&#x2013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.3321/j.issn:1000-3673.2005.24.008</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Irving</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Sterling</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>1990</year>). <article-title>Optimal network tearing using simulated annealing</article-title>. <source>IEE Proc. C (Generation, Transm. Distribution)</source> <volume>137</volume>, <fpage>69</fpage>. <pub-id pub-id-type="doi">10.1049/ip-c.1990.0010</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lai</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Kang</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Decentralized multi-area economic dispatch via dynamic multiplier-based Lagrangian relaxation</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>30</volume> (<issue>6</issue>), <fpage>3225</fpage>&#x2013;<lpage>3233</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrs.2014.2377755</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Ge</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lv</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Poer balance method of provincial power system with complex generation structure</article-title>. <source>High. Volt. Eng.</source>, <fpage>1</fpage>&#x2013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.13336/j.1003-6520.hve.20221942</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>D improveuan</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>A novel partition approach of control variables in cooperative coevolutionary computation for reactive power optimization</article-title>. <source>Proc. CSEE</source> <volume>29</volume> (<issue>16</issue>), <fpage>28</fpage>&#x2013;<lpage>34</lpage>. <pub-id pub-id-type="doi">10.3321/j.issn:0258-8013.2009.16.005</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Lou</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Fu</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Optimal partition of power distribution network service areas based on improved K-Means algorithm</article-title>,&#x201d; in <conf-name>Paper presented at the 2014 International Conference on Power System Technology</conf-name>, <conf-loc>Chengdu, China</conf-loc>, <conf-date>October, 2014</conf-date>.</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Risk-Averse coordinated operation of a multi-energy microgrid considering voltage/var control and thermal flow: an adaptive stochastic approach</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>12</volume> (<issue>5</issue>), <fpage>3914</fpage>&#x2013;<lpage>3927</lpage>. <pub-id pub-id-type="doi">10.1109/TSG.2021.3080312</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Restoration of multi energy distribution systems with joint district network recon figuration by a distributed stochastic programming approach</article-title>. <source>IEEE Trans. Smart Grid</source>, <fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/TSG.2023.3317780</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Tabu search based network partitioning for voltage control</article-title>. <source>Automation Electr. Power Syst.</source> (<issue>06</issue>), <fpage>18</fpage>&#x2013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.3321/j.issn:1000-1026.2002.06.005</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Mezquita</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Asber</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Lefebvre</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Saad</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Lagac&#xe9;</surname>
<given-names>P. J.</given-names>
</name>
</person-group> (<year>2011</year>). &#x201c;<article-title>Power network partitioning with a fuzzy C-means</article-title>,&#x201d; in <conf-name>Proc. IASTED Int. Conf. Power and Energy Systems and Applications (PESA 2011)</conf-name>, <conf-loc>Pittsburgh, USA</conf-loc>, <conf-date>November, 2011</conf-date>.</citation>
</ref>
<ref id="B20">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Orero</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Irving</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>1996</year>). &#x201c;<article-title>A genetic algorithm for network partitioning in power system state estimation</article-title>,&#x201d; in <conf-name>Paper presented at the UKACC International Conference on Control&#x27;96</conf-name>, <conf-loc>Exeter, UK</conf-loc>, <conf-date>September, 1996</conf-date>.</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pan</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Ai</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Research status and prospect of distributed energy resource dispatching in new distribution system</article-title>. <source>Power Syst. Technol.</source>, <fpage>1</fpage>&#x2013;<lpage>16</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2023.0716</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>S&#xe1;nchez-Garc&#xed;a</surname>
<given-names>R. J.</given-names>
</name>
<name>
<surname>Fennelly</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Norris</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wright</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Niblo</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Brodzki</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2014</year>). <article-title>Hierarchical spectral clustering of power grids</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>29</volume> (<issue>5</issue>), <fpage>2229</fpage>&#x2013;<lpage>2237</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2014.2306756</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Reactive power voltage control partitioning based on modified shuffled frog-leaping-K-means clustering algorithm</article-title>. <source>Transducer Microsyst. Technol.</source> <volume>32</volume> (<issue>06</issue>), <fpage>18</fpage>&#x2013;<lpage>21</lpage>. <pub-id pub-id-type="doi">10.13873/j.1000-97872013.06.014</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Consensus dispatch of distributed power network based on multi-access edge computing and multi-agent system</article-title>. <source>Front. Energy Res.</source> <volume>10</volume>, <fpage>907359</fpage>. <pub-id pub-id-type="doi">10.3389/fenrg.2022.907359</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xue</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Structural and hierarchical partitioning of virtual microgrids in power distribution network</article-title>. <source>IEEE Syst. J.</source> <volume>13</volume> (<issue>1</issue>), <fpage>823</fpage>&#x2013;<lpage>832</lpage>. <pub-id pub-id-type="doi">10.1109/JSYST.2018.2821137</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2023a</year>). <article-title>Development, application, and prospect of power and energy balance Analysis and its speedup computation technologies</article-title>. <source>Power Syst. Technol.</source>, <fpage>1</fpage>&#x2013;<lpage>19</lpage>.</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Tang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>Power network partition based on fuzzy clustering Analysis</article-title>. <source>Proc. CSEE</source> (<issue>22</issue>), <fpage>6</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.3321/j.issn:0258-8013.2006.22.002</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Mandapaka</surname>
<given-names>P. V.</given-names>
</name>
<name>
<surname>Lo</surname>
<given-names>E. Y. M.</given-names>
</name>
</person-group> (<year>2023b</year>). <article-title>Risk-averse restoration of coupled power and water systems with small pumped-hydro storage and stochastic rooftop renewables</article-title>. <source>Appl. energy</source> <volume>339</volume>, <fpage>120953</fpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2023.120953</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Long</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Liao</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Topology verification method of a distribution network based on hierarchiacal clustering and the Pearson correlation coefficient</article-title>. <source>Power Syst. Prot. Control</source> <volume>49</volume> (<issue>21</issue>), <fpage>88</fpage>&#x2013;<lpage>96</lpage>. <pub-id pub-id-type="doi">10.19783/j.cnki.pspc.210075</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Research overview of reactive voltage control partitioning for power system</article-title>. <source>Electrotech. Electr.</source> (<issue>03</issue>), <fpage>1</fpage>&#x2013;<lpage>6&#x2b;28</lpage>. <pub-id pub-id-type="doi">10.3969/j.issn.1007-3175.2018.03.001</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Centralized-distributed pattern of distribution network and its hierarchical partition method adapting to development trend of new power system</article-title>. <source>Smart Power</source> <volume>51</volume> (<issue>01</issue>), <fpage>94</fpage>&#x2013;<lpage>100</lpage>. <pub-id pub-id-type="doi">10.3969/j.issn.1673-7598.2023.01.014</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>