<?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">1102949</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2023.1102949</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>Fast reconfiguration method of low-carbon distribution network based on convolutional neural network</article-title>
<alt-title alt-title-type="left-running-head">Yu 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.2023.1102949">10.3389/fenrg.2023.1102949</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Yu</surname>
<given-names>Yixiao</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2070995/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Yang</surname>
<given-names>Ming</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1692604/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Zhang</surname>
<given-names>Yumin</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2034792/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Ye</surname>
<given-names>Pingfeng</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1923981/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Ji</surname>
<given-names>Xingquan</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1886344/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Jingrui</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2172383/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Key Laboratory of Power System Intelligent Dispatch and Control of Ministry of Education (Shandong University)</institution>, <addr-line>Jinan</addr-line>, <addr-line>Shandong Province</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>College of Energy Storage Technology</institution>, <institution>Shandong University of Science and Technology</institution>, <addr-line>Qingdao</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>College of Electrical Engineering and Automation</institution>, <institution>Shandong University of Science and Technology</institution>, <addr-line>Qingdao</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/1878964/overview">Hongming Yang</ext-link>, Changsha University of Science and Technology, China</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/802762/overview">Premkumar M</ext-link>, GMR Institute of Technology, India</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1121848/overview">Yushuai Li</ext-link>, University of Oslo, Norway</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Yumin Zhang, <email>ymzhang2019@sdust.edu.cn</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Process and Energy Systems Engineering, a section of the journal Frontiers in Energy Research</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>19</day>
<month>01</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>11</volume>
<elocation-id>1102949</elocation-id>
<history>
<date date-type="received">
<day>19</day>
<month>11</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>10</day>
<month>01</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Yu, Yang, Zhang, Ye, Ji and Li.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Yu, Yang, Zhang, Ye, Ji and Li</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>The existing meta-heuristic distribution network reconfiguration (DNR) algorithm has excellent optimization ability through iteration. However, it is difficult to realize the large-scale fast calculation and online real-time response of DNR solution. In order to improve the security and low-carbon economy of distribution network, this paper proposes a fast reconfiguration method of distribution network based on convolutional neural network (CNN). Taking IEEE 33 system and 185 node system as examples, the effectiveness of the proposed method is verified. The reasons why the proposed method can achieve better results are as follows: By mining the historical data of distribution network, the corresponding relationship between load mode (LM) and its optimal topology is established. For a load mode in actual operation, the reconfiguration scheme can be quickly obtained according to the established corresponding relationship. Thus, iterative calculation is avoided and computational efficiency is improved. A multi-branch CNN model is established based on the distribution network structure, and an inception module is introduced into CNN to improve the ability of CNN to extract data features. This model can reduce the dependence on the specific distribution network structure and is easy to expand.</p>
</abstract>
<kwd-group>
<kwd>convolutional neural network (CNN)</kwd>
<kwd>rapid reconfiguration of distribution network</kwd>
<kwd>load mode</kwd>
<kwd>mixed training</kwd>
<kwd>data driven</kwd>
</kwd-group>
<contract-sponsor id="cn001">National Natural Science Foundation of China<named-content content-type="fundref-id">10.13039/501100001809</named-content>
</contract-sponsor>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>In the context of global warming, low-carbon operation is one of the trends in distribution system. At present, the distribution network can achieve the purpose of low-carbon operation (<xref ref-type="bibr" rid="B21">Qing et al., 2021</xref>) by means of operation optimization such as reconfiguration (<xref ref-type="bibr" rid="B34">Zhan et al., 2020</xref>) and multi-energy coupling comprehensive energy system (<xref ref-type="bibr" rid="B35">Zhang et al., 2022</xref>; <xref ref-type="bibr" rid="B12">Li Y et al., 2021</xref>). Distribution network reconfiguration (DNR) is an important part of distribution management system (DMS) which can improve the operating state of distribution network (DN) (<xref ref-type="bibr" rid="B34">Zhan et al., 2020</xref>). In the smart grid environment, the value of power grid operation data cannot be ignored. Big data technology has been practically applied in operation and management practice of distribution network (<xref ref-type="bibr" rid="B33">Zainab et al., 2021</xref>). For DNR problem, mining the relationship between the historical operation data of distribution network and the reconfiguration scheme, so as to achieve rapid adaptive reconfiguration, is conductive to improving the economic benefits of power system operation, in line with the mainstream of low-carbon energy development.</p>
<p>In the early stage of DNR development, distribution network structure was relatively simple and power flow direction was single. The reconfiguration analysis methods commonly used mainly included two categories: analytical algorithm based on mathematical optimization (<xref ref-type="bibr" rid="B25">Wang C et al., 2020</xref>; <xref ref-type="bibr" rid="B31">Yi et al., 2021</xref>). Traditional heuristic algorithm based on simplified model solution of distribution network (<xref ref-type="bibr" rid="B23">Talukdar et al., 2019</xref>).</p>
<p>With the access of distributed Generation (DG), bidirectional power flow occurs in DN. The traditional DNR method based on unidirectional power flow is no longer applicable (<xref ref-type="bibr" rid="B15">Li et al., 2020</xref>; <xref ref-type="bibr" rid="B30">Yang et al., 2020</xref>). Therefore, various intelligent algorithms and their hybrid algorithms are gradually used to solve DNR problems.</p>
<p>The design idea of intelligent algorithm is derived from the simulation of natural process. If there is no time constraint, the algorithm can guarantee the global optimal solution. At present, the intelligent methods commonly used in DNR are mainly various meta-heuristic algorithms, such as particle swarm algorithm (<xref ref-type="bibr" rid="B27">Wu et al., 2021a</xref>), genetic algorithm (<xref ref-type="bibr" rid="B8">Jin et al., 2020</xref>), and ant colony algorithm (<xref ref-type="bibr" rid="B4">Chen and Dai, 2020</xref>). In order to improve algorithm, researchers adopted measures such as compression solution space (<xref ref-type="bibr" rid="B26">Wang J et al., 2020</xref>), addition of mutation operation (<xref ref-type="bibr" rid="B19">Pegado et al., 2019</xref>) and collaborative solution of multiple algorithms (<xref ref-type="bibr" rid="B6">Huang et al., 2021</xref>; <xref ref-type="bibr" rid="B20">Prasad and Sushama, 2022</xref>). However, the iterative optimization method of the above algorithms not only gives it strong optimization performance, but also determines that it is difficult to achieve efficient solution of the distribution network reconfiguration scheme.</p>
<p>Real-time operation is an inherent attribute of NN (Neural Network) algorithm, from the proposed neuron M-P model to the establishment of DL (Deep Learning) theory, Neural Network model. In particular, deep learning model has been widely applied in many fields with real-time analysis requirements, such as image annotation (<xref ref-type="bibr" rid="B1">Abrahamyan et al., 2021</xref>), speech recognition (<xref ref-type="bibr" rid="B7">Hussain et al., 2021</xref>), semantic understanding (<xref ref-type="bibr" rid="B5">DE Oliveira et al., 2020</xref>; <xref ref-type="bibr" rid="B29">Xie et al., 2021</xref>), and achieved good application effects (<xref ref-type="bibr" rid="B38">Zheng et al., 2021</xref>). In power system, deep learning model has also been introduced into measurement data completion (<xref ref-type="bibr" rid="B24">Wang et al., 2021</xref>), fault identification and line selection (<xref ref-type="bibr" rid="B28">Wu et al., 2021b</xref>), load prediction (<xref ref-type="bibr" rid="B2">Alavi et al., 2021</xref>; <xref ref-type="bibr" rid="B11">Li L. et al., 2021</xref>; <xref ref-type="bibr" rid="B13">Li et al., 2021a</xref>; <xref ref-type="bibr" rid="B14">Li et al., 2021b</xref>), and state estimation (<xref ref-type="bibr" rid="B6">Huang et al., 2021</xref>).</p>
<p>As early as in the 1990s, some scholars applied Artificial Neural Network (ANN) to solve DNR problems (<xref ref-type="bibr" rid="B36">Zhe et al., 2020</xref>). Neural Network is a data-driven algorithm, and the model quality is extremely dependent on the quantity and quality of training data. For a long time, the acquisition of distribution network operation data has been the constraint of NN algorithm in the development of DNR problem. At present, with the improvement of monitoring equipment in distribution network, the massive data generated by it has become the soil for the development of distribution network big data and data-driven technology. Therefore, it is necessary to study DNR based on data drive (<xref ref-type="bibr" rid="B18">Ozcanli et al., 2020</xref>).</p>
<p>In existing studies, literature (<xref ref-type="bibr" rid="B10">Kim et al., 1993</xref>) regarded DNR as a switching state prediction problem based on network parameter matrix, so as to be applicable to the solution mode of NN. Literature (<xref ref-type="bibr" rid="B37">Zheng et al., 2020</xref>) used lSTM-based probability distribution prediction network to extract the reference joint probability distribution of DG output and load from historical data, and then applied it to the robust optimization and reconfiguration of three-phase unbalanced distribution network. Literature (<xref ref-type="bibr" rid="B17">Oh et al., 2020</xref>) proposed an online reconfiguration method of distribution network based on reinforcement learning. The voltage and load state of distribution network buses were introduced into the reinforcement learning reward mechanism, and the optimal topology was obtained by Deep Q-learning DQL algorithm. Convolutional Neural Network (CNN) was used in literature (<xref ref-type="bibr" rid="B32">Yin et al., 2020</xref>) to solve DNR problems, and an overall model was constructed based on the idea of loop com-bination, which verifies the effectiveness of CNN. <xref ref-type="bibr" rid="B9">Ji et al. (2021)</xref> proposes a dynamic distribution network reconfiguration model based on LSTM, which takes the network loss and switching action cost of the distribution system as the optimization objectives, and realizes the real-time reconfiguration while reducing the system operating cost and switching loss. In <xref ref-type="bibr" rid="B16">Malekshah et al. (2022)</xref>, a dynamic distribution network reconfiguration method based on deep Q learning algorithm is proposed under the condition of a large number of distributed generation equipment being connected to the grid. The optimization objective is to minimize the network loss and voltage deviation, so as to realize the economical and reliable operation of the distribution system. A three-stage distribution network reconfiguration method based on deep deterministic policy gradient (DDPG) is proposed in <xref ref-type="bibr" rid="B3">Bui and Su (2022)</xref>. By changing the topology of the system and the access location of the distributed power supply, the operating cost and load loss of the system can be reduced. <xref ref-type="bibr" rid="B24">Wang et al. (2021)</xref> proposes a distribution network reconfiguration method based on NoisyNet deep Q-learning network (DQN), which gets rid of the constraint of network structure to a certain extent, and achieves the purpose of reducing power consumption and improving voltage level.</p>
<p>Therefore, based on previous work, this paper proposes a fast reconfiguration model of distribution network based on convolutional neural network:<list list-type="simple">
<list-item>
<p>(1) The CNN-based distribution network fast reconfiguration model proposed for the first time in this paper, which does not require the complex and time-consuming iterative calculation, thus significantly improving the solution efficiency.</p>
</list-item>
<list-item>
<p>(2) The Inception module (<xref ref-type="bibr" rid="B22">Szegedy et al., 2016</xref>) is introduced into the CNN model to extract multi-scale features of data through multiple convolution channels in parallel, which effectively improves the ability of the CNN model to extract data features.</p>
</list-item>
</list>
</p>
<p>The rest of this paper is structured as follows. <xref ref-type="sec" rid="s2">Section 2</xref> introduces the principle and model building of CNN. <xref ref-type="sec" rid="s3">Section 3</xref> describes the data set construction of CNN-DNR model. The case studies are conducted in <xref ref-type="sec" rid="s4">Section 4</xref> to verify the proposed model, and the conclusions are drawn in <xref ref-type="sec" rid="s5">Section 5</xref>.</p>
</sec>
<sec id="s2">
<title>2 Principle and model building of CNN</title>
<p>The powerful feature extraction performance of CNN comes from its deep structure and convolution operation, which is further enhanced by the expansion of Inception module on the network scale. Therefore, in this paper, the Inception V3 module is used as the basic unit for feature extraction, combined with the loop structure of the distribution network to construct the DR-CNN model, and the integrated network is trained based on the method of weight transfer.</p>
<sec id="s2-1">
<title>2.1 CNN infrastructure</title>
<p>The infrastructure of CNN is shown in <xref ref-type="fig" rid="F1">Figure 1A</xref>. The basic CNN structure consists of convolution, activation and pooling. In general, when processing classification tasks, the output of CNN is taken as the input of the full connection layer, and the mapping be-tween input matrix and label set is completed by the full connection layer.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Basic structure of CNN model.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g001.tif"/>
</fig>
</sec>
<sec id="s2-2">
<title>2.2 CNN model building</title>
<p>DNR based on CNN can be regarded as a prediction problem of distribution net-work switch status. Data features of distribution network load patterns are extracted through Inception module to match the corresponding switch status. The calculation of switching state is based on Softmax classifier, and the number of classification is the same as the number of distribution network buses. In order to improve the performance of the classifier, the whole CNN model is constructed with the structure of split loop and multi-classifier.</p>
<sec id="s2-2-1">
<title>2.2.1 Google inception module structure</title>
<p>In order to facilitate the extraction of high-dimensional features of data, the Inception module is used to build a CNN model.</p>
<p>Inception module is the basic component of GoogLeNet. This module decomposes the larger convolution layer in CNN into smaller convolution layer and pooling layer, which can improve the performance in the following two aspects: First, network learning parameters are reduced through the decomposition of the convolution layer, and the model learning efficiency is improved. Second, the decomposition of the convolution layer enables the model to have the ability of multi-channel information processing, which improves the breadth of the network. Since the model outputs the summary of multi-channel processing results, the information representation ability is enhanced. The specific operation of convolution kernel decomposition is as follows:<list list-type="simple">
<list-item>
<p>(1) Convolution kernel decomposition. <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mn>5</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> convolution is decomposed into two serial <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> convolution with the same receptive field, while the latter has more non-linear operations. The number ratio of the two parameters is <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mn>3</mml:mn>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mn>3</mml:mn>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:msup>
<mml:mn>5</mml:mn>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.72</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> , that is, the number of parameters is reduced by 28%.</p>
</list-item>
<list-item>
<p>(2) Convolution decomposition of space. Decomposition of <inline-formula id="inf4">
<mml:math id="m4">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> convolution into the asymmetric convolution of <inline-formula id="inf5">
<mml:math id="m5">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf6">
<mml:math id="m6">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> in series can also improve the representation ability. The ratio of the two parameters was <inline-formula id="inf7">
<mml:math id="m7">
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:msup>
<mml:mn>3</mml:mn>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo>&#x2248;</mml:mo>
<mml:mn>0.66</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> , and the number of parameters decreased by 33%.</p>
</list-item>
</list>
</p>
<p>The form of convolution decomposition can be seen in the Inception module structure shown in <xref ref-type="fig" rid="F1">Figure 1B</xref>. As can be seen from <xref ref-type="fig" rid="F1">Figure 1B</xref>, Inception module expands both the breadth and depth of the network. That is, pooling operation and multi-scale convolution processing are adopted to process data. Such multi-channel data processing method increases the network breadth. The decomposition of convolution kernel increases the depth of the network, and also increases the number of activation functions, thus strengthening the characterization ability of the network.</p>
</sec>
<sec id="s2-2-2">
<title>2.2.2 Single loop CNN model</title>
<p>Power switch classification problem requirement model to predict all the state of the switch in the power distribution network, to reduce the pressure of the classification of the Softmax classifier, this paper takes the IEEE 33 buses system as an example, based on the loop structure of distribution network structures, multiple single loop CNN submodel, combining classifier output of each sub models predict each state of the switch. The structure of CNN sub-model is shown in <xref ref-type="fig" rid="F1">Figure 1C</xref>.</p>
<p>As can be seen from <xref ref-type="fig" rid="F1">Figure 1C</xref>, the model first preprocesses the input distribution network parameter matrix rows with convolution and pooling, and then imports the feature extraction part composed of Inception module. The data features are transmitted to the full connection layer after secondary sampling and flattening for mapping be-tween data and labels. Finally, Softmax function is used to calculate and output the state prediction results of each switch in the corresponding loop.</p>
<p>Loop switch state prediction is a multi-classification problem, and its loss optimization process is as follows:<list list-type="simple">
<list-item>
<p>(1) The Softmax classifier outputs the classification index. The Softmax function is defined as the ratio of the exponent of a single element to the exponent sum of all elements:</p>
</list-item>
</list>
<disp-formula id="e1">
<mml:math id="m8">
<mml:mrow>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mi>&#x3b7;</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>&#x3b7;</mml:mi>
</mml:msub>
</mml:msup>
<mml:mrow>
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>(2) The loss of the model is calculated based on classification cross entropy:</p>
</list-item>
</list>
<disp-formula id="e2">
<mml:math id="m9">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b8;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:mi>log</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mrow>
<mml:mi>&#x3b8;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>z</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>(3) The model loss value is imported into the optimizer to update the network weights, and the Adaptive Moment Estimation (Adam) method is used to accelerate the gradient descent.</p>
</list-item>
</list>
</p>
<p>Adam algorithm is the combination of momentum acceleration decline and root mean square back propagation. By calculating the first and second moment estimates of the gradient, independent adaptive learning rates are designed for different parameters. The algorithm can correct the problems of learning rate disappearance and slow con-vergence in the optimization process, and its iterations are as follows:<disp-formula id="e3">
<mml:math id="m10">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mo>&#x2207;</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>m</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msub>
<mml:mi>g</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>v</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msubsup>
<mml:mi>g</mml:mi>
<mml:mi>t</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>2</mml:mn>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
<mml:msub>
<mml:mover accent="true">
<mml:mi>m</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:msub>
<mml:mover accent="true">
<mml:mi>v</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:msqrt>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<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:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
</sec>
<sec id="s2-2-3">
<title>2.2.3 Loop model integration</title>
<p>In the reconfiguration calculation of distribution network, the actions of switches between loops will affect each other. Therefore, the interaction between sub-models should also be considered in the training of CNN model for unified optimization. The structure of the integration model is shown in <xref ref-type="fig" rid="F1">Figure 1D</xref>.</p>
<p>It can be seen from <xref ref-type="fig" rid="F1">Figure 1D</xref> that the number of branches of the integration model is the same as the loop number L of the distribution network. During the data input phase of the model, a convolutional layer with Batch Normalization BN is set up for initial data processing, which is then fed into each circuit sub-model.</p>
<p>The Concatenate layer is used to combine the output of the model, and the final output of the model is the splicing of the output of sub-model classifiers in the first dimension:<disp-formula id="e4">
<mml:math id="m11">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold">O</mml:mi>
<mml:mtext>con</mml:mtext>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold">O</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold">O</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold">O</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>The model output needs to be combined with the corresponding data labels to calculate the loss of each branch, and take the maximum value to participate in the weight iteration of the model. The loss is calculated as:<disp-formula id="e5">
<mml:math id="m12">
<mml:mrow>
<mml:msup>
<mml:mi>L</mml:mi>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>max</mml:mi>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
<p>For the loss <inline-formula id="inf8">
<mml:math id="m13">
<mml:mrow>
<mml:msup>
<mml:mi>L</mml:mi>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> calculated by the model, the iteration format of Adam algorithm&#x2019;s parameters is:<disp-formula id="e6">
<mml:math id="m14">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>g</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mo>&#x2207;</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
</mml:msub>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>m</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>l</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:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<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:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msubsup>
<mml:mi>g</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>v</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>l</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:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<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:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>g</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi mathvariant="normal">c</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3b2;</mml:mi>
<mml:mn>2</mml:mn>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
<mml:msub>
<mml:mover accent="true">
<mml:mi>m</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:msub>
<mml:mover accent="true">
<mml:mi>v</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msqrt>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<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:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
</sec>
</sec>
<sec id="s2-3">
<title>2.3 Model mixed training based on weight transfer</title>
<p>Aiming at the difficulty of training due to the complex structure of the integrated model, this paper adopts the hybrid training method based on weight transfer to train the model. The process can be divided into three stages: single loop model training&#x2014;weight transfer&#x2014;integrated model mixed training.</p>
<p>The following constraints are set as the criteria for process termination in the training:<list list-type="simple">
<list-item>
<p>(1) Training cycle constraints</p>
</list-item>
</list>
<disp-formula id="e7">
<mml:math id="m15">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x3e;</mml:mo>
<mml:msup>
<mml:mi>E</mml:mi>
<mml:mtext>set</mml:mtext>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>(2) Optimization effect constraint</p>
</list-item>
</list>
<disp-formula id="e8">
<mml:math id="m16">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>E</mml:mi>
</mml:msub>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>e</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1,2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>E</mml:mi>
<mml:mi>lim</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
<p>The training process is shown in <xref ref-type="fig" rid="F2">Figure 2</xref>. The specific steps are as follows:</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Training process.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g002.tif"/>
</fig>
<p>
<statement content-type="step" id="Step_1">
<label>Step 1:</label>
<p>Load single-loop data of distribution network for data processing. The distribution network parameter matrix is normalized, the loop switch state is converted into one HOT code, and the training set and test set are divided.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_2">
<label>Step 2:</label>
<p>Load the single-loop model and initialize the model parameters.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_3">
<label>Step 3:</label>
<p>Import data, extract data features, and complete the forward propagation process.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_4">
<label>Step 4:</label>
<p>Calculate the state probability matrix of loop switch according to <xref ref-type="disp-formula" rid="e1">Formula 1</xref>. The larger the matrix element value is, the greater the probability of switch dis-connection is.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_5">
<label>Step 5:</label>
<p>According to the output matrix obtained in <xref ref-type="statement" rid="Step_4">Step 4</xref> and the switch coding in <xref ref-type="statement" rid="Step_1">Step 1</xref>, calculate the model loss according to <xref ref-type="disp-formula" rid="e2">Formula 2</xref>.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_6">
<label>Step 6:</label>
<p>Constraint judgment. According to the initial training rounds and callback round limits of the model, determine whether the training process is terminated in combination with Eqs <xref ref-type="disp-formula" rid="e7">7</xref>, <xref ref-type="disp-formula" rid="e8">8</xref>. If yes, end the training and save the model, and go to <xref ref-type="statement" rid="Step_8">Step 8</xref>. Otherwise, go to <xref ref-type="statement" rid="Step_7">Step 7</xref>.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_7">
<label>Step 7:</label>
<p>Calculate the new weights according to <xref ref-type="disp-formula" rid="e3">Formula 3</xref>, update the network weights, complete the back propagation process, and go to <xref ref-type="statement" rid="Step_3">Step 3</xref>.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_8">
<label>Step 8:</label>
<p>Extract weight of single loop model.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_9">
<label>Step 9:</label>
<p>Load the overall data of distribution network, normalize the data, and convert labels into one-HOT coding.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_10">
<label>Step 10:</label>
<p>Load the integration model, and import the corresponding sub-model weights for each branch.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_11">
<label>Step 11:</label>
<p>Import data, extract data features, and complete the forward propagation process.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_12">
<label>Step 12:</label>
<p>Calculate the output of Softmax classifier according to Eq. <xref ref-type="disp-formula" rid="e1">1</xref>, and the output is the state probability matrix of each loop switch, as shown in Eq. <xref ref-type="disp-formula" rid="e4">4</xref>.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_13">
<label>Step 13:</label>
<p>According to the output matrix obtained in <xref ref-type="statement" rid="Step_12">Step 12</xref>, combined with the switch coding in <xref ref-type="statement" rid="Step_8">Step 8</xref>, the model is calculated according to Eqs <xref ref-type="disp-formula" rid="e2">2</xref>, <xref ref-type="disp-formula" rid="e5">5</xref>.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_14">
<label>Step 14:</label>
<p>Constraint judgment: Determine whether the training process is terminated according to Eqs <xref ref-type="disp-formula" rid="e7">7</xref>, <xref ref-type="disp-formula" rid="e8">8</xref>. If so, end the training and save the model. Otherwise, go to <xref ref-type="statement" rid="Step_15">Step 15</xref>.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_15">
<label>Step 15:</label>
<p>Calculate the new weights according to <xref ref-type="disp-formula" rid="e6">Formula 6</xref>, update the network weights, complete the back propagation process, and go to <xref ref-type="statement" rid="Step_11">Step 11</xref>.</p>
</statement>
</p>
</sec>
</sec>
<sec id="s3">
<title>3 Data set construction of CNN-DNR model</title>
<p>The data set of convolutional neural network in this paper is a data set composed of system load mode and corresponding optimization switch combination, and its construction process is shown in <xref ref-type="fig" rid="F3">Figure 3</xref>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Data set construction process.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g003.tif"/>
</fig>
<sec id="s3-1">
<title>3.1 Load patterns of CNN datasets</title>
<p>Load mode is the set of all load demand states of the system. For a given system, the demand-based load mode is divided into: load mode is the set of all load demand states of the system. For a given system, the demand-based load mode is divided into:<disp-formula id="e9">
<mml:math id="m17">
<mml:mrow>
<mml:mi mathvariant="bold">L</mml:mi>
<mml:mi mathvariant="bold">M</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mi>M</mml:mi>
<mml:mi>N</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>According to the percentage of peak load demand, demand level is classified into eight levels. The corresponding relationship between actual load and calculated load is shown in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Comparison of actual load and calculated load.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Actual load</th>
<th align="center">Computational load (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">&#x2264;35%</td>
<td align="center">30</td>
</tr>
<tr>
<td align="center">36%&#x2013;45%</td>
<td align="center">40</td>
</tr>
<tr>
<td align="center">46%&#x2013;55%</td>
<td align="center">50</td>
</tr>
<tr>
<td align="center">56%&#x2013;65%</td>
<td align="center">60</td>
</tr>
<tr>
<td align="center">66%&#x2013;75%</td>
<td align="center">70</td>
</tr>
<tr>
<td align="center">76%&#x2013;85%</td>
<td align="center">80</td>
</tr>
<tr>
<td align="center">86%&#x2013;95%</td>
<td align="center">90</td>
</tr>
<tr>
<td align="center">&#x2265;96%</td>
<td align="center">100</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In order to further reduce the data complexity, the load bus is divided into three groups: industrial, commercial and residential. The loads in the same group have similar load characteristics and change curves. By considering the total requirements of the load group, the number of load modes can be reduced to <inline-formula id="inf9">
<mml:math id="m18">
<mml:mrow>
<mml:msup>
<mml:mn>8</mml:mn>
<mml:mn>3</mml:mn>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-2">
<title>3.2 Distributional robust optimization model based on box decomposition algorithm</title>
<p>In this paper, Quantum Particle Swarm Optimization (QPSO) algorithm is adopted to solve the corresponding switch combination for the load mode divided. The algorithm takes the minimum active power loss of the system as the objective function.<disp-formula id="e10">
<mml:math id="m19">
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi mathvariant="normal">b</mml:mi>
</mml:msub>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>K</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>&#x22c5;</mml:mo>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mi>b</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
<p>The optimized switch combination should meet the following constraints:<list list-type="simple">
<list-item>
<p>(1) Topology constraints</p>
</list-item>
</list>
<disp-formula id="e11">
<mml:math id="m20">
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi mathvariant="bold">&#x393;</mml:mi>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>(2) Flow constraint</p>
</list-item>
</list>
<disp-formula id="e12">
<mml:math id="m21">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>cos</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>sin</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>N</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>cos</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>sin</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>(3) Bus voltage constraint</p>
</list-item>
</list>
<disp-formula id="e13">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mtext>&#x2002;</mml:mtext>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>
<list list-type="simple">
<list-item>
<p>(4) Branch capacity constraints</p>
</list-item>
</list>
<disp-formula id="e14">
<mml:math id="m23">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
</p>
</sec>
<sec id="s3-3">
<title>3.3 Data and label processing</title>
<p>The training of CNN model requires training data and corresponding labels, which are transformed from load mode and optimization topology respectively. According to the training requirements of CNN, the input data is the load mode after matrix and normalization. Label distribution loop topology in one-HOT encoding format.</p>
<p>The matrix <inline-formula id="inf10">
<mml:math id="m24">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x39b;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> describing the parameters of the distribution network is taken as the input matrix of the CNN model, where the number of columns of the matrix is consistent with the number of nodes of the training system, and each row of the matrix represents different data types of the distribution network such as the access state of DG, the active power of DG, the reactive power of PQ-type DG, the voltage of PV type DG, the current of PI type DG, the type of DG, the active power of load and the reactive power of each node.<disp-formula id="e15">
<mml:math id="m25">
<mml:mrow>
<mml:mi mathvariant="bold">&#x39b;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mn>1</mml:mn>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mn>2</mml:mn>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mn>1</mml:mn>
<mml:mtext>PQ</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>PQ</mml:mtext>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mn>2</mml:mn>
<mml:mtext>PV</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>PV</mml:mtext>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mn>3</mml:mn>
<mml:mtext>PI</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>PI</mml:mtext>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mn>1</mml:mn>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mn>2</mml:mn>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>i</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>DG</mml:mtext>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mn>2</mml:mn>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mi>N</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mn>1</mml:mn>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mn>2</mml:mn>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mi>N</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msubsup>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>8</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
</p>
<p>Before model training, data shown in Eq. <xref ref-type="disp-formula" rid="e15">15</xref> should be normalized and ex-pressed as:<disp-formula id="e16">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold">A</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold">&#x39b;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3bb;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>
</p>
<p>The network topology needs to be transformed into the one-hot coding combination of each loop topology, and then regarded as the label of multi-classification problem. The radial topology constraint of distribution network requires that only one switch in each loop is off at the same time. According to this characteristic, the status of the loop interrupt on switch is set to 1, and the status of the closed switch is set to 0. In this way, the loop <inline-formula id="inf11">
<mml:math id="m27">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> with branches has <inline-formula id="inf12">
<mml:math id="m28">
<mml:mrow>
<mml:msub>
<mml:mi>l</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> states, and only one switch in each state is in the open position, which conforms to the one-HOT encoding format. Taking the IEEE16 bus system as an example, the one-Hot coding principle of loop topology is explained in detail.</p>
<p>For switch configuration <inline-formula id="inf13">
<mml:math id="m29">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>h</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> , its corresponding one-HOT code is as follows:<disp-formula id="e17">
<mml:math id="m30">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>h</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mn>14</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>B</mml:mi>
<mml:mn>15</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>B</mml:mi>
<mml:mn>16</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>0,0,0,0,0,1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>0,0,0,0,1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>0,0,0,0,0,0,1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>
</p>
<p>For a power distribution system with l loops, each input matrix A has a corresponding one-hot code H of l loops. Based on this principle, the DNR problem can be transformed into the switch multi-classification problem of each loop.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Case studies</title>
<p>In order to verify the effectiveness of the distribution network rapid reconfiguration model based on deep learning proposed in this paper, IEEE 33-bus power distribution system is taken as a test example, and the system structure is shown in <xref ref-type="fig" rid="F4">Figure 4</xref> and the system loop-branch division is shown in <xref ref-type="table" rid="T2">Table 2</xref>. Based on Python environment programming, call Keras deep learning library to build the model. The computer operating system is Windows10. The CPU is Intel I7 1165G7, the main frequency is 2.8&#xa0;GHz, and the memory is 8&#xa0;GB. <xref ref-type="table" rid="T2">Table 2</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>IEEE 33-bus system.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g004.tif"/>
</fig>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>IEEE 33-bus system loop-branch division.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Loop</th>
<th align="center">Contains branch</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">1</td>
<td align="center">{B2,B3,B5,B6,B7,B18,B19,B20,B33}</td>
</tr>
<tr>
<td align="center">2</td>
<td align="center">{B9,B10,B11,B12,B13,B14,B34}</td>
</tr>
<tr>
<td align="center">3</td>
<td align="center">{B2,B3,B4,B5,B6,B7,B8,B9,B10,B18,B19,B20,B21,B35}</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">{B6,B7,B8,B9,B10,B11,B12,B13,B14,B15,B16,B17,B25,B26,B27,B28,B29,B30,B31,B32,B36}</td>
</tr>
<tr>
<td align="center">5</td>
<td align="center">{B3,B4,B5,B23,B24,B25,B26,B27,B28,B37}</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The specific parameters of the DG are shown in <xref ref-type="table" rid="T3">Table 3</xref>. The connected DG is di-vided into 30%, 60%, and 100% according to the output level. Therefore, there are 19 scenarios of distributed power supply.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>DG configuration.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Serial number</th>
<th align="center">DG number</th>
<th align="center">Type</th>
<th align="center">Parameter (p.u.)</th>
<th align="center">Added bus</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">1</td>
<td align="center">0</td>
<td align="center">-</td>
<td align="center">-</td>
<td align="center">-</td>
</tr>
<tr>
<td align="center">2</td>
<td align="center">1</td>
<td align="center">PQ</td>
<td align="center">P &#x3d; 0.03, Q &#x3d; 0.01</td>
<td align="center">18</td>
</tr>
<tr>
<td align="center">3</td>
<td align="center">4</td>
<td align="center">PQ</td>
<td align="center">P &#x3d; 0.03, Q &#x3d; 0.01</td>
<td align="center">18, 22, 25, 33</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">1</td>
<td align="center">PV</td>
<td align="center">P &#x3d; 0.03, &#x7c;U&#x7c; &#x3d; 0.95</td>
<td align="center">18</td>
</tr>
<tr>
<td align="center">5</td>
<td align="center">4</td>
<td align="center">PV</td>
<td align="center">P &#x3d; 0.03, &#x7c;U&#x7c; &#x3d; 0.95</td>
<td align="center">18, 22, 25, 33</td>
</tr>
<tr>
<td align="center">6</td>
<td align="center">1</td>
<td align="center">PI</td>
<td align="center">P &#x3d; 0.03, &#x7c;I&#x7c; &#x3d; 0.0325</td>
<td align="center">18</td>
</tr>
<tr>
<td align="center">7</td>
<td align="center">4</td>
<td align="center">PI</td>
<td align="center">P &#x3d; 0.03, &#x7c;I&#x7c; &#x3d; 0.0325</td>
<td align="center">18,22,25,33</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s4-1">
<title>4.1 Model training effect</title>
<sec id="s4-1-1">
<title>4.1.1 Training</title>
<p>The dataset contains 19&#xa0;DG scenarios as shown in <xref ref-type="table" rid="T3">Table 3</xref>, each of which is divided into 512 load modes and a total of 9,728 system state sections. In the training process, the proportion of training set to total data is 80%, test set to 15%, verification set to 5%. To verify the performance advantage of the CNN model based on Inception module in this paper, the training effect is compared with that of the basic CNN model. The accuracy of the two models on the training set and test set is shown in <xref ref-type="fig" rid="F5">Figure 5</xref>.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Accuracy of model classification.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g005.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="F5">Figure 5</xref> that the Inception CNN model has better feature extraction capability than the basic convolutional model. The training effect of the former on the training set and test set and the overall accuracy increase rate of the former are better than the latter. After 250 rounds of training, the accuracy of the model in the training set and test set is 99.31% and 99.28% respectively. From the curve trend, in the first 50 rounds, the precision of the model training set is ahead of that of the test set. During the 50 to 250 rounds of training, the accuracy curves of the two are similar, and tend to be stable after 200 rounds. In the early stages of training (rounds 0&#x2013;25), due to the differences among the branches of the Inception model, which enable the optimization of the test accuracy is delayed. Thereby, resulting in the classification accuracy of the Inception test set being lower than that of the basic Conv model test set. Due to the focus of the hybrid training method on the high-loss branch of the model, the final training effect of the model is guaranteed.</p>
</sec>
<sec id="s4-1-2">
<title>4.1.2 Generalization ability</title>
<p>According to <xref ref-type="fig" rid="F6">Figure 6</xref>, the main operation switches of system optimization recon-figuration are located at B7, B9, B14, B23, and B26. In addition, the classification error of the model is mainly reflected in the confusion of switch states between branches B9-B10-B14 and B22-B23.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Loop confusion matrix.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g006.tif"/>
</fig>
<p>In addition, the performance index of DL model is the quantification of model performance based on confusion matrix, including accuracy, recall rate and F1 score. Accuracy rate represents the real tag proportion of model prediction results. Recall rate represents the prediction accuracy of the model for real labels. The F1 score is the harmonic average of the first two, and the F1 score of the model is positively correlated with its performance. The classification index of action branch based on confusion matrix is shown in <xref ref-type="table" rid="T4">Table 4</xref>.</p>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Classification index of main action branch.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Branch</th>
<th align="center">Number of samples</th>
<th align="center">Accuracy (%)</th>
<th align="center">Recall rate (%)</th>
<th align="center">F1 score</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">B6</td>
<td align="center">131</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">B7</td>
<td align="center">573</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">B8</td>
<td align="center">71</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">B9</td>
<td align="center">451</td>
<td align="center">100</td>
<td align="center">99.33</td>
<td align="center">99.66</td>
</tr>
<tr>
<td align="center">B10</td>
<td align="center">52</td>
<td align="center">96.23</td>
<td align="center">98.08</td>
<td align="center">97.15</td>
</tr>
<tr>
<td align="center">B13</td>
<td align="center">24</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">B14</td>
<td align="center">448</td>
<td align="center">99.56</td>
<td align="center">100</td>
<td align="center">99.78</td>
</tr>
<tr>
<td align="center">B17</td>
<td align="center">72</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">B22</td>
<td align="center">5</td>
<td align="center">83.33</td>
<td align="center">100</td>
<td align="center">90.91</td>
</tr>
<tr>
<td align="center">B23</td>
<td align="center">243</td>
<td align="center">100</td>
<td align="center">99.59</td>
<td align="center">99.79</td>
</tr>
<tr>
<td align="center">B26</td>
<td align="center">219</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">B32</td>
<td align="center">55</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be seen from <xref ref-type="table" rid="T4">Table 4</xref> that the switch classification prediction effect of the model for large sample branches and most small sample branches is good, and each performance score is above 99. However, the classification performance of small sample branches B10 and B22 decreased, and their F1 scores were 97.15 and 90.91, respectively. It shows that insufficient label sample size will lead to the decrease of model generalization ability. The reason is on the one hand, the data feature coverage of small sample is not complete. On the other hand, it is the coverage of large sample features to small sample features in data sets.</p>
</sec>
</sec>
<sec id="s4-2">
<title>4.2 Model performance analysis</title>
<sec id="s4-2-1">
<title>4.2.1 Solution efficiency analysis</title>
<p>In order to verify the timeliness of THE CNN model, 2,000 groups of data were randomly selected from the data set as the prediction target, and imported into the CNN model completed by training for prediction and timing. The results of program running time are shown in <xref ref-type="table" rid="T5">Table 5</xref>. In <xref ref-type="table" rid="T5">Table 5</xref>, a and b are configured to simulate offline operation, and the model loading time is included in the total time consumed, which includes the model loading time and the program operation time. Configuration c is set to simulate online operation, and the total time consumed is only the operation time of the program.</p>
<table-wrap id="T5" position="float">
<label>TABLE 5</label>
<caption>
<p>Program running time statistics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Configuration</th>
<th rowspan="2" align="center">Amount of data</th>
<th rowspan="2" align="center">Running time (s)</th>
<th rowspan="2" align="center">All time calculation (ms)</th>
<th colspan="2" align="center">Model and data loading</th>
</tr>
<tr>
<th align="center">Time (s)</th>
<th align="center">Ratio (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">a</td>
<td align="center">2000</td>
<td align="center">60.77</td>
<td align="center">1.99</td>
<td align="center">58.78</td>
<td align="center">93.43</td>
</tr>
<tr>
<td align="center">b</td>
<td align="center">20,000</td>
<td align="center">86.89</td>
<td align="center">1.51</td>
<td align="center">58.78</td>
<td align="center">65.35</td>
</tr>
<tr>
<td align="center">C</td>
<td align="center">2000</td>
<td align="center">3.99</td>
<td align="center">1.99</td>
<td align="center">&#x2013;</td>
<td align="center">&#x2013;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>By comparing the operation of each configuration in <xref ref-type="table" rid="T5">Table 5</xref>, it can be seen that the model loading time accounts for more than 65% of the total offline operation. Excluding model loading, the calculation time of all three is less than 2&#xa0;ms, showing no significant difference. By comparing configuration A and B, it can be seen that when the amount of calculation data is increased, the proportion of model loading time decreases from 93.43% to 65.35%, and the influence on the total time is reduced.</p>
<p>The standard IEEE33-bus distribution network is taken as the test system. The proposed method is compared with QPSO, improved cuckoo algorithm improved cuckoo search algorithm (ICSA), random forest (RF) and long short-term memory (LSTM) to calculate the average of 50 metaheuristic algorithms. The solution results are shown in <xref ref-type="table" rid="T6">Table 6</xref>.</p>
<table-wrap id="T6" position="float">
<label>TABLE 6</label>
<caption>
<p>Comparison of algorithm solution time.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Algorithm</th>
<th rowspan="2" align="center">QPSO</th>
<th rowspan="2" align="center">ICSA</th>
<th rowspan="2" align="center">RF</th>
<th rowspan="2" align="center">LSTM</th>
<th colspan="2" align="center">The algorithm in this paper</th>
</tr>
<tr>
<th align="center">Online</th>
<th align="center">Offline</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Time/s</td>
<td align="center">7.315</td>
<td align="center">4.509</td>
<td align="center">4.767</td>
<td align="center">5.137</td>
<td align="center">0.002</td>
<td align="center">0.641</td>
</tr>
<tr>
<td align="center">Loss/kW</td>
<td align="center">139.584</td>
<td align="center">139.554</td>
<td align="center">139.569</td>
<td align="center">139.588</td>
<td align="center">139.554</td>
<td align="center">139.554</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="table" rid="T6">Table 6</xref>, compared with QPSO, ICSA, RF, and LSTM methods, the online and offline operation time of the proposed method is significantly reduced and controlled to within 1s in terms of solution efficiency. Therefore, the proposed method can realize the rapid reconfiguration of distribution network, because the CNN model does not need to perform iterative optimization in the solution space. The reconfiguration strategy can be directly obtained according to the mapping relationship between the load pattern established in the training process and the reconfiguration strategy. In terms of network loss, the loss reduction ability of all the five algorithms is similar. Among them, the network loss of the ICSA algorithm is the same as that of the proposed method, which is 139.554&#xa0;KW, while the network loss of the other three methods is slightly higher but it can be maintained below 139.590&#xa0;KW. Therefore, compared with other algorithms, the fast reconfiguration method of distribution network based on CNN proposed in this paper improves the solution efficiency and reduces the system network loss at the same time.</p>
<p>In conclusion, there is no significant difference between online and offline data calculation speed of CNN model, while the influence of model loading time on the overall calculation speed can be diluted by increasing single input data amount in offline calculation. In addition, the precision of data-driven model needs a large amount of data support, while the meta-heuristic algorithm has little data requirements, which is more advantageous in the optimization and reconfiguration of new systems. Therefore, CNN model is more suitable for the scenarios of online real-time reconfiguration and mass reconfiguration of data operations.</p>
</sec>
<sec id="s4-2-2">
<title>4.2.2 Loss reduction effect analysis</title>
<p>In order to verify the effect of CNN model in loss reduction proposed in this paper, 190 groups of data in the validation set were extracted for prediction, and network loss and voltage level before and after reconfiguration were compared and predicted. <xref ref-type="fig" rid="F7">Figure 7A</xref> shows the comparison of network loss before and after reconfiguration.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Results and effects after DNR.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g007.tif"/>
</fig>
<p>According to <xref ref-type="fig" rid="F7">Figure 7A</xref>, compared with the topology before system reconfiguration, the topology optimized by CNN has lower network active power loss. According to the loss reduction percentage curve, in the test data, the average network loss of the system is reduced by 35.63% after network reconfiguration. The reason is that CNN&#x2019;s optimized re-selection of network open-loop points balances the power flow of each branch and reduces the active network loss of the system.</p>
</sec>
<sec id="s4-2-3">
<title>4.2.3 Analysis of improvement effect of voltage level</title>
<p>Further, in order to analyze the influence of CNN model proposed in this paper on voltage before and after reconfiguration. <xref ref-type="fig" rid="F8">Figures 8A,B</xref> respectively show the comparison diagram of bus minimum voltage and voltage range before and after system re-configuration. <xref ref-type="fig" rid="F7">Figure 7B</xref> shows the effect of the reconfiguration on the system voltage level.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Comparison of bus voltage.</p>
</caption>
<graphic xlink:href="fenrg-11-1102949-g008.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="F8">Figures 8A,B</xref> that the optimization of network bus voltage by CNN prediction topology is reflected in the increase of bus minimum voltage and the decrease of bus voltage range. According to <xref ref-type="fig" rid="F7">Figure 7B</xref>, in the test data, the voltage range decreased by 35.47% on average, and the minimum voltage of system buses increased by 1.76% on average. The reason is that CNN prediction topology optimizes the power flow of the system, reduces the voltage loss of each branch, reduces the voltage difference between buses, improves the power supply quality of the system, and contributes to the low-carbon economic operation of the distribution network.</p>
</sec>
<sec id="s4-2-4">
<title>4.2.4 185 bus system</title>
<p>In order to further verify the effectiveness of the fast reconfiguration method of low-carbon distribution network based on CNN in large-scale distribution systems, a 185-bus distribution system is taken as a test system. The system has 185 buses, 184 branches and 75 switches, including 20 tie switches and 55 segment switches. The parameters of DGs are shown in <xref ref-type="table" rid="T7">Table 7</xref>.</p>
<table-wrap id="T7" position="float">
<label>TABLE 7</label>
<caption>
<p>DG Configuration.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Bus</th>
<th align="center">Type</th>
<th align="center">Active power (MW)</th>
<th align="center">Power factor</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">140</td>
<td align="center">photovoltaic</td>
<td align="center">10</td>
<td align="center">0.8</td>
</tr>
<tr>
<td align="center">45</td>
<td align="center">photovoltaic</td>
<td align="center">1</td>
<td align="center">0.9</td>
</tr>
<tr>
<td align="center">7</td>
<td align="center">photovoltaic</td>
<td align="center">1</td>
<td align="center">0.8</td>
</tr>
<tr>
<td align="center">114</td>
<td align="center">photovoltaic</td>
<td align="center">1</td>
<td align="center">0.9</td>
</tr>
<tr>
<td align="center">18</td>
<td align="center">wind power</td>
<td align="center">0.5</td>
<td align="center">0.85</td>
</tr>
<tr>
<td align="center">52</td>
<td align="center">wind power</td>
<td align="center">0.5</td>
<td align="center">0.9</td>
</tr>
<tr>
<td align="center">181</td>
<td align="center">wind power</td>
<td align="center">0.4</td>
<td align="center">0.85</td>
</tr>
<tr>
<td align="center">145</td>
<td align="center">wind power</td>
<td align="center">0.4</td>
<td align="center">0.9</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The results of program running time are shown in <xref ref-type="table" rid="T8">Table 8</xref>. As can be seen, due to the complexity of the 185-bus test system, the CNN model requires additional parameters to describe the relationship between load patterns and reconfiguration strategies, resulting in model data loading times and mean times longer than the IEEE33 node system, ultimately increasing the solution time. However, even though the test system is more complex, the mean solution time of the proposed CNN model remains below 2.5&#xa0;ms and rapid reconfiguration is achieved.</p>
<table-wrap id="T8" position="float">
<label>TABLE 8</label>
<caption>
<p>185 bus system program running result.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Configuration</th>
<th rowspan="2" align="center">Amount of data</th>
<th rowspan="2" align="center">Running time (s)</th>
<th rowspan="2" align="center">Average time (ms)</th>
<th colspan="2" align="center">Model data loading</th>
</tr>
<tr>
<th align="center">Time(s)</th>
<th align="center">Account (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">a</td>
<td align="center">2,000</td>
<td align="center">81.03</td>
<td align="center">2.30</td>
<td align="center">76.41</td>
<td align="center">94.29</td>
</tr>
<tr>
<td align="center">b</td>
<td align="center">20,000</td>
<td align="center">121.81</td>
<td align="center">2.13</td>
<td align="center">76.41</td>
<td align="center">64.20</td>
</tr>
<tr>
<td align="center">c</td>
<td align="center">2,000</td>
<td align="center">4.62</td>
<td align="center">2.31</td>
<td align="center">&#x2013;</td>
<td align="center">&#x2013;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Running results of 185-bus system are shown in <xref ref-type="table" rid="T9">Table 9</xref>. It can been seen in <xref ref-type="table" rid="T9">Table 9</xref>, compared with the original network, CNN reduces the power loss by 22.86% while improving the lowest node voltage from 0.9253p.u. to 0.9508 p.u. As a result, the CNN method proposed in this paper also has good performance advantages in the 185-node system.</p>
<table-wrap id="T9" position="float">
<label>TABLE 9</label>
<caption>
<p>185 bus system program running time statistics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center"/>
<th align="center">Loss (kW)</th>
<th align="center">Lowest bus voltage (p.u.)</th>
<th align="center">Loss reduction rate (%)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Original network</td>
<td align="center">2843.20</td>
<td align="center">0.9253</td>
<td align="center">&#x2013;</td>
</tr>
<tr>
<td align="center">CNN model</td>
<td align="center">2193.13</td>
<td align="center">0.9508</td>
<td align="center">22.86</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>This paper proposes a power distribution network based on convolution neural network fast reconfiguration model, based on system load model and the corresponding optimization combination switch building data sets, using CNN to extract data collection of information, and to all the status of the network switch decisions, the last on IEEE33 bus system validation DNR performance of the proposed CNN model in this paper. Through the analysis of examples, the following conclusions are obtained:<list list-type="simple">
<list-item>
<p>(1) The CNN model based on Inception module has stronger feature extraction capability and better final training effect, and the resulting model has good generalization capability for validation sets.</p>
</list-item>
<list-item>
<p>(2) The CNN model constructed in this paper has an average decision speed of milli-second level, which is suitable for online fast reconfiguration and offline mass computation.</p>
</list-item>
<list-item>
<p>(3) The network topology predicted by the model can effectively improve the power supply quality and low-carbon operation economy of the distribution system.</p>
</list-item>
</list>
</p>
<p>Although the distribution network fast reconfiguration algorithm based on CNN proposed in this paper has excellent performance in static reconfiguration for a single period, the performance of this method in dynamic reconfiguration has not been verified. In the future research, the data-driven distribution network dynamic reconfiguration combined with the reconfiguration cycle division can be further studied, so as to realize the formulation of multi-period reconfiguration strategy.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<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 author.</p>
</sec>
<sec id="s7">
<title>Author contributions</title>
<p>All authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.</p>
</sec>
<sec id="s8">
<title>Funding</title>
<p>This work is supported by National Natural Science Foundation of China, 52107111 and Shandong Provincial Natural Science Foundation, ZR2022ME219, ZR2021QE117.</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<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="s10">
<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>Abrahamyan</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Bekoulis</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Deligiannis</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Learned gradient compression for distributed deep learning</article-title>. <source>IEEE Trans. neural Netw. Learn. Syst.</source> <volume>33</volume>, <fpage>7330</fpage>&#x2013;<lpage>7344</lpage>. <pub-id pub-id-type="doi">10.1109/tnnls.2021.3084806</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alavi</surname>
<given-names>A. S.</given-names>
</name>
<name>
<surname>Mehran</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Vahidinasab</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Catalao</surname>
<given-names>J. P. S.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Forecast-based consensus control for dc microgrids using distributed long short-term memory deep learning models</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>12</volume> (<issue>5</issue>), <fpage>3718</fpage>&#x2013;<lpage>3730</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2021.3070959</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bui</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Su</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Real-time operation of distribution network: A deep reinforcement learning-based reconfiguration approach</article-title>. <source>Sustain. Energy Technol. Assessments</source> <volume>2022</volume>, <fpage>101841</fpage>. <pub-id pub-id-type="doi">10.1016/j.seta.2021.101841</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Dai</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Research on an improved ant colony algorithm fusion with genetic algorithm for route planning</article-title>,&#x201d; in <conf-name>IEEE 4th information technology, networking, Electronic and Automation Control Conference (ITNEC)</conf-name>, <conf-loc>Chongqing, China</conf-loc>, <conf-date>12-14 June 2020</conf-date>, <fpage>1273</fpage>&#x2013;<lpage>1278</lpage>.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>DE Oliveira</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Costa</surname>
<given-names>M. G. F.</given-names>
</name>
<name>
<surname>Filho</surname>
<given-names>C. F. F. C.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Methodology of data fusion using deep learning for semantic segmentation of land types in the amazon</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>187864</fpage>&#x2013;<lpage>187875</lpage>. <pub-id pub-id-type="doi">10.1109/access.2020.3031533</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Hill</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Distribution network reconfiguration for short-term voltage stability enhancement: An efficient deep learning approach</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>12</volume> (<issue>6</issue>), <fpage>5385</fpage>&#x2013;<lpage>5395</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2021.3097330</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hussain</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Shakir</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Rasheed</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep learning approaches for impulse noise mitigation and classification in noma-based systems</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>143836</fpage>&#x2013;<lpage>143846</lpage>. <pub-id pub-id-type="doi">10.1109/access.2021.3121533</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jin</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Niu</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Reconfiguration of distribution network with wind power generators considering ran-domness and fuzziness</article-title>. <source>Proc. CSU-EPSA 2020</source> <volume>32</volume> (<issue>07</issue>), <fpage>67</fpage>&#x2013;<lpage>72</lpage>.</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ji</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>liu</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Real-time autonomous dynamic reconfiguration based on deep learning algorithm for distribution network</article-title>. <source>Electr. Power Syst. Res.</source> <volume>195</volume> (<issue>3</issue>), <fpage>107132</fpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2021.107132</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kim</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Ko</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Jung</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>1993</year>). <article-title>Artificial neural-network based feeder reconfiguration for loss reduction in distribution systems</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>8</volume> (<issue>3</issue>), <fpage>1356</fpage>&#x2013;<lpage>1366</lpage>. <pub-id pub-id-type="doi">10.1109/61.252662</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wei</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Dai</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Combination of manifold learning and deep learning algorithms for mid-term electrical load forecasting</article-title>. <source>IEEE Trans. Neural Netw. Learn. Syst.</source> <volume>2021</volume>, <fpage>1</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2021.3106968</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A distributed double-Newton descent algorithm for cooperative energy management of multiple energy bodies in energy internet</article-title>. <source>IEEE Trans. Industrial Inf.</source> <volume>17</volume> (<issue>9</issue>), <fpage>5993</fpage>&#x2013;<lpage>6003</lpage>. <pub-id pub-id-type="doi">10.1109/tii.2020.3029974</pub-id>
</citation>
</ref>
<ref id="B13">
<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>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gooi</surname>
<given-names>H. B.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>Deep learning based densely connected network for load forecasting</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>36</volume> (<issue>4</issue>), <fpage>2829</fpage>&#x2013;<lpage>2840</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrs.2020.3048359</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>Wu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021b</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>, <fpage>3914</fpage>&#x2013;<lpage>3927</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2021.3080312</pub-id>
</citation>
</ref>
<ref id="B15">
<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>Feng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Optimal stochastic deployment of heterogeneous energy storage in a residential multienergy microgrid with demand-side management</article-title>. <source>IEEE Trans. Ind. Inf.</source> <volume>17</volume>, <fpage>991</fpage>&#x2013;<lpage>1004</lpage>. <pub-id pub-id-type="doi">10.1109/tii.2020.2971227</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Malekshah</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Rasouli</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Malekshah</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ramezani</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Malekshah</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Reliability-driven distribution power network dynamic reconfiguration in presence of distributed generation by the deep reinforcement learning method</article-title>. <source>Alexandria Eng. J.</source> <volume>61</volume> (<issue>8</issue>), <fpage>6541</fpage>&#x2013;<lpage>6556</lpage>. <pub-id pub-id-type="doi">10.1016/j.aej.2021.12.012</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Oh</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Yoon</surname>
<given-names>Y. T.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>S. W.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Online reconfiguration scheme of self-sufficient distribution network based on a reinforcement learning approach</article-title>. <source>Appl. Energy</source> <volume>280</volume>, <fpage>115900</fpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2020.115900</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ozcanli</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Yaprakdal</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Baysal</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Deep learning meth-ods and applications for electrical power systems: A com-prehensive review</article-title>. <source>Int. J. Energy Re-search</source> <volume>44</volume> (<issue>9</issue>), <fpage>7136</fpage>&#x2013;<lpage>7157</lpage>. <pub-id pub-id-type="doi">10.1002/er.5331</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pegado</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>&#xd1;aupari</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Molina</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Castillo</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Radial distribution network reconfiguration for power losses reduction based on improved selective BPSO</article-title>. <source>Electr. Power Syst. Res.</source> <volume>169</volume>, <fpage>206</fpage>&#x2013;<lpage>213</lpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2018.12.030</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Prasad</surname>
<given-names>P. S.</given-names>
</name>
<name>
<surname>Sushama</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>Distribution network reconfiguration and capacitor allocation in distribution system using discrete improved grey wolf optimization</article-title>,&#x201d; in <source>Innovations in electrical and electronic engineering. ICEEE 2022</source>. Editors <person-group person-group-type="editor">
<name>
<surname>Mekhilef</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Shaw</surname>
<given-names>R. N.</given-names>
</name>
<name>
<surname>Siano</surname>
<given-names>P.</given-names>
</name>
</person-group> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>). <comment>Lecture Notes in Electrical Engineering</comment>.</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Qing</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Nan</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>W.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Low-carbon coordinated scheduling of integrated electricity-gas distribution system with hybrid AC/DC network</article-title>. <source>IET Renew. Power Gener.</source> <volume>16</volume>, <fpage>2566</fpage>&#x2013;<lpage>2578</lpage>. <pub-id pub-id-type="doi">10.1049/rpg2.12439</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Szegedy</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Vanhoucke</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Ioffe</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>Rethinking the inception architecture for computer vision</article-title>,&#x201d; in <conf-name>Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition</conf-name>, <conf-loc>Las Vegas, NV, USA</conf-loc>, <conf-date>27-30 June 2016</conf-date>, <fpage>2818</fpage>&#x2013;<lpage>2826</lpage>.</citation>
</ref>
<ref id="B23">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Talukdar</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Deka</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Goswami</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Saha</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Reconfiguration of radial distribution network implementing tlbo algorithm for loss minimization and reliability improvement</article-title>,&#x201d; in <source>
<italic>Intelligent Techniques and Applications in Science and technology.</italic> ICIMSAT 2019</source>. Editors <person-group person-group-type="editor">
<name>
<surname>Dawn</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Balas</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Esposito</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gope</surname>
<given-names>S.</given-names>
</name>
</person-group> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>). <comment>Learning and Analytics in Intelligent Systems</comment>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Bao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Di</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Distribution network reconfiguration based on noisynet deep Q-learning network</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>90358</fpage>&#x2013;<lpage>90365</lpage>. <pub-id pub-id-type="doi">10.1109/access.2021.3089625</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Lei</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ju</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Ch.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>C. Y.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>MDP-based distribution network reconfiguration with renewable distributed generation: Approximate dynamic programming approach</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>11</volume> (<issue>4</issue>), <fpage>3620</fpage>&#x2013;<lpage>3631</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2019.2963696</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A chaos disturbed beetle antennae search algorithm for a multiobjective distribution network reconfiguration considering the variation of load and DG</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>97392</fpage>&#x2013;<lpage>97407</lpage>. <pub-id pub-id-type="doi">10.1109/access.2020.2997378</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021a</year>). &#x201c;<article-title>Hybrid multi-objective particle swarm optimization algorithm based on particle sorting</article-title>,&#x201d; in <conf-name>IEEE International Conference on Emergency Science and Information Technology (ICESIT)</conf-name>, <conf-loc>Chongqing, China</conf-loc>, <conf-date>22-24 November 2021</conf-date>, <fpage>257</fpage>&#x2013;<lpage>260</lpage>.</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2021b</year>). <article-title>Detection and location of aged cable segment in underground power distribution system using deep learning approach</article-title>. <source>IEEE Trans. Industrial Inf.</source> <volume>17</volume> (<issue>11</issue>), <fpage>7379</fpage>&#x2013;<lpage>7389</lpage>. <pub-id pub-id-type="doi">10.1109/tii.2021.3056993</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Qin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Juang</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Deep learning enabled semantic communication systems</article-title>. <source>IEEE Trans. Signal Process.</source> <volume>69</volume>, <fpage>2663</fpage>&#x2013;<lpage>2675</lpage>. <pub-id pub-id-type="doi">10.1109/tsp.2021.3071210</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>George</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Qin</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Yi</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Distributed least squares solver for network linear equations</article-title>. <source>Automatica</source> <volume>113</volume>, <fpage>108798</fpage>. <pub-id pub-id-type="doi">10.1016/j.automatica.2019.108798</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yi</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Reactive power optimization and reconfiguration of distribution network based on improved gsa algorithm</article-title>. <source>IEEE/IAS Industrial Commer. Power Syst. Asia (I&#x26;CPS Asia)</source> <volume>2021</volume>, <fpage>674</fpage>&#x2013;<lpage>679</lpage>.</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Ji</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Bai</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Data-driven approach for re-al-time distribution network reconfiguration</article-title>. <source>IET Gen-eration, Transm. Distribution</source> <volume>14</volume> (<issue>13</issue>), <fpage>2450</fpage>&#x2013;<lpage>2463</lpage>. <pub-id pub-id-type="doi">10.1049/iet-gtd.2019.1733</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zainab</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ghrayeb</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Syed</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Abu-Rub</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Refaat</surname>
<given-names>S. S.</given-names>
</name>
<name>
<surname>Bouhali</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Big data management in smart grids: Technologies and challenges</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>73046</fpage>&#x2013;<lpage>73059</lpage>. <pub-id pub-id-type="doi">10.1109/access.2021.3080433</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhan</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Chung</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Switch opening and exchange method for stochastic distribution network re-configuration</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>11</volume> (<issue>4</issue>), <fpage>2995</fpage>&#x2013;<lpage>3007</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2020.2974922</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Event-triggered distributed hybrid control scheme for the integrated energy system</article-title>. <source>IEEE Trans. Industrial Inf.</source> <volume>2022</volume> (<issue>18-2</issue>), <fpage>835</fpage>&#x2013;<lpage>846</lpage>. <pub-id pub-id-type="doi">10.1109/tii.2021.3075718</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhe</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Jing</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Xi</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Tao</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Reliability analysis of distribution network operation based on short-term future big data technology</article-title>. <source>J. Phys. Conf. Ser.</source> <volume>2020</volume> (<issue>1</issue>), <fpage>012027</fpage>. <pub-id pub-id-type="doi">10.1088/1742-6596/1584/1/012027</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zheng</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Hill</surname>
<given-names>D. J.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>An adaptive distributionally robust model for three-phase distribution network reconfiguration</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>12</volume> (<issue>2</issue>), <fpage>1224</fpage>&#x2013;<lpage>1237</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2020.3030299</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zheng</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Hill</surname>
<given-names>D. J.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>An adaptive distributionally robust model for three-phase distribution network reconfiguration</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>12</volume> (<issue>2</issue>), <fpage>1224</fpage>&#x2013;<lpage>1237</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2020.3030299</pub-id>
</citation>
</ref>
</ref-list>
<sec id="s11">
<title>Nomenclature</title>
<sec>
<title>Sets</title>
<def-list>
<def-item>
<term id="G1-fenrg.2023.1102949">
<inline-formula id="inf14">
<mml:math id="m31">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold">O</mml:mi>
<mml:mtext mathvariant="bold">con</mml:mtext>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Final output of the network</p>
</def>
</def-item>
<def-item>
<term id="G2-fenrg.2023.1102949">
<inline-formula id="inf15">
<mml:math id="m32">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold">&#x39f;</mml:mi>
<mml:mi mathvariant="bold-italic">l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Model output of loop <italic>l</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G3-fenrg.2023.1102949">
<inline-formula id="inf16">
<mml:math id="m33">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">L</mml:mi>
<mml:mi mathvariant="bold-italic">c</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Calculated loss of the model</p>
</def>
</def-item>
<def-item>
<term id="G4-fenrg.2023.1102949">
<inline-formula id="inf17">
<mml:math id="m34">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">L</mml:mi>
<mml:mi mathvariant="bold-italic">l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Loss value returned by submodel <italic>l</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G5-fenrg.2023.1102949">
<inline-formula id="inf18">
<mml:math id="m35">
<mml:mrow>
<mml:mi mathvariant="bold">&#x39b;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Parameter matrix</p>
</def>
</def-item>
<def-item>
<term id="G6-fenrg.2023.1102949">
<inline-formula id="inf19">
<mml:math id="m36">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">C</mml:mi>
<mml:mi mathvariant="bold-italic">h</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The <italic>h</italic>-th switch configuration scheme of the system</p>
</def>
</def-item>
</def-list>
</sec>
<sec>
<title>Parameters</title>
<def-list>
<def-item>
<term id="G7-fenrg.2023.1102949">
<inline-formula id="inf20">
<mml:math id="m37">
<mml:mrow>
<mml:mi mathvariant="bold-italic">c</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Total number of categories</p>
</def>
</def-item>
<def-item>
<term id="G8-fenrg.2023.1102949">
<inline-formula id="inf21">
<mml:math id="m38">
<mml:mrow>
<mml:mi mathvariant="bold-italic">k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Number of batch samples</p>
</def>
</def-item>
<def-item>
<term id="G9-fenrg.2023.1102949">
<inline-formula id="inf22">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">y</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The true probability of sample <inline-formula id="inf23">
<mml:math id="m40">
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> on classification <inline-formula id="inf24">
<mml:math id="m41">
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G10-fenrg.2023.1102949">
<inline-formula id="inf25">
<mml:math id="m42">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x3b1;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Learning rate</p>
</def>
</def-item>
<def-item>
<term id="G11-fenrg.2023.1102949">
<inline-formula id="inf26">
<mml:math id="m43">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3b2;</mml:mi>
<mml:mn mathvariant="bold">1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf27">
<mml:math id="m44">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3b2;</mml:mi>
<mml:mn mathvariant="bold">2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The exponential decay rates of the first and second moments respectively</p>
</def>
</def-item>
<def-item>
<term id="G12-fenrg.2023.1102949">
<inline-formula id="inf28">
<mml:math id="m45">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold">c</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Gradient of loss value</p>
</def>
</def-item>
<def-item>
<term id="G13-fenrg.2023.1102949">
<inline-formula id="inf29">
<mml:math id="m46">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">L</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
<mml:mi mathvariant="bold">c</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>To weight <inline-formula id="inf30">
<mml:math id="m47">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x3b8;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G14-fenrg.2023.1102949">
<bold>LM</bold>
</term>
<def>
<p>The number of load modes</p>
</def>
</def-item>
<def-item>
<term id="G15-fenrg.2023.1102949">
<inline-formula id="inf31">
<mml:math id="m48">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">N</mml:mi>
<mml:mi mathvariant="bold-italic">b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Total number of system branches</p>
</def>
</def-item>
<def-item>
<term id="G16-fenrg.2023.1102949">
<inline-formula id="inf32">
<mml:math id="m49">
<mml:mrow>
<mml:mi mathvariant="bold">&#x393;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Set of all connected network structures</p>
</def>
</def-item>
<def-item>
<term id="G17-fenrg.2023.1102949">
<inline-formula id="inf33">
<mml:math id="m50">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mi mathvariant="bold">min</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf34">
<mml:math id="m51">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mi mathvariant="bold">max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The lower and upper voltage limits of bus <italic>i</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G18-fenrg.2023.1102949">
<inline-formula id="inf35">
<mml:math id="m52">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">S</mml:mi>
<mml:mi mathvariant="bold-italic">b</mml:mi>
<mml:mi mathvariant="bold">max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The upper limit of branch <italic>b</italic> capacity</p>
</def>
</def-item>
<def-item>
<term id="G19-fenrg.2023.1102949">
<bold>
<italic>N</italic>
</bold>
</term>
<def>
<p>Total number of buses in the system</p>
</def>
</def-item>
<def-item>
<term id="G20-fenrg.2023.1102949">
<inline-formula id="inf36">
<mml:math id="m53">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">H</mml:mi>
<mml:mrow>
<mml:mn mathvariant="bold">1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">h</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf37">
<mml:math id="m54">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">H</mml:mi>
<mml:mrow>
<mml:mn mathvariant="bold">2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">h</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf38">
<mml:math id="m55">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">H</mml:mi>
<mml:mrow>
<mml:mn mathvariant="bold">3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">h</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The one-hot codes of loops 1, 2, and 3</p>
</def>
</def-item>
</def-list>
</sec>
<sec>
<title>Variables</title>
<def-list>
<def-item>
<term id="G21-fenrg.2023.1102949">
<inline-formula id="inf39">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">Z</mml:mi>
<mml:mi mathvariant="bold-italic">&#x3b7;</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Output of neuron <inline-formula id="inf40">
<mml:math id="m57">
<mml:mrow>
<mml:mi>&#x3b7;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G22-fenrg.2023.1102949">
<inline-formula id="inf41">
<mml:math id="m58">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">z</mml:mi>
<mml:mi mathvariant="bold-italic">&#x3b7;</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Input of neuron <inline-formula id="inf42">
<mml:math id="m59">
<mml:mrow>
<mml:mi>&#x3b7;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G23-fenrg.2023.1102949">
<inline-formula id="inf43">
<mml:math id="m60">
<mml:mrow>
<mml:mi mathvariant="bold-italic">L</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x3b8;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Model loss under weight <inline-formula id="inf44">
<mml:math id="m61">
<mml:mrow>
<mml:mi>&#x3b8;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G24-fenrg.2023.1102949">
<inline-formula id="inf45">
<mml:math id="m62">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Time step</p>
</def>
</def-item>
<def-item>
<term id="G25-fenrg.2023.1102949">
<inline-formula id="inf46">
<mml:math id="m63">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Gradient of <inline-formula id="inf47">
<mml:math id="m64">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> with respect to <inline-formula id="inf48">
<mml:math id="m65">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G26-fenrg.2023.1102949">
<inline-formula id="inf49">
<mml:math id="m66">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">m</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The correction of the first moment estimation of gradient <inline-formula id="inf50">
<mml:math id="m67">
<mml:mrow>
<mml:msub>
<mml:mi>m</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G27-fenrg.2023.1102949">
<inline-formula id="inf51">
<mml:math id="m68">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi mathvariant="bold-italic">v</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The correction of the second moment estimation of gradient <inline-formula id="inf52">
<mml:math id="m69">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G28-fenrg.2023.1102949">
<inline-formula id="inf53">
<mml:math id="m70">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">E</mml:mi>
<mml:mtext mathvariant="bold">set</mml:mtext>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The default value of the training cycle</p>
</def>
</def-item>
<def-item>
<term id="G29-fenrg.2023.1102949">
<inline-formula id="inf54">
<mml:math id="m71">
<mml:mrow>
<mml:mi mathvariant="bold-italic">E</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The predicted loss under the current training cycle</p>
</def>
</def-item>
<def-item>
<term id="G30-fenrg.2023.1102949">
<inline-formula id="inf55">
<mml:math id="m72">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">L</mml:mi>
<mml:mi mathvariant="bold-italic">E</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Binary variable gas turbines start up</p>
</def>
</def-item>
<def-item>
<term id="G31-fenrg.2023.1102949">
<inline-formula id="inf56">
<mml:math id="m73">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">E</mml:mi>
<mml:mi mathvariant="bold">lim</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The cycle limit of the callback function</p>
</def>
</def-item>
<def-item>
<term id="G32-fenrg.2023.1102949">
<inline-formula id="inf57">
<mml:math id="m74">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">K</mml:mi>
<mml:mi mathvariant="bold-italic">b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The 0&#x2013;1 variable representing the open state of branch <inline-formula id="inf58">
<mml:math id="m75">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G33-fenrg.2023.1102949">
<inline-formula id="inf59">
<mml:math id="m76">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">R</mml:mi>
<mml:mi mathvariant="bold-italic">b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The resistance of branch <inline-formula id="inf60">
<mml:math id="m77">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G34-fenrg.2023.1102949">
<inline-formula id="inf61">
<mml:math id="m78">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">I</mml:mi>
<mml:mi mathvariant="bold-italic">b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The current flowing through the branch</p>
</def>
</def-item>
<def-item>
<term id="G35-fenrg.2023.1102949">
<inline-formula id="inf62">
<mml:math id="m79">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x3c6;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Network structure obtained through reconfiguration</p>
</def>
</def-item>
<def-item>
<term id="G36-fenrg.2023.1102949">
<inline-formula id="inf63">
<mml:math id="m80">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf64">
<mml:math id="m81">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">Q</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The injected active power and reactive power of bus <italic>i</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G37-fenrg.2023.1102949">
<inline-formula id="inf65">
<mml:math id="m82">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mtext mathvariant="bold">DG</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf66">
<mml:math id="m83">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">Q</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mtext mathvariant="bold">DG</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The active power and reactive power injected by DG into bus <inline-formula id="inf67">
<mml:math id="m84">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> respectively</p>
</def>
</def-item>
<def-item>
<term id="G38-fenrg.2023.1102949">
<inline-formula id="inf68">
<mml:math id="m85">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf69">
<mml:math id="m86">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mi mathvariant="bold-italic">j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The voltages of buses <inline-formula id="inf70">
<mml:math id="m87">
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf71">
<mml:math id="m88">
<mml:mrow>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> respectively</p>
</def>
</def-item>
<def-item>
<term id="G39-fenrg.2023.1102949">
<inline-formula id="inf72">
<mml:math id="m89">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">G</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mi mathvariant="bold-italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf73">
<mml:math id="m90">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">B</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mi mathvariant="bold-italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf74">
<mml:math id="m91">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3b4;</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mi mathvariant="bold-italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>The conductance, susceptance and phase Angle difference between <inline-formula id="inf75">
<mml:math id="m92">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> buses respectively</p>
</def>
</def-item>
<def-item>
<term id="G40-fenrg.2023.1102949">
<inline-formula id="inf76">
<mml:math id="m93">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">S</mml:mi>
<mml:mi mathvariant="bold-italic">b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Apparent power of branch <italic>b</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G41-fenrg.2023.1102949">
<inline-formula id="inf77">
<mml:math id="m94">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">F</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mtext mathvariant="bold">DG</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>DG access status of bus <italic>i</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G42-fenrg.2023.1102949">
<inline-formula id="inf78">
<mml:math id="m95">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mtext mathvariant="bold">DG</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Active output of bus <italic>i</italic> access DG</p>
</def>
</def-item>
<def-item>
<term id="G43-fenrg.2023.1102949">
<inline-formula id="inf79">
<mml:math id="m96">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">V</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mtext mathvariant="bold">PV</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Voltage unit value of PV type DG</p>
</def>
</def-item>
<def-item>
<term id="G44-fenrg.2023.1102949">
<inline-formula id="inf80">
<mml:math id="m97">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">I</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mtext mathvariant="bold">PI</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Current unit value of PI type DG</p>
</def>
</def-item>
<def-item>
<term id="G45-fenrg.2023.1102949">
<inline-formula id="inf81">
<mml:math id="m98">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">T</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mtext mathvariant="bold">DG</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>DG type of A-Bus <italic>i</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G46-fenrg.2023.1102949">
<inline-formula id="inf82">
<mml:math id="m99">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">P</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mi mathvariant="bold">L</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>/<inline-formula id="inf83">
<mml:math id="m100">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">Q</mml:mi>
<mml:mi mathvariant="bold-italic">i</mml:mi>
<mml:mi mathvariant="bold">L</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Load active and reactive power of bus <italic>i</italic> respectively</p>
</def>
</def-item>
<def-item>
<term id="G47-fenrg.2023.1102949">
<inline-formula id="inf84">
<mml:math id="m101">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold">&#x391;</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>row <italic>a</italic> of model input matrix <italic>A</italic>
</p>
</def>
</def-item>
<def-item>
<term id="G48-fenrg.2023.1102949">
<inline-formula id="inf85">
<mml:math id="m102">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold">&#x39b;</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>row <italic>a</italic> of parameter matrix <inline-formula id="inf86">
<mml:math id="m103">
<mml:mrow>
<mml:mi mathvariant="bold">&#x39b;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
<def-item>
<term id="G49-fenrg.2023.1102949">
<inline-formula id="inf87">
<mml:math id="m104">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x3bb;</mml:mi>
<mml:mi mathvariant="bold-italic">a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</term>
<def>
<p>Maximum number of elements in <inline-formula id="inf88">
<mml:math id="m105">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold">&#x39b;</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</def>
</def-item>
</def-list>
</sec>
</sec>
</back>
</article>