<?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">864914</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2022.864914</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>Integrated Optimal Planning of Distribution Network With Geographical-Zone-Restricted Renewable Energy Sources</article-title>
<alt-title alt-title-type="left-running-head">Qing et al.</alt-title>
<alt-title alt-title-type="right-running-head">Network Planning With Geographical Restrictions</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Qing</surname>
<given-names>Ke</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1633043/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Huang</surname>
<given-names>Qi</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Du</surname>
<given-names>Yuefang</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/1438659/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Sichuan Provincial Key Lab Science and Technology of China</institution>, <institution>University of Electronic Science and Technology of China</institution>, <addr-line>Chengdu</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>College of Nuclear Technology and Automation Engineering</institution>, <institution>Chengdu University of Technology</institution>, <addr-line>Chengdu</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/295337/overview">Sheila Samsatli</ext-link>, University of Bath, United Kingdom</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/1666539/overview">Jiakun Fang</ext-link>, Huazhong University of Science and Technology, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1281546/overview">Qi Zhu</ext-link>, Xi&#x2019;an Shiyou University, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Yuefang Du, <email>yuefangdu@hotmail.com</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>04</day>
<month>04</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>10</volume>
<elocation-id>864914</elocation-id>
<history>
<date date-type="received">
<day>29</day>
<month>01</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>11</day>
<month>03</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2022 Qing, Huang and Du.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Qing, Huang and Du</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>Recently, a lot of renewable energy sources have been integrated into the distribution network. In consideration of economy and construction feasibility, some renewable energy sources are required to be installed in specific areas. In this paper, a bi-layer distribution network planning optimization model that considers the geographical restrictions of the installation locations of the substation, pumped storage plant, photovoltaic (PV) and wind power, as well as the impact of operation on planning, is proposed. In the planning optimization layer, the optimal distribution network topology with minimal total cost is obtained. The locations of the renewable energy sources and the substation are determined by the particle swarm optimization (PSO), and then all the components are interconnected using the dynamic minimum spanning tree (DMST) method. In the operation optimization layer, the economic operation strategy of the hybrid energy system with uncertainty is obtained by the scenario-based stochastic optimal power flow (OPF). The forecast error of the uncertain variable is represented by the probability distribution function, and the roulette wheel mechanism (RWM) is used to generate the stochastic scenarios. A modified 103-bus system is used to test the effectiveness of the proposed method, and the simulation results show that the proposed method can effectively reduce the total cost of the distribution network.</p>
</abstract>
<kwd-group>
<kwd>distribution network planning</kwd>
<kwd>renewable energy</kwd>
<kwd>particle swarm optimization</kwd>
<kwd>dynamic minimum spanning tree</kwd>
<kwd>net present value</kwd>
<kwd>geographical constraints</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>With the shortage of fossil energy and the increasingly serious environmental pollution problems, renewable energy sources such as photovoltaic (PV) and wind power have been developed rapidly in recent years (<xref ref-type="bibr" rid="B10">Chen et al., 2021</xref>; <xref ref-type="bibr" rid="B16">Hu et al., 2021</xref>; <xref ref-type="bibr" rid="B29">Mohandes et al., 2021</xref>). The installation location of the renewable energy is affected by geographical conditions. In order to achieve maximum economic benefits, PV power stations are usually installed in areas with high illumination intensity, and wind farms are built in places with sufficient wind energy (<xref ref-type="bibr" rid="B15">Hou et al., 2016</xref>; <xref ref-type="bibr" rid="B23">Li et al., 2020</xref>; <xref ref-type="bibr" rid="B25">Marcochi de Melo et al., 2021</xref>). To easily obtain water sources and build upstream reservoirs, pumped storage plants are generally built near rivers in mountainous areas. However, there lacks effective methods to handle such cases at present. It is necessary to find a cost-effective approach for distribution network planning that takes into account geographical constraints.</p>
<p>The optimization of distribution network planning and operation is an intensively studied topic in power engineering (<xref ref-type="bibr" rid="B4">Baringo et al., 2020</xref>; <xref ref-type="bibr" rid="B27">MohammadiFathabad et al., 2020</xref>; <xref ref-type="bibr" rid="B37">Ugranl&#x131;, 2020</xref>). The traditional distribution network contains transmission, substation, distribution and power equipment (<xref ref-type="bibr" rid="B19">Khator and Leung, 1997</xref>). In reference (<xref ref-type="bibr" rid="B7">Carrano et al., 2006</xref>), there is only traditional power equipment and no distributed generation devices in the distribution network. The planning of this distribution system is to optimize the connection of cables with the highest economic benefits and system reliability. With the integration of a large number of distributed energy equipment such as wind power, PV, energy storage equipment, new planning approaches need to be explored for the modern distribution network to improve the economic efficiency and determine the scheduling of newly connected renewable power generation equipment (<xref ref-type="bibr" rid="B11">Ding et al., 2012</xref>; (<xref ref-type="bibr" rid="B38">Wang et al., 2014</xref>). With the knowledge of the pumped storage capacity and wind speed, the generating/pumping power of the pumped storage and output power of wind farm are optimized in (<xref ref-type="bibr" rid="B11">Ding et al., 2012</xref>) to minimize the operation cost of distribution network. In the work of (<xref ref-type="bibr" rid="B38">Wang et al., 2014</xref>), a robust optimization problem is formulated to optimize the location and the size of the distribution generation to minimize microgrid costs.</p>
<p>Traditionally, the planning optimization and operation optimization of the distribution network are independently executed, and the operation optimization is carried out after the planning optimization. When renewable energy sources or energy storage equipment are connected to the distribution network, the operation mode of these equipment will affect the transmission losses of the grid and operation mode of the equipment (<xref ref-type="bibr" rid="B2">Ashoornezhad et al., 2021</xref>; <xref ref-type="bibr" rid="B20">Koutsoukis and Georgilakis, 2022</xref>; <xref ref-type="bibr" rid="B26">Mejia et al., 2022</xref>). Therefore, the traditional separated planning method cannot guarantee optimal results. It is imperative to combine the planning optimization and operation optimization together for better performance (<xref ref-type="bibr" rid="B6">Carpinelli et al., 2013</xref>; <xref ref-type="bibr" rid="B33">Sedghi et al., 2016</xref>; <xref ref-type="bibr" rid="B35">Tang and Low, 2017</xref>; <xref ref-type="bibr" rid="B9">Celli et al., 2018</xref>; <xref ref-type="bibr" rid="B22">Lazzeroni and Repetto, 2019</xref>). In (<xref ref-type="bibr" rid="B22">Lazzeroni and Repetto, 2019</xref>), the size and location of the battery are optimized to reduce the power loss. A battery planning optimization framework to improve wind power penetration, in which the optimal placement and daily scheduling of energy storage strategies are optimized, is proposed in (<xref ref-type="bibr" rid="B14">Ghofrani et al., 2013</xref>). To improve the voltage profile, reliability and economic benefits of the distribution network, a comprehensive strategic model is proposed to plan the location and size of photovoltaic, battery storage and distributed static compensator (<xref ref-type="bibr" rid="B32">Roy Ghatak et al., 2018</xref>). The authors in (<xref ref-type="bibr" rid="B1">Arasteh et al., 2016</xref>) presented a bi-level optimization model for distribution network. This model considered the distribution network reconfiguration and the demand response. However, the location and capacity of distributed devices are not optimized in this article. In (<xref ref-type="bibr" rid="B40">Zhang et al., 2013</xref>), the optimal pumped storage capacity is found by a multi-scenario approach aiming to reduce the operation cost of the distribution network and wind power curtailments. However, the network loss is not considered. There are also many researches on the expansion planning of distribution networks (<xref ref-type="bibr" rid="B31">Ouyang et al., 2010</xref>; <xref ref-type="bibr" rid="B13">Ganguly et al., 2013</xref>; <xref ref-type="bibr" rid="B42">Ziari et al., 2013</xref>; <xref ref-type="bibr" rid="B21">Koutsoukis et al., 20142014</xref>; <xref ref-type="bibr" rid="B30">Mu&#xf1;oz-Delgado et al., 2016</xref>), including the planning of new cables, substations, distributed generation equipment and energy storage equipment, etc. In (<xref ref-type="bibr" rid="B36">Tar&#xf4;co et al., 2016</xref>), the allocation of the substations, distributed generation units, and the topology of distribution network are formulated as a multi-objective optimization to reduce the cost and improve the system reliability. A multi-stage expansion planning problem considering the load growth is formulated in (<xref ref-type="bibr" rid="B34">Sedghi et al., 2013</xref>), and is solved by a modified particle swarm optimization (PSO) algorithm. This expansion planning problem is divided into four stages. At each stage, new substations, main and reserve feeders, energy storage units and distribution generators will be installed into the existing distribution network. However, the geographical constraints of storage units and distributed generation equipment are not considered, i.e., those components can be installed on any existing node. The work in (<xref ref-type="bibr" rid="B39">Xing et al., 2016</xref>) presented an expansion planning model of the distribution network considering the allocation of the new cable, substation and distributed generator. The optimization model is formulated as a mixed integer non-linear programming problem, which is solve by a second-order cone programming method. However, the locations of the substation and distributed generation are limited to a few pre-selected nodes.</p>
<p>This paper proposes a bi-layer integrated planning approach for the distribution network. Geographical location constraints are considered in the distribution network optimization model. The proposed optimization model combines the planning and operation optimization of distribution network to reduce the total cost of the distribution network. The uncertainty of the load, illumination intensity, wind speed and electricity price is modeled by the probability distribution function, and the roulette wheel mechanism (RWM) is adopted to generate the stochastic scenarios. In the planning layer, an effective PSO-based method is adopted to determine the locations of the substation, pumped storage plant, PV and WT, then a DMST method is used to connect all the components with minimal cable cost. In the operation layer, the optimal operation strategy is obtained based on the topology determined in the planning layer.</p>
<p>The rest of this paper is organized as follows. The problem formulation is presented in <xref ref-type="sec" rid="s2">Section 2</xref>. The solution approach of the optimization problem is given in <xref ref-type="sec" rid="s3">Section 3</xref>. The case study and conclusions are presented in <xref ref-type="sec" rid="s4">Section 4</xref> and <xref ref-type="sec" rid="s5">Section 5</xref>, respectively.</p>
</sec>
<sec id="s2">
<title>2 Problem Formulation</title>
<p>A diagram of a modern distribution network with renewable energy sources, such as wind turbine (WT), PV and pumped storage plant, is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. Unlike traditional power generation equipment, these renewable energy sources are environmentally friendly, but they have strict requirements on the location of the construction.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Diagram of distribution network integrated planning problem.</p>
</caption>
<graphic xlink:href="fenrg-10-864914-g001.tif"/>
</fig>
<p>In this study, an integrated optimal planning model of distribution network with geographical location constraints is formulated. The objective of distribution network planning optimization is to find the most cost-effective layout and dispatch strategy of the distribution network. The optimization problem is divided into two layers, i.e., integrated planning optimization and embedded operation optimization layer. In the integrated planning optimization layer, the locations of substation, pumped storage plant, PV, WT, pumped storage plant and the connection layout of all components are optimized to obtain the optimal distribution network topology. The embedded operation optimization is to schedule the pumped storage plant power to minimize the operation cost of the distribution system under the topology obtained from the integrated planning optimization layer.</p>
<sec id="s2-1">
<title>2.1 Integrated planning optimization layer: minimize the total cost of the distribution network</title>
<p>The net present value (NPV) (<xref ref-type="bibr" rid="B17">Huang et al., 2020</xref>) of the total cost of distribution network operators in the planning years, that is, the sum of the cable cost and the distribution network operation cost, is taken as the objective function:<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>N</mml:mi>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>where<disp-formula id="e2">
<mml:math id="m2">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
<inline-formula id="inf1">
<mml:math id="m3">
<mml:mrow>
<mml:mtext>Here</mml:mtext>
</mml:mrow>
</mml:math>
</inline-formula> <inline-formula id="inf2">
<mml:math id="m4">
<mml:mi>F</mml:mi>
</mml:math>
</inline-formula> represents the objective function value. <inline-formula id="inf3">
<mml:math id="m5">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the total NPV of the cable cost. <inline-formula id="inf4">
<mml:math id="m6">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the total NPV of the distribution network operation cost. <inline-formula id="inf5">
<mml:math id="m7">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is a vector which represents the locations of the substation, pumped storage plant, PV and WT. <inline-formula id="inf6">
<mml:math id="m8">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf7">
<mml:math id="m9">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represent the abscissa and ordinate coordinates of <inline-formula id="inf8">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf9">
<mml:math id="m11">
<mml:mi>A</mml:mi>
</mml:math>
</inline-formula> represents a restriction zone where components can be installed. In this study, two types of restriction zones are considered, i.e., rectangle and parallelogram. Based on the actual situation, the construction locations of the substation, PV and WT are set as a rectangular area. According to the shape of the river, the construction location of the pumped storage is set as a parallelogram area. For rectangular areas, the construction locations can be expressed as the limitations of x coordinate and y coordinate, respectively. The geographical constraints for rectangular areas are presented as<disp-formula id="e3">
<mml:math id="m12">
<mml:mrow>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
<disp-formula id="e4">
<mml:math id="m13">
<mml:mrow>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>where <inline-formula id="inf10">
<mml:math id="m14">
<mml:mrow>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf11">
<mml:math id="m15">
<mml:mrow>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> indicate the lower and upper limits of the <inline-formula id="inf12">
<mml:math id="m16">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf13">
<mml:math id="m17">
<mml:mrow>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf14">
<mml:math id="m18">
<mml:mrow>
<mml:msubsup>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> indicate the lower and upper limits of the <inline-formula id="inf15">
<mml:math id="m19">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, respectively. For parallelogram areas, the construction locations can be expressed as the limitations of x coordinate and y coordinate, respectively, and a limitation between the x coordinate and the y coordinate. It can be presented as a combination of <xref ref-type="disp-formula" rid="e3">Eqs 3</xref>, <xref ref-type="disp-formula" rid="e4">4</xref>, <xref ref-type="disp-formula" rid="e5">5</xref>.<disp-formula id="e5">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>where <inline-formula id="inf16">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf17">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf18">
<mml:math id="m23">
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
<italic>,</italic> <inline-formula id="inf19">
<mml:math id="m24">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the parameters of the parallelogram areas.</p>
<p>The cost of the cable includes the initial investment cost, maintenance cost and replacement cost. It depends on the length and type of the cable, so it is closely related to the connection layout of the distribution network. Different installation locations of the components will correspond to different distribution network connection layouts. The NPV of the cable cost within the planning years is expressed as<disp-formula id="e6">
<mml:math id="m25">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>where<disp-formula id="e7">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>where <inline-formula id="inf20">
<mml:math id="m27">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>C</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the total cost of the cable at year <inline-formula id="inf21">
<mml:math id="m28">
<mml:mi>y</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf22">
<mml:math id="m29">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the planning horizon. <inline-formula id="inf23">
<mml:math id="m30">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf24">
<mml:math id="m31">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf25">
<mml:math id="m32">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represent the unit initial investment cost, replacement cost and maintenance cost of type <inline-formula id="inf26">
<mml:math id="m33">
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula> cable at year <inline-formula id="inf27">
<mml:math id="m34">
<mml:mi>y</mml:mi>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf28">
<mml:math id="m35">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the length of cable <inline-formula id="inf29">
<mml:math id="m36">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> <inline-formula id="inf30">
<mml:math id="m37">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the total number of cables.</p>
</sec>
<sec id="s2-2">
<title>2.2 Embedded operation optimization layer: minimize the operation cost of the distribution network.</title>
<p>The locations of the substation, pumped storage plant, PV and WT will affect the connection layout of cables. Meanwhile, the locations of these equipment and the connection mode of the cables will affect the operation mode of the distribution network, especially the power losses. In order to improve the economic benefits of distribution network operator, the objective function of operation optimization is to minimize the NPV of the distribution network operation cost in the planning years. It is expressed as<disp-formula id="e8">
<mml:math id="m38">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>min</mml:mi>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2217;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>where<disp-formula id="e9">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>G</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2217;</mml:mo>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
<inline-formula id="inf31">
<mml:math id="m40">
<mml:mrow>
<mml:mtext>Here&#xa0;</mml:mtext>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the operation cost of the distribution network at year <inline-formula id="inf32">
<mml:math id="m41">
<mml:mi>y</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf33">
<mml:math id="m42">
<mml:mi>r</mml:mi>
</mml:math>
</inline-formula> is the interest rate. <inline-formula id="inf34">
<mml:math id="m43">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>G</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the active power purchased from the power grid at time <inline-formula id="inf35">
<mml:math id="m44">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf36">
<mml:math id="m45">
<mml:mrow>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>P</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the electricity price at time <inline-formula id="inf37">
<mml:math id="m46">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf38">
<mml:math id="m47">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the number of simulation hours per year. <inline-formula id="inf39">
<mml:math id="m48">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the control variables in the embedded optimization layer, which represents the operating power of pumped storage plant. The positive value represents that the pumped storage plant absorbs electricity from the power grid for water storage, while the negative value represents that the pumped storage plant generates electricity and delivers electricity to the distribution network.</p>
<p>The main constraints of the optimization including the power flow constraints and pumped storage plant constraints. The power flow constraints are described as<disp-formula id="e10">
<mml:math id="m49">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>V</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>T</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<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:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>cos</mml:mtext>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<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:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>sin</mml:mtext>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
<disp-formula id="e11">
<mml:math id="m50">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<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:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>sin</mml:mtext>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>cos</mml:mtext>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
<disp-formula id="e12">
<mml:math id="m51">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e13">
<mml:math id="m52">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>where <inline-formula id="inf40">
<mml:math id="m53">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mtext>PV</mml:mtext>
<mml:mo>.</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is active power generated by PV. <inline-formula id="inf41">
<mml:math id="m54">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mtext>Load</mml:mtext>
<mml:mo>.</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf42">
<mml:math id="m55">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mtext>Load</mml:mtext>
<mml:mo>.</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the active power and reactive power of load, respectively. <inline-formula id="inf43">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf44">
<mml:math id="m57">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the voltage of node <inline-formula id="inf45">
<mml:math id="m58">
<mml:mrow>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf46">
<mml:math id="m59">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf47">
<mml:math id="m60">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf48">
<mml:math id="m61">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the minimum and maximum allowable voltage of the node <inline-formula id="inf49">
<mml:math id="m62">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf50">
<mml:math id="m63">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf51">
<mml:math id="m64">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the real and imaginary elements of the admittance matrix. <inline-formula id="inf52">
<mml:math id="m65">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the phase angle difference between node <inline-formula id="inf53">
<mml:math id="m66">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula> to node <inline-formula id="inf54">
<mml:math id="m67">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf55">
<mml:math id="m68">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mtext>Bus</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the total number of buses in the distribution network. <inline-formula id="inf56">
<mml:math id="m69">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the current from bus <inline-formula id="inf57">
<mml:math id="m70">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula> to bus <inline-formula id="inf58">
<mml:math id="m71">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula> at time <inline-formula id="inf59">
<mml:math id="m72">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf60">
<mml:math id="m73">
<mml:mrow>
<mml:mtext>&#xa0;</mml:mtext>
<mml:msubsup>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mtext>max</mml:mtext>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the upper limit of current from bus <inline-formula id="inf61">
<mml:math id="m74">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula> to bus <inline-formula id="inf62">
<mml:math id="m75">
<mml:mi>j</mml:mi>
</mml:math>
</inline-formula>.</p>
<p>Pumped storage plants have two operation modes: pumping and generating electricity (<xref ref-type="bibr" rid="B24">Ma et al., 2015</xref>). The generating mode and pumping mode are described as <xref ref-type="disp-formula" rid="e14">Eqs 14</xref>, <xref ref-type="disp-formula" rid="e15">15</xref>, respectively.<disp-formula id="e14">
<mml:math id="m76">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mi>T</mml:mi>
</mml:msub>
<mml:mi>&#x3c1;</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>h</mml:mi>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
<disp-formula id="e15">
<mml:math id="m77">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>&#x3c1;</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>h</mml:mi>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>where <inline-formula id="inf63">
<mml:math id="m78">
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mi>T</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf64">
<mml:math id="m79">
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the efficiency of the turbine generator and pump motor, respectively. <inline-formula id="inf65">
<mml:math id="m80">
<mml:mi>&#x3c1;</mml:mi>
</mml:math>
</inline-formula> is the density of water. <inline-formula id="inf66">
<mml:math id="m81">
<mml:mi>g</mml:mi>
</mml:math>
</inline-formula> is the acceleration of gravity. <inline-formula id="inf67">
<mml:math id="m82">
<mml:mi>h</mml:mi>
</mml:math>
</inline-formula> is the elevating head. <inline-formula id="inf68">
<mml:math id="m83">
<mml:mrow>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf69">
<mml:math id="m84">
<mml:mrow>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> are the water volumetric flow rate of the turbine generator and pump motor at time, respectively.</p>
<p>The amount of water in the upper reservoir is calculated by<disp-formula id="e16">
<mml:math id="m85">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x222b;</mml:mo>
</mml:mstyle>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:munderover>
<mml:mstyle displaystyle="true">
<mml:mo>&#x222b;</mml:mo>
</mml:mstyle>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mi>q</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>where <inline-formula id="inf70">
<mml:math id="m86">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the water quantity in the upper reservoir at time <inline-formula id="inf71">
<mml:math id="m87">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>.</p>
<p>In order to represent the storage state of a pumped storage plant, the state of charge (SOC) is introduced. The SOC of a pumped storage plant is expressed as<disp-formula id="e17">
<mml:math id="m88">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>where <inline-formula id="inf72">
<mml:math id="m89">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the maximum limit of upper reservoir water quantity. <inline-formula id="inf73">
<mml:math id="m90">
<mml:mrow>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the SOC of the pumped storage plant at time <inline-formula id="inf74">
<mml:math id="m91">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula>.</p>
<p>The amount of the water in the upper reservoir should be between the maximum allowable reservoir capacity and the minimum allowable reservoir capacity. It also requires that the amount of water in the upstream reservoir remain unchanged for 1&#xa0;day. These constraints of the pumped storage plant are presented as follows.<disp-formula id="e18">
<mml:math id="m92">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(18)</label>
</disp-formula>
<disp-formula id="e19">
<mml:math id="m93">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>S</mml:mi>
<mml:mi>O</mml:mi>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(19)</label>
</disp-formula>where <inline-formula id="inf75">
<mml:math id="m94">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the minimum limit of upper reservoir water quantity. <inline-formula id="inf76">
<mml:math id="m95">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf77">
<mml:math id="m96">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the start and end time of the day, respectively.</p>
</sec>
<sec id="s3">
<title>3 Solution Approach</title>
<p>From the previous section, it can be seen that the formulated distributed network planning optimization model is a non-linear problem. There are many methods to solve such problem, such as dynamic programming (<xref ref-type="bibr" rid="B13">Ganguly et al., 2013</xref>), differential algorithm (<xref ref-type="bibr" rid="B41">Zhang et al., 2016</xref>), and genetic algorithm (<xref ref-type="bibr" rid="B14">Ghofrani et al., 2013</xref>), (<xref ref-type="bibr" rid="B3">Awad et al., 2014</xref>). Considering the complexity of this optimization model, a method based on the particle swarm optimization and dynamic minimum spanning tree (PSO-DMST) is proposed to solve the corresponding bi-layer planning problem. The details of the problem solving are given below.</p>
</sec>
<sec id="s3-1">
<title>3.1 Particle Swarm Optimization-Dynamic Minimum Spanning Tree Method in Planning Optimization Layer</title>
<p>The locations of the PV, WT, substation and pumped storage plant are determined by the PSO method (<xref ref-type="bibr" rid="B18">Kennedy and Eberhart, 1995</xref>). Each particle represents a potential coordinate (x, y) of the component. The update formulas of the particles are as follows.<disp-formula id="e20">
<mml:math id="m97">
<mml:mrow>
<mml:msubsup>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c9;</mml:mi>
<mml:msubsup>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>p</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(20)</label>
</disp-formula>
<disp-formula id="e21">
<mml:math id="m98">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(21)</label>
</disp-formula>where <inline-formula id="inf78">
<mml:math id="m99">
<mml:mrow>
<mml:msubsup>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf79">
<mml:math id="m100">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mtext>&#xa0;</mml:mtext>
</mml:mrow>
</mml:math>
</inline-formula> denote the position and velocity of the particle in the <inline-formula id="inf80">
<mml:math id="m101">
<mml:mi>k</mml:mi>
</mml:math>
</inline-formula> th iteration, respectively. <inline-formula id="inf81">
<mml:math id="m102">
<mml:mrow>
<mml:msubsup>
<mml:mi>p</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf82">
<mml:math id="m103">
<mml:mrow>
<mml:msubsup>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> denote the personal best and the global best of <inline-formula id="inf83">
<mml:math id="m104">
<mml:mi>k</mml:mi>
</mml:math>
</inline-formula> th iteration of dimension <inline-formula id="inf84">
<mml:math id="m105">
<mml:mi>d</mml:mi>
</mml:math>
</inline-formula>, respectively. <inline-formula id="inf85">
<mml:math id="m106">
<mml:mi>&#x3c9;</mml:mi>
</mml:math>
</inline-formula> is the inertia weight. <inline-formula id="inf86">
<mml:math id="m107">
<mml:mrow>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf87">
<mml:math id="m108">
<mml:mrow>
<mml:msub>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are learning coefficients. <inline-formula id="inf88">
<mml:math id="m109">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf89">
<mml:math id="m110">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are two random numbers in the range [0,1]. In order to improve the performance of the algorithm, the linearly decreasing inertia weight is used in this study (<xref ref-type="bibr" rid="B12">Fei and He, 2015</xref>), which is presented as<disp-formula id="e22">
<mml:math id="m111">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mtext>max</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mtext>max</mml:mtext>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mtext>min</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mfrac>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mtext>max</mml:mtext>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(22)</label>
</disp-formula>where <inline-formula id="inf90">
<mml:math id="m112">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf91">
<mml:math id="m113">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the maximum and minimum inertia weights, respectively. <inline-formula id="inf92">
<mml:math id="m114">
<mml:mi>k</mml:mi>
</mml:math>
</inline-formula> and <inline-formula id="inf93">
<mml:math id="m115">
<mml:mrow>
<mml:msub>
<mml:mi>k</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the iteration number and maximum number of iterations, respectively.</p>
<p>Once the locations of the PV, WT, substation and pumped storage plant are determined, it is necessary to find an effective way to connect all the components in the distribution network. This problem is similar to the minimum spanning tree (MST) problem in graph theory (<xref ref-type="bibr" rid="B5">Bondy and Murty, 1976</xref>). In MST, each PV, WT, substation and pumped storage plant and load corresponds to a vertex in the graph, and these vertices are connected with minimum total weight. In the traditional MST, the weight is the distance between two vertices, that is, the cable length between two components. This method can finally connect all components with the shortest cable. After the distribution network topology is determined, the cable type is selected according to the peak load, and then the total cable cost can be calculated according to the length and type of the cable. However, MST can only guarantee that the length of the cable is the shortest but does not guarantee that the cost of the cable is the smallest.</p>
<p>Since one of the optimization goals is to minimize the cost of the cable, on the basis of the MST, the DMST that takes into account the influence of the load size on the cable selection is adopted for the cable connection. In DMST, the weight of two vertices is the cost of the cable that connecting two vertices. Thus, the minimum cost of cable can be guaranteed over the planning horizon. <xref ref-type="fig" rid="F2">Figure 2</xref> is presented as an example to show the difference between the MST and DMST for cable connection. <xref ref-type="fig" rid="F2">Figure 2A</xref> is the undirected graph that gives all possible connecting cables and the corresponding length of each cable. <xref ref-type="fig" rid="F2">Figure 2B</xref> and <xref ref-type="fig" rid="F2">Figure 2C</xref> show the cable connection result obtained by MST method. <xref ref-type="fig" rid="F2">Figure 2D</xref> is the cable connection result obtained by DMST. Here, two types of cables distinguished by color and the number in parentheses are adopted. The numbers in parentheses indicate the type of the cable. When the number of connected loads is less than or equal to 2, a cable with a smaller capacity (black solid line, type 1) can be selected, and when the number of connected loads exceeds 2, a cable with a larger capacity (red solid line, type 2) should be selected. And it assumes that the unit cost of black cable is 1 and that of red cable is 2. It can be seen that the cable cost of MST is 7.3, and that the cable cost of DMST is 6.8. Therefore, it demonstrated that the DMST method can obtain lower cable cost than the MST method.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Layout by MST and DMST <bold>(A)</bold> Undirected graph <bold>(B)</bold> MST before cable selection <bold>(C)</bold> MST after cable selection <bold>(D)</bold> DMST.</p>
</caption>
<graphic xlink:href="fenrg-10-864914-g002.tif"/>
</fig>
</sec>
<sec id="s3-2">
<title>3.2 Scenario-Based Stochastic Optimal Power Flow in Operation Optimization Layer</title>
<p>In the distribution network, there are many uncertain variables, such as load, renewable energy generation and electricity price. Taking into account these uncertainties, a scenario-based stochastic model is adopted to optimize the operation of distribution network.</p>
<p>The process of the scenario-based stochastic modeling is mainly divided into three steps: scenario generation, scenario reduction and scenario aggregation. Firstly, the RWM is used to generate the original scenarios based on the probability density function of the forecast error. In this paper, it is considered that the forecast errors of load, PV output, wind power generation and electricity price obey normal distribution. Secondly, similar scenarios and the scenarios with low probability are omitted. Thirdly, the optimization problem is solved under the remaining scenarios in a deterministic model, and the expected solution results are obtained by the scenario aggregation. More details on the modeling of the required scenarios can be found in reference (<xref ref-type="bibr" rid="B28">Mohammadi et al., 2014</xref>).</p>
<p>The final value of the uncertain variable can be calculated by<disp-formula id="e23">
<mml:math id="m116">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mtext>forecast</mml:mtext>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x394;</mml:mi>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(23)</label>
</disp-formula>where <inline-formula id="inf94">
<mml:math id="m117">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula> is the index of the uncertain variables, i.e., PV output, WT output, load, and electricity price. <inline-formula id="inf95">
<mml:math id="m118">
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula> is the number of uncertain variables with index <inline-formula id="inf96">
<mml:math id="m119">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula>. <inline-formula id="inf97">
<mml:math id="m120">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mtext>forecast</mml:mtext>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the initial forecast value and <inline-formula id="inf98">
<mml:math id="m121">
<mml:mrow>
<mml:mi>&#x394;</mml:mi>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the estimated forecast error.</p>
<p>The length of each scenario is equal to the number of uncertain variables multiplied by the time dimension. The structure of each scenario can be expressed as follows.<disp-formula id="e24">
<mml:math id="m122">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>V</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>V</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>V</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>T</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>T</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>T</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mtext>s</mml:mtext>
</mml:msubsup>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(24)</label>
</disp-formula>where <inline-formula id="inf99">
<mml:math id="m123">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>V</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the PV output at hour <inline-formula id="inf100">
<mml:math id="m124">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula> in the <inline-formula id="inf101">
<mml:math id="m125">
<mml:mi>s</mml:mi>
</mml:math>
</inline-formula> th scenario. <inline-formula id="inf102">
<mml:math id="m126">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>T</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the WT generation at hour <inline-formula id="inf103">
<mml:math id="m127">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula> in the <inline-formula id="inf104">
<mml:math id="m128">
<mml:mi>s</mml:mi>
</mml:math>
</inline-formula> th scenario. <inline-formula id="inf105">
<mml:math id="m129">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the value of the load at hour <inline-formula id="inf106">
<mml:math id="m130">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula> in the <inline-formula id="inf107">
<mml:math id="m131">
<mml:mi>s</mml:mi>
</mml:math>
</inline-formula> th scenario. <inline-formula id="inf108">
<mml:math id="m132">
<mml:mrow>
<mml:msubsup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>s</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the electricity price at hour <inline-formula id="inf109">
<mml:math id="m133">
<mml:mi>t</mml:mi>
</mml:math>
</inline-formula> in the <inline-formula id="inf110">
<mml:math id="m134">
<mml:mi>s</mml:mi>
</mml:math>
</inline-formula> th scenario. <inline-formula id="inf111">
<mml:math id="m135">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the total number of the loads. <inline-formula id="inf112">
<mml:math id="m136">
<mml:mi>T</mml:mi>
</mml:math>
</inline-formula> is the scheduling horizon of 1&#xa0;day.</p>
<p>Based on the generated scenarios, the optimal power flow is carried out in MATPOWER 6.0 toolbox (<xref ref-type="bibr" rid="B42">Zimmerman et al., 2011</xref>) to find the optimal operation strategy of the distribution network, check the power flow constraints, and calculate the operation cost of the distribution network.</p>
</sec>
<sec id="s3-3">
<title>3.3 Proposed Optimization Framework</title>
<p>Combining the two optimization layers, the whole flow chart of the optimization problem is shown in <xref ref-type="fig" rid="F3">Figure 3</xref>. The main steps are presented as follows.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Flowchart of the proposed bi-layer planning model.</p>
</caption>
<graphic xlink:href="fenrg-10-864914-g003.tif"/>
</fig>
<p>
<statement content-type="step" id="Step_1">
<label>Step 1</label>
<p>: Initialize the position and velocity of PSO particles, that is, the potential construction location of substation, pumped storage plant, PV and WT.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_2">
<label>Step 2</label>
<p>: Use the DMST to connect the substation, pumped storage plant, PV, WT and loads.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_3">
<label>Step 3</label>
<p>: Calculate the cost of cables based on the topology obtained in the previous step.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_4">
<label>Step 4</label>
<p>: Generate a certain number of scenarios based on the probability density function of the forecast error using the roulette wheel mechanism.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_5">
<label>Step 5</label>
<p>: Select the proper scenarios and delete the same and improper scenarios.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_6">
<label>Step 6</label>
<p>: According to the cable connection mode obtained in the previous step, run OPF of the selected scenario to find the optimal operation strategy that minimizes the operation cost of the distribution network.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_7">
<label>Step 7</label>
<p>: Calculate the total operating cost of the distribution network based on the operation mode of the pumped storage plant obtained in the previous step.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_8">
<label>Step 8</label>
<p>: Fitness evaluation, that is, calculate the total cost of the distribution network (cable cost plus operation cost).</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_9">
<label>Step 9</label>
<p>: According to fitness value, update the personal best and the global best of the particles.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_10">
<label>Step 10</label>
<p>: Determine whether the maximum number of iterations has been reached. If it is achieved, terminate the algorithm and output the result; if not, update the position and velocity of the particle and go to step 2.</p>
</statement>
</p>
</sec>
</sec>
<sec id="s4">
<title>4 Case Study</title>
<sec id="s4-1">
<title>4.1 System Description</title>
<p>The proposed distribution planning method is tested on a modified 103-bus distribution system with a base voltage of 34.5&#xa0;kV. The original coordinates of the loads are referred to (<xref ref-type="bibr" rid="B8">Carrano et al., 2005</xref>), and some modifications were made to them for this study. In the modified 103-bus distribution system, there are 99 loads with fixed position coordinates, as well as one substation, one pumped storage plant, one PV and one WT whose position coordinates need to be optimized. It is assumed that the distribution network is connected to the transmission network at coordinates (10, &#x2212;5) km. Geographical constraints are expressed in <xref ref-type="table" rid="T1">Table 1</xref>. The modified system with the geographical location limitations is shown in <xref ref-type="fig" rid="F4">Figure 4</xref>. Seven types of cables are selected to connect all components. Details of each cable are shown in <xref ref-type="table" rid="T2">Table 2</xref> (<xref ref-type="bibr" rid="B8">Carrano et al., 2005</xref>).</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Geographical constraints of each component.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Component</th>
<th align="center">
<italic>x</italic>-axis (km)</th>
<th align="center">
<italic>y</italic>-axis (km)</th>
<th align="center">Relationship between x-axis and <italic>y</italic>-axis (km)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Substation</td>
<td align="center">[&#x2212;0.5,12]</td>
<td align="center">[&#x2212;2,&#x2212;1]</td>
<td align="center">/</td>
</tr>
<tr>
<td align="left">Pumped storage plant</td>
<td align="center">[11.25,12.75]</td>
<td align="center">[4.5,12]</td>
<td align="center">15 <inline-formula id="inf113">
<mml:math id="m137">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>179.25</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>15</mml:mn>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>164.25</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td align="left">PV</td>
<td align="center">[1.5,3.5]</td>
<td align="center">[12.5,14.5]</td>
<td align="center">/</td>
</tr>
<tr>
<td align="left">WT</td>
<td align="center">[8.5,11.5]</td>
<td align="center">[13.5,16]</td>
<td align="center">/</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>103-bus distribution network under study.</p>
</caption>
<graphic xlink:href="fenrg-10-864914-g004.tif"/>
</fig>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Cable parameters.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Type</th>
<th align="center">Resistance (&#x2126;/km)</th>
<th align="center">Reactance (&#x2126;/km)</th>
<th align="center">Nominal power (kW)</th>
<th align="center">Line installation cost ($/km)</th>
<th align="center">Maintenance cost ($/km)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="char" char=".">1.6118</td>
<td align="char" char=".">0.4853</td>
<td align="char" char=".">2,817</td>
<td align="char" char=".">32,126.23</td>
<td align="char" char=".">1733.54</td>
</tr>
<tr>
<td align="left">2</td>
<td align="char" char=".">1.0145</td>
<td align="char" char=".">0.4679</td>
<td align="char" char=".">3,776</td>
<td align="char" char=".">32,321.31</td>
<td align="char" char=".">1733.54</td>
</tr>
<tr>
<td align="left">3</td>
<td align="char" char=".">0.6375</td>
<td align="char" char=".">0.4505</td>
<td align="char" char=".">5,115</td>
<td align="char" char=".">32,653.55</td>
<td align="char" char=".">1733.54</td>
</tr>
<tr>
<td align="left">4</td>
<td align="char" char=".">0.5205</td>
<td align="char" char=".">0.4428</td>
<td align="char" char=".">5,975</td>
<td align="char" char=".">32,780.81</td>
<td align="char" char=".">1733.54</td>
</tr>
<tr>
<td align="left">5</td>
<td align="char" char=".">0.4019</td>
<td align="char" char=".">0.4331</td>
<td align="char" char=".">6,860</td>
<td align="char" char=".">33,378.78</td>
<td align="char" char=".">1733.54</td>
</tr>
<tr>
<td align="left">6</td>
<td align="char" char=".">0.3184</td>
<td align="char" char=".">0.4237</td>
<td align="char" char=".">7,983</td>
<td align="char" char=".">33,752.81</td>
<td align="char" char=".">1733.54</td>
</tr>
<tr>
<td align="left">7</td>
<td align="char" char=".">0.2006</td>
<td align="char" char=".">0.4026</td>
<td align="char" char=".">10,828</td>
<td align="char" char=".">34,100.00</td>
<td align="char" char=".">1733.54</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The load, photovoltaic power generation, wind power and electricity price data are obtained from Denmark power grid. The base load values for each load are obtained from (<xref ref-type="bibr" rid="B8">Carrano et al., 2005</xref>). The rated active power of the photovoltaic is 1&#xa0;MW. The maximum water quantity of the upper reservoir is 50,000&#xa0;<inline-formula id="inf114">
<mml:math id="m138">
<mml:mrow>
<mml:msup>
<mml:mtext>m</mml:mtext>
<mml:mn>3</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>. The total efficiency of pumped storage is 0.75, and the maximum generating power is 1&#xa0;MW. In this study, the pumping head is 60&#xa0;m high. It is assumed that the total planning period is 15&#xa0;years. The total number of particle swarm is 25 and the maximum iteration number is 100. The learning coefficients of PSO are 2. The minimum and maximum values of inertia weight are 0.4 and 0.9, respectively.</p>
<p>According to the geographical constraints and optimization procedure, the studies are categorized into 4 cases, as shown in <xref ref-type="table" rid="T3">Table 3</xref>. Case 1 is the base case, in which the locations of the components are random selected in the constrained zone, and the planning and operation procedure are separated. In case 2, the locations of the components are determined by experience of the staff, i.e., the center of the constrained zone. In case 3 and case 4, the locations of the components are determined by the proposed method. The difference between case 3 and case 4 is the sequence of planning optimization and operation optimization.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Case description.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">case</th>
<th align="center">Locations of the substation, pumped storage plant, PV and WT</th>
<th align="center">Planning procedure and operation procedure</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="left">At the random locations of the constrained zone</td>
<td align="left">Separated</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">At the left of the constrained zone</td>
<td align="left">Separated</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">To be optimized by proposed method</td>
<td align="left">Separated</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">To be optimized by proposed method</td>
<td align="left">Simultaneously</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4-2">
<title>4.2 Experimental Results</title>
<p>The topologies of the distribution network planning problem in four cases are shown in <xref ref-type="fig" rid="F5">Figure 5</xref>. In <xref ref-type="fig" rid="F5">Figures 5A,B,C,D</xref> are the topologies of the distribution network in case 1, case 2, case 3 and case 4, respectively. The coordinates of the substation, pumped storage plant, PV and WT in the four cases are shown in <xref ref-type="table" rid="T4">Table 4</xref>. In these figures, the solid line represents one cable, and the dotted line represents two cables of the same type. Different types of cables are distinguished by color and the number in parentheses is the type of the cable.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Distribution network topology <bold>(A)</bold> Case 1 <bold>(B)</bold> Case 2 <bold>(C)</bold> Case 3 <bold>(D)</bold> Case 4.</p>
</caption>
<graphic xlink:href="fenrg-10-864914-g005.tif"/>
</fig>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>The Coordinates of the 103-bus distribution network in four cases.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">case</th>
<th align="center">Substation (km)</th>
<th align="center">Pumped storage plant (km)</th>
<th align="center">PV (km)</th>
<th align="center">WT (km)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="center">0.58, &#x2212;1.96;</td>
<td align="center">12.38, 6.93;</td>
<td align="center">1.63, 14.35;</td>
<td align="center">8.66, 13.67;</td>
</tr>
<tr>
<td align="left">2</td>
<td align="center">5.75,&#x2212;1.5;</td>
<td align="center">12, 8.25;</td>
<td align="center">2.5,13.5;</td>
<td align="center">10,14.75;</td>
</tr>
<tr>
<td align="left">3</td>
<td align="center">8.08,&#x2212;1;</td>
<td align="center">11.25,4.5;</td>
<td align="center">1.5,13;</td>
<td align="center">11.5,14.16;</td>
</tr>
<tr>
<td align="left">4</td>
<td align="center">8.13,&#x2212;1;</td>
<td align="center">12.75,12;</td>
<td align="center">1.5,14.5;</td>
<td align="center">11.5,16;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From these topologies, it can be seen that all the loads, substation, pumped storage plant, PV and WT in the studied distribution network are connected without crossover. Meanwhile, the locations of the substation, pumped storage plant, PV and WT are also in the constrained zones. Details of the optimization results, including the NPV of cable cost, the NPV of operation cost and the NPV of total cost, are presented in <xref ref-type="table" rid="T5">Table 5</xref>.</p>
<table-wrap id="T5" position="float">
<label>TABLE 5</label>
<caption>
<p>The results of the 103-bus distribution network in four cases.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">case</th>
<th align="center">NPV of cable cost ($)</th>
<th align="center">NPV of operation cost ($)</th>
<th align="center">NPV of total cost ($)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="char" char=".">8.419 <inline-formula id="inf115">
<mml:math id="m139">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>6</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">1.7300 <inline-formula id="inf116">
<mml:math id="m140">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">2.5719 <inline-formula id="inf117">
<mml:math id="m141">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td align="left">2</td>
<td align="char" char=".">8.277 <inline-formula id="inf118">
<mml:math id="m142">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>6</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">1.7187 <inline-formula id="inf119">
<mml:math id="m143">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">2.5464 <inline-formula id="inf120">
<mml:math id="m144">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td align="left">3</td>
<td align="char" char=".">7.847 <inline-formula id="inf121">
<mml:math id="m145">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>6</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">1.7178 <inline-formula id="inf122">
<mml:math id="m146">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">2.5025 <inline-formula id="inf123">
<mml:math id="m147">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td align="left">4</td>
<td align="char" char=".">7.849 <inline-formula id="inf124">
<mml:math id="m148">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>6</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">1.7166 <inline-formula id="inf125">
<mml:math id="m149">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td align="char" char=".">2.5015 <inline-formula id="inf126">
<mml:math id="m150">
<mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mn>7</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Comparing the NPV of cable cost in the four cases, it can be seen that the values of case 3 and case 4 are smaller than those of case 1 and case 2. The results of case 3 and case 4 are similar. It demonstrated that, compared with experience oriented or random selected locations, the proposed method helps to reduce the total cost of the cable. Comparing the NPV of operation cost in four cases, the lowest operation cost is obtained by case 4. This indicates that the location and connection mode of the components have an important influence on the operation of the distribution network. It can be found that although the cable cost of case 4 is higher than case 3, the operating cost of case 4 is much smaller than case 3, so the minimum total cost is obtained from case 4. This shows that when the topology optimization and operation optimization of the distribution network are separated, although the distribution network topology with smaller equipment investment cost can be obtained, the corresponding operating cost may not be minimal. Because the operation cost accounts for a large proportion of the total cost, the result of combining topology optimization and operation optimization is better than that of separating them. In order to improve the economic benefits, it is necessary to combine the planning optimization and operation optimization of the distribution network.</p>
<p>To prove the effectiveness of the proposed method, the economic dispatch of pumped storage plant in a selected scenario is presented in <xref ref-type="fig" rid="F6">Figure 6</xref>. From <xref ref-type="fig" rid="F6">Figure 6</xref>, it can be seen that pumped storage pumps water when the electricity price is low, and generates electricity when the electricity price is high, which can increase the profit of the distribution network operator.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Active power of the pumped storage plant.</p>
</caption>
<graphic xlink:href="fenrg-10-864914-g006.tif"/>
</fig>
<p>To further verify the effectiveness of the proposed PSO-based method, the performance of the PSO-based method is compared with genetic algorithm (GA) and harmony search (HS) in case 4. The comparison results are shown in <xref ref-type="fig" rid="F7">Figure 7</xref>. It shows that the PSO-based method converges quickly and its optimization result is better than two other methods under the same experimental environment.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Convergence process.</p>
</caption>
<graphic xlink:href="fenrg-10-864914-g007.tif"/>
</fig>
</sec>
</sec>
<sec id="s5">
<title>5 Conclusion</title>
<p>In this paper, an integrated planning optimization model for the distribution network with geographical restrictions is established. The integrated planning optimization model is divided into two layers. In the planning optimization layer, the PSO method is used to optimize the locations of the substation, pumped storage plant, PV and WT, and then the DMST method is used to connect all the components without crossover. In the embedded operation optimization layer, considering the uncertainty of load, illumination intensity, wind speed and electricity price, a scenario-based stochastic OPF is carried out and the dispatch of the pumped storage plant is determined. The dispatch results show that the operating state of the pumped storage is closely related to the electricity price. It charges when the electricity price is low and discharges when the electricity price is high. By using the proposed method, both the total cost of the cable and the operation cost of the distribution network are reduced. In addition, the PSO-based optimization method is compared with the GA and the HS. The comparison results show that the PSO-based method converges faster and obtains better experimental results than the other two methods. In summary, the proposed method can provide cost-effective guidance for the planning and operation of distribution network with the consideration of geographical constraints.</p>
</sec>
</body>
<back>
<sec 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>KQ contributed to the conception and design of the proposed strategy. All authors wrote and edited the manuscript.</p>
</sec>
<sec id="s8">
<title>Funding</title>
<p>This work was supported by the National Natural Science Foundation of China under Grant 52107073.</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>Arasteh</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Sepasian</surname>
<given-names>M. S.</given-names>
</name>
<name>
<surname>Vahidinasab</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>An Aggregated Model for Coordinated Planning and Reconfiguration of Electric Distribution Networks</article-title>. <source>Energy</source> <volume>94</volume>, <fpage>786</fpage>&#x2013;<lpage>798</lpage>. <pub-id pub-id-type="doi">10.1016/j.energy.2015.11.053</pub-id> </citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ashoornezhad</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Falaghi</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Hajizadeh</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ramezani</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A Two-Stage Multi-Period Distribution Network Expansion Planning Considering the Integration of Private Investors</article-title>. <source>Int. Trans. Electr. Energ. Syst.</source> <volume>31</volume> (<issue>12</issue>), <fpage>e13226</fpage>. <pub-id pub-id-type="doi">10.1002/2050-7038.13226</pub-id> </citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Awad</surname>
<given-names>A. S. A.</given-names>
</name>
<name>
<surname>el-Fouly</surname>
<given-names>T. H. M.</given-names>
</name>
<name>
<surname>Salama</surname>
<given-names>M. M. A.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Optimal ESS Allocation and Load Shedding for Improving Distribution System Reliability</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>5</volume> (<issue>5</issue>), <fpage>2339</fpage>&#x2013;<lpage>2349</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2014.2316197</pub-id> </citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Baringo</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Boffino</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Oggioni</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Robust Expansion Planning of a Distribution System with Electric Vehicles, Storage and Renewable Units</article-title>. <source>Appl. Energ.</source> <volume>265</volume>, <fpage>114679</fpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2020.114679</pub-id> </citation>
</ref>
<ref id="B5">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Bondy</surname>
<given-names>J. A.</given-names>
</name>
<name>
<surname>Murty</surname>
<given-names>U. S. R.</given-names>
</name>
</person-group> (<year>1976</year>). <source>Graph Theory with Applications</source>. <publisher-loc>London</publisher-loc>: <publisher-name>The Macmillan Press Ltd.</publisher-name> </citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Carpinelli</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Celli</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Mocci</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Mottola</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pilo</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Proto</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Optimal Integration of Distributed Energy Storage Devices in Smart Grids</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>4</volume> (<issue>2</issue>), <fpage>985</fpage>&#x2013;<lpage>995</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2012.2231100</pub-id> </citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Carrano</surname>
<given-names>E. G.</given-names>
</name>
<name>
<surname>Soares</surname>
<given-names>L. A. E.</given-names>
</name>
<name>
<surname>Takahashi</surname>
<given-names>R. H. C.</given-names>
</name>
<name>
<surname>Saldanha</surname>
<given-names>R. R.</given-names>
</name>
<name>
<surname>Neto</surname>
<given-names>O. M.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>Electric Distribution Network Multiobjective Design Using a Problem-specific Genetic Algorithm</article-title>. <source>IEEE Trans. Power Deliv.</source> <volume>21</volume> (<issue>2</issue>), <fpage>995</fpage>&#x2013;<lpage>1005</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrd.2005.858779</pub-id> </citation>
</ref>
<ref id="B8">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Carrano</surname>
<given-names>E. G.</given-names>
</name>
<name>
<surname>Takahashi</surname>
<given-names>R. H. C.</given-names>
</name>
<name>
<surname>Cardoso</surname>
<given-names>E. P.</given-names>
</name>
<name>
<surname>Neto</surname>
<given-names>O. M.</given-names>
</name>
<name>
<surname>Saldanha</surname>
<given-names>R. R.</given-names>
</name>
</person-group> (<year>2005</year>). <source>Multiobjective Genetic Algorithm in the Design of Electric Distribution Networks: Simulation Data</source>. <publisher-loc>Orlando, FL</publisher-loc>: <publisher-name>Tech. Rep. Univ. Fed. Minas Gerais</publisher-name>, <comment>available at: <ext-link ext-link-type="uri" xlink:href="http://www.mat.ufmg.br/%7Etaka/techrep/agnet01.pdf">http://www.mat.ufmg.br/&#x223c;taka/techrep/agnet01.pdf</ext-link>
</comment>. </citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Celli</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Pilo</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pisano</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Soma</surname>
<given-names>G. G.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Distribution Energy Storage Investment Prioritization with a Real Coded Multi-Objective Genetic Algorithm</article-title>. <source>Electric Power Syst. Res.</source> <volume>163</volume>, <fpage>154</fpage>&#x2013;<lpage>163</lpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2018.06.008</pub-id> </citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Multi-objective Optimal Scheduling of a Microgrid with Uncertainties of Renewable Power Generation Considering User Satisfaction</article-title>. <source>Int. J. Electr. Power Energ. Syst.</source> <volume>131</volume>, <fpage>107142</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2021.107142</pub-id> </citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ding</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Stochastic Optimization of the Daily Operation of Wind Farm and Pumped-Hydro-Storage Plant</article-title>. <source>Renew. Energ.</source> <volume>48</volume>, <fpage>571</fpage>&#x2013;<lpage>578</lpage>. <pub-id pub-id-type="doi">10.1016/j.renene.2012.06.008</pub-id> </citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fei</surname>
<given-names>S.-w.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>A Multiple-Kernel Relevance Vector Machine with Nonlinear Decreasing Inertia Weight PSO for State Prediction of Bearing</article-title>. <source>Shock and Vibration</source> <volume>2015</volume>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1155/2015/685979</pub-id> </citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ganguly</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Sahoo</surname>
<given-names>N. C.</given-names>
</name>
<name>
<surname>Das</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Multi-objective Planning of Electrical Distribution Systems Using Dynamic Programming</article-title>. <source>Int. J. Electr. Power Energ. Syst.</source> <volume>46</volume>, <fpage>65</fpage>&#x2013;<lpage>78</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2012.10.030</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ghofrani</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Arabali</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Etezadi-Amoli</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Fadali</surname>
<given-names>M. S.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>A Framework for Optimal Placement of Energy Storage Units within a Power System with High Wind Penetration</article-title>. <source>IEEE Trans. Sustain. Energ.</source> <volume>4</volume> (<issue>2</issue>), <fpage>434</fpage>&#x2013;<lpage>442</lpage>. <pub-id pub-id-type="doi">10.1109/tste.2012.2227343</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hou</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Optimisation of Offshore Wind Farm cable Connection Layout Considering Levelised Production Cost Using Dynamic Minimum Spanning Tree Algorithm</article-title>. <source>IET Renew. Power Generation</source> <volume>10</volume> (<issue>2</issue>), <fpage>175</fpage>&#x2013;<lpage>183</lpage>. <pub-id pub-id-type="doi">10.1049/iet-rpg.2015.0052</pub-id> </citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Shahidehpour</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Optimal Operation of Energy Hubs with Large-Scale Distributed Energy Resources for Distribution Network Congestion Management</article-title>. <source>IEEE Trans. Sustain. Energ.</source> <volume>12</volume> (<issue>3</issue>), <fpage>1755</fpage>&#x2013;<lpage>1765</lpage>. <pub-id pub-id-type="doi">10.1109/tste.2021.3064375</pub-id> </citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Energy Solutions for Producing Shale Oil: Characteristics of Energy Demand and Economic Analysis of Energy Supply Options</article-title>. <source>Energy</source> <volume>192</volume>, <fpage>116603</fpage>. <pub-id pub-id-type="doi">10.1016/j.energy.2019.116603</pub-id> </citation>
</ref>
<ref id="B18">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kennedy</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Eberhart</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>1995</year>). <article-title>Particle Swarm Optimization</article-title>.&#x201d; in <conf-name>Proceedings of ICNN&#x27;95 - International Conference on Neural Networks</conf-name>. <publisher-loc>Perth, WA, Australia</publisher-loc>, <fpage>1942</fpage>&#x2013;<lpage>1948</lpage>. </citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khator</surname>
<given-names>S. K.</given-names>
</name>
<name>
<surname>Leung</surname>
<given-names>L. C.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Power Distribution Planning: A Review of Models and Issues</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>12</volume> (<issue>3</issue>), <fpage>1151</fpage>&#x2013;<lpage>1159</lpage>. <pub-id pub-id-type="doi">10.1109/59.630455</pub-id> </citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Koutsoukis</surname>
<given-names>N. C.</given-names>
</name>
<name>
<surname>Georgilakis</surname>
<given-names>P. S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A Multistage Distribution Network Planning Method Considering Distributed Generation Active Management and Demand Response</article-title>. <source>IET Renew. Power Gen</source> <volume>16</volume> (<issue>1</issue>), <fpage>65</fpage>&#x2013;<lpage>76</lpage>. <pub-id pub-id-type="doi">10.1049/rpg2.12325</pub-id> </citation>
</ref>
<ref id="B21">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Koutsoukis</surname>
<given-names>N. C.</given-names>
</name>
<name>
<surname>Georgilakis</surname>
<given-names>P. S.</given-names>
</name>
<name>
<surname>Hatziargyriou</surname>
<given-names>N. D.</given-names>
</name>
</person-group> (<year>2014</year>). <source>A Tabu Search Method for Distribution Network Planning Considering Distributed Generation and UncertaintiesInternational Conference on Probabilistic Methods Applied to Power Systems</source>. <publisher-loc>Durham</publisher-loc>: <publisher-name>PMAPS</publisher-name>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>. </citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lazzeroni</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Repetto</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Optimal Planning of Battery Systems for Power Losses Reduction in Distribution Grids</article-title>. <source>Electric Power Syst. Res.</source> <volume>167</volume>, <fpage>94</fpage>&#x2013;<lpage>112</lpage>. <pub-id pub-id-type="doi">10.1016/j.epsr.2018.10.027</pub-id> </citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>C.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Cable Connection Optimization for Onshore Wind Farms Considering Restricted Area and Topography</article-title>. <source>IEEE Syst. J.</source> <volume>14</volume> (<issue>3</issue>), <fpage>3082</fpage>&#x2013;<lpage>3092</lpage>. <pub-id pub-id-type="doi">10.1109/jsyst.2020.2982843</pub-id> </citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ma</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Peng</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Pumped Storage-Based Standalone Photovoltaic Power Generation System: Modeling and Techno-Economic Optimization</article-title>. <source>Appl. Energ.</source> <volume>137</volume>, <fpage>649</fpage>&#x2013;<lpage>659</lpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2014.06.005</pub-id> </citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Marcochi de Melo</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Lopes</surname>
<given-names>E. C.</given-names>
</name>
<name>
<surname>Motta</surname>
<given-names>J. G.</given-names>
</name>
<name>
<surname>Asano</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Valverde</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Suyama</surname>
<given-names>R.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Integrated Intelligent Geoprocessing Tool for Screening Candidate Locations Suitable for Distributed Generation Deployment</article-title>. <source>Renew. Energ.</source> <volume>177</volume>, <fpage>797</fpage>&#x2013;<lpage>806</lpage>. <pub-id pub-id-type="doi">10.1016/j.renene.2021.05.100</pub-id> </citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mejia</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Macedo</surname>
<given-names>L. H.</given-names>
</name>
<name>
<surname>Mu&#xf1;oz-Delgado</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Contreras</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Padilha-Feltrin</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Medium-term Planning of Active Distribution Systems Considering Voltage-dependent Loads, Network Reconfiguration, and CO2 Emissions</article-title>. <source>Int. J. Electr. Power Energ. Syst.</source> <volume>135</volume>, <fpage>107541</fpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2021.107541</pub-id> </citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohammadi Fathabad</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Pan</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Qiu</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Data-driven Planning for Renewable Distributed Generation in Distribution Systems</article-title>. <source>IEEE Trans. Power Syst.</source> (<issue>99</issue>), <fpage>1</fpage> </citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohammadi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Soleymani</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Mozafari</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Scenario-Based Stochastic Operation Management of Microgrid Including Wind, Photovoltaic, Micro-turbine, Fuel Cell and Energy Storage Devices</article-title>. <source>Int. J. Electr. Power Energ. Syst.</source> <volume>54</volume>, <fpage>525</fpage>&#x2013;<lpage>535</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2013.08.004</pub-id> </citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohandes</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Wahbah</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Moursi</surname>
<given-names>M. S. E.</given-names>
</name>
<name>
<surname>El-Fouly</surname>
<given-names>T. H. M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Renewable Energy Management System: Optimum Design and Hourly Dispatch</article-title>. <source>IEEE Trans. Sustain. Energ.</source> <volume>12</volume> (<issue>3</issue>), <fpage>1615</fpage>&#x2013;<lpage>1628</lpage>. <pub-id pub-id-type="doi">10.1109/tste.2021.3058252</pub-id> </citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mu&#xf1;oz-Delgado</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Contreras</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Arroyo</surname>
<given-names>J. M.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Multistage Generation and Network Expansion Planning in Distribution Systems Considering Uncertainty and Reliability</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>31</volume> (<issue>5</issue>), <fpage>3715</fpage>&#x2013;<lpage>3728</lpage>. <pub-id pub-id-type="doi">10.1109/TPWRS.2015.2503604</pub-id> </citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ouyang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yao</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Distribution Network Planning Method Considering Distributed Generation for Peak Cutting</article-title>. <source>Energ. Convers. Manag.</source> <volume>51</volume> (<issue>12</issue>), <fpage>2394</fpage>&#x2013;<lpage>2401</lpage>. <pub-id pub-id-type="doi">10.1016/j.enconman.2010.05.003</pub-id> </citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Roy Ghatak</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Sannigrahi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Acharjee</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Optimised Planning of Distribution Network with Photovoltaic System, Battery Storage, and DSTATCOM</article-title>. <source>IET Renew. Power Generation</source> <volume>12</volume> (<issue>15</issue>), <fpage>1823</fpage>&#x2013;<lpage>1832</lpage>. <pub-id pub-id-type="doi">10.1049/iet-rpg.2018.5088</pub-id> </citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sedghi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ahmadian</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Aliakbar-Golkar</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Optimal Storage Planning in Active Distribution Network Considering Uncertainty of Wind Power Distributed Generation</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>31</volume> (<issue>1</issue>), <fpage>304</fpage>&#x2013;<lpage>316</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrs.2015.2404533</pub-id> </citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sedghi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Aliakbar-Golkar</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Haghifam</surname>
<given-names>M.-R.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Distribution Network Expansion Considering Distributed Generation and Storage Units Using Modified PSO Algorithm</article-title>. <source>Int. J. Electr. Power Energ. Syst.</source> <volume>52</volume>, <fpage>221</fpage>&#x2013;<lpage>230</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijepes.2013.03.041</pub-id> </citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Low</surname>
<given-names>S. H.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Optimal Placement of Energy Storage in Distribution Networks</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>8</volume> (<issue>6</issue>), <fpage>3094</fpage>&#x2013;<lpage>3103</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2017.2711921</pub-id> </citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tar&#xf4;co</surname>
<given-names>C. G.</given-names>
</name>
<name>
<surname>Takahashi</surname>
<given-names>R. H. C.</given-names>
</name>
<name>
<surname>Carrano</surname>
<given-names>E. G.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Multiobjective Planning of Power Distribution Networks with Facility Location for Distributed Generation</article-title>. <source>Elect. Power Syst. Res.</source> <volume>141</volume>, <fpage>562</fpage> </citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ugranl&#x131;</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Probabilistic Distribution Planning: Including the Interactions between Chance Constraints and Renewable Energy</article-title>. <source>Sustain. Energ. Grids Netw.</source> <volume>23</volume>, <fpage>100372</fpage>. </citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Begovic</surname>
<given-names>M. M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Robust Optimization Based Optimal DG Placement in Microgrids</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>5</volume> (<issue>5</issue>), <fpage>2173</fpage>&#x2013;<lpage>2182</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2014.2321748</pub-id> </citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xing</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zeng</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Active Distribution Network Expansion Planning Integrating Dispersed Energy Storage Systems</article-title>. <source>IET Generation, Transm. Distribution</source> <volume>10</volume> (<issue>3</issue>), <fpage>638</fpage>&#x2013;<lpage>644</lpage>. <pub-id pub-id-type="doi">10.1049/iet-gtd.2015.0411</pub-id> </citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Kang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Kirschen</surname>
<given-names>D. S.</given-names>
</name>
<name>
<surname>Xia</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Xi</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2013</year>). <article-title>Planning Pumped Storage Capacity for Wind Power Integration</article-title>. <source>IEEE Trans. Sustain. Energ.</source> <volume>4</volume> (<issue>2</issue>), <fpage>393</fpage>&#x2013;<lpage>401</lpage>. <pub-id pub-id-type="doi">10.1109/tste.2012.2226067</pub-id> </citation>
</ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>Z. Y.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Meng</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Wong</surname>
<given-names>K. P.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Optimal Allocation of Battery Energy Storage Systems in Distribution Networks with High Wind Power Penetration</article-title>. <source>IET Renew. Power Generation</source> <volume>10</volume> (<issue>8</issue>), <fpage>1105</fpage>&#x2013;<lpage>1113</lpage>. <pub-id pub-id-type="doi">10.1049/iet-rpg.2015.0542</pub-id> </citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ziari</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Ledwich</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Ghosh</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Platt</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Optimal Distribution Network Reinforcement Considering Load Growth, Line Loss, and Reliability</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>28</volume> (<issue>2</issue>), <fpage>587</fpage>&#x2013;<lpage>597</lpage>. <pub-id pub-id-type="doi">10.1109/tpwrs.2012.2211626</pub-id> </citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zimmerman</surname>
<given-names>R. D.</given-names>
</name>
<name>
<surname>Murillo-S&#xe1;nchez</surname>
<given-names>C. E.</given-names>
</name>
<name>
<surname>Thomas</surname>
<given-names>R. J.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>MATPOWER: Steady-State Operations, Planning and Analysis Tools for Power Systems Research and Education</article-title>. <source>IEEE Trans. Power Syst.</source> <volume>26</volume>, <fpage>12</fpage>. </citation>
</ref>
</ref-list>
</back>
</article>