<?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">1086577</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2022.1086577</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A data-driven hybrid interval reactive power optimization based on the security limits method and improved particle swarm optimization</article-title>
<alt-title alt-title-type="left-running-head">Chen et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fenrg.2022.1086577">10.3389/fenrg.2022.1086577</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Chen</surname>
<given-names>Dawen</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Qu</surname>
<given-names>Shaoqing</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Liu</surname>
<given-names>Qian</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2078248/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Xiao</surname>
<given-names>Wei</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Liu</surname>
<given-names>Xiao</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Luo</surname>
<given-names>Yufeng</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Yang</surname>
<given-names>Huaizhi</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1493597/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Kuang</surname>
<given-names>Na</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Changsha Power Supply Branch</institution>, <institution>State Grid Hunan Electric Power Co., Ltd</institution>, <addr-line>Changsha</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>College of Electrical and Information Engineering</institution>, <institution>Hunan University</institution>, <addr-line>Changsha</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>School of Educational Science</institution>, <institution>Hunan Normal University</institution>, <addr-line>Changsha</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/1235831/overview">Xue Lyu</ext-link>, University of Wisconsin-Madison, United States</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/1433667/overview">Dongliang Xiao</ext-link>, South China University of Technology, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1429899/overview">Xueqian Fu</ext-link>, China Agricultural University, China</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Qian Liu, <email>liuqian365@hnu.edu.cn</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Smart Grids, a section of the journal Frontiers in Energy Research</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>19</day>
<month>01</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>10</volume>
<elocation-id>1086577</elocation-id>
<history>
<date date-type="received">
<day>01</day>
<month>11</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>01</day>
<month>12</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Chen, Qu, Liu, Xiao, Liu, Luo, Yang and Kuang.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Chen, Qu, Liu, Xiao, Liu, Luo, Yang and Kuang</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>The integration of renewable power generation introduces randomness and uncertainties in power systems, and the reactive power optimization with interval uncertainty (RPOIU) problem has been constructed to acquire the voltage control strategy. However, the large amount of uncertain data and the coexistence of discrete and continuous control variables increase the difficulty of solving the RPOIU problem. This paper proposes a data-driven hybrid interval reactive power optimization based on the security limits method (SLM) and the improved particle swarm optimization (IPSO) to solve the RPOIU problem. In this method, the large amount of historical uncertain data is processed by data-driven to obtain the boundary of optimal uncertainty set. The control variable optimization is decomposed into continuous variable optimization and discrete variable optimization. The continuous variables are optimized by applying the SLM with the discrete variables fixed, and the discrete variables are optimized by the IPSO with the continuous variables fixed. The two processes are applied alternately, and the values of the control variables obtained by each method are used as the fixed variables of the other method. Based on simulations carried out for the IEEE 30-bus system with three optimization methods, we verified that the voltage control strategy obtained by the data-driven hybrid optimization could ensure that the state variable intervals satisfied the constraints. Meanwhile, the values of the real power losses obtained by the proposed method were smaller than those obtained by the SLM and IPSO. The simulation results demonstrated the effectiveness and value of the proposed method.</p>
</abstract>
<kwd-group>
<kwd>renewable power generation</kwd>
<kwd>data-driven hybrid optimization</kwd>
<kwd>interval reactive power optimization</kwd>
<kwd>security limits method</kwd>
<kwd>particle swarm optimization</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Reactive power optimization is directly related to the security and economy of a power system. There is inherent randomness and volatility with renewable energy resources (RESs), including wind and photovoltaic power, so that the data of the RES output and the power load demand are generally uncertain in the power system. There will be voltage security problems under the effects of these uncertainties. Therefore, it is necessary to construct an uncertain reactive power optimization (URPO) strategy to realize voltage security control while handling the uncertainties. The URPO model incorporates the general reactive power flow (RPF) model with uncertain data, aiming at improving the voltage profile and reducing the loss.</p>
<p>Some approaches have been proposed to solve the URPO model, which is non-convex and non-linear. These approaches mainly include probabilistic programming, robust programming, and interval programming. The probabilistic approach acquires the specific probability distribution of the uncertain data, because it considers them to be random variables. This process represents the RPO model as an expectation model or chance-constrained programming model and obtains the results under a stated confidence level (<xref ref-type="bibr" rid="B1">Arefifar and Mohamed, 2014</xref>; <xref ref-type="bibr" rid="B9">Liu et al., 2016</xref>). Probabilistic programming requires a large amount of historical data, while the amount of data is generally limited, causing a bias of the empirical distribution. A data-driven modeling approach is introduced to address the issue, and the model is formulated as a two-stage problem, where the first-stage variables find the optimal control for discrete reactive power compensation equipment and the second-stage variables are adjusted to an uncertain probability distribution (<xref ref-type="bibr" rid="B3">Ding et al., 2018</xref>). A scenario-based two-stage stochastic optimization framework is also developed in (<xref ref-type="bibr" rid="B13">Saraswat et al., 2020</xref>) to minimize the total real power losses in the transmission network. To solve the URPO issue of two conflicting objective functions, the active power loss and voltage deviation are minimized simultaneously, and appropriate probability distribution functions are considered to model the stochastic behavior of wind and solar power generation with the Monte Carlo simulation (MCS) technique (<xref ref-type="bibr" rid="B6">Keerio et al., 2020</xref>). These probabilistic processes are quite time-consuming, and the probability distribution of uncertainties is rough due to the limited data.</p>
<p>In contrast, robust programming considers the uncertainties to be from various sets, such as box, cone, or ellipsoid sets, without assuming the probability distribution functions. A two-stage distributed robust optimization model for optimal operation is formulated considering wind-power-uncertainty-based data-driven methods, where the polyhedra-based linearization method is introduced to approximate the second-order cone power flow constraints with a series of linear constraints (<xref ref-type="bibr" rid="B4">Gao et al., 2021</xref>). To improve the computational performance, a second-order cone relaxation and decomposition algorithm is proposed to solve the multi-period reactive power optimization problem (<xref ref-type="bibr" rid="B10">Liu et al., 2017</xref>). The processes obtain the results with good robustness, while the accuracy of the robust programming model is low due to the linearization. Furthermore, there will be infeasible solutions sometimes because robust optimization is only applicable to convex models, while the general URPO model is non-convex.</p>
<p>The development of interval programming has addressed the issues of probabilistic and robust approaches. This approach expresses the uncertain data as intervals and therefore establishes the RPOIU problem in which the state variables are regarded as intervals. Notably, the control variables include both continuous (generator voltage) and discrete (transformer ratio and reactive power compensation) variables. Interval programming can ensure that the ranges of the state variables are completely confined within the security constraints. The methods for solving the RPOIU problem mainly include intelligent algorithms and mathematical processing. To solve the RPOIU model, the genetic algorithm (GA) is employed as the solution algorithm, where the reliable power flow calculation is used to judge the constraints of the model (<xref ref-type="bibr" rid="B17">Zhang et al., 2017</xref>). The improved genetic algorithm (IGA) is proposed to solve the problem that the simple GA is inefficient in the application of power system reactive power optimization, where the coding method, fitness function, initial population generation, and crossover and mutation strategy are modified (<xref ref-type="bibr" rid="B2">Chang and Zhang, 2017</xref>; <xref ref-type="bibr" rid="B12">Liu et al., 2022</xref>). Particle swarm optimization (PSO) is also widely applied to solve this problem (<xref ref-type="bibr" rid="B8">Li et al., 2017</xref>; <xref ref-type="bibr" rid="B7">Khan et al., 2020</xref>; <xref ref-type="bibr" rid="B14">Shri et al., 2021</xref>). An improved particle swarm optimization and Pareto archive algorithm are combined to solve the multi-objective reactive power optimization problem, and it outperforms the non-dominated sorting genetic algorithm II (NSGA-II) (<xref ref-type="bibr" rid="B11">Liu et al., 2021</xref>).</p>
<p>For the application of mathematical processing, the linear approximation method is formulated using the interval Taylor extension to help solve the RPOIU model (<xref ref-type="bibr" rid="B5">Jiang et al., 2014</xref>; <xref ref-type="bibr" rid="B19">Zhang et al., 2018b</xref>). In order to improve the accuracy of the approximation, the interval sequential quadratic programming method (ISQPM), which employs a second-order interval Taylor expansion, is proposed (<xref ref-type="bibr" rid="B18">Zhang et al., 2019</xref>). In addition, the security limits method (SLM) is defined to solve the RPOIU problem, and the model is switched to two deterministic reactive power optimization models (<xref ref-type="bibr" rid="B15">Zhang et al., 2018a</xref>).</p>
<p>It is noted again that the coexistence of discrete and continuous variables increases the difficulty of solving the RPOIU problem, and the accuracy when solving the problem by applying a single algorithm is generally low. Considering the above interval approaches, mathematical processing can deal with the continuous variables well, and intelligent algorithms are better at handling discrete variables. Therefore, the problem of mixed-variable processing can be addressed by a co-evolution method, which adopts a mathematical method to deal with continuous variables and an intelligent algorithm to deal with discrete variables to solve the RPOIU problem.</p>
<p>The present work establishes a hybrid interval reactive power optimization algorithm considering the uncertainty of RESs. The algorithm uses interval programming to deal with uncertainties and decomposes the control variable optimization into two subproblems: continuous variable optimization and discrete variable optimization. Since the SLM can reduce the conservation of the interval reactive power optimization algorithm and has a better performance in searching for the optimal solution than other mathematical methods, the SLM is applied for continuous variable optimization. Since the PSO has faster convergence rate and simpler processes, the improved PSO (IPSO) is applied for discrete variable optimization. There are the algorithm alternations between these processes.</p>
<p>The construction of the RPOIU problem is presented in <xref ref-type="sec" rid="s2">Section 2</xref>, followed by the hybrid optimization of the SLM and IPSO for solving the RPOIU problem in <xref ref-type="sec" rid="s3">Section 3</xref>. The simulations employed to demonstrate the performance of the proposed method are presented in <xref ref-type="sec" rid="s4">Section 4</xref>. The conclusions and contributions of this paper are given in <xref ref-type="sec" rid="s5">Section 5</xref>.</p>
</sec>
<sec id="s2">
<title>2 Modeling of reactive power optimization with interval uncertainty (RPOIU) based on data-driven</title>
<p>As mentioned above, the large amount of historical uncertain data is processed by data-driven to obtain the boundary value of the uncertainties, and the input data of the power grid associated with uncertainties can be described as intervals, including power generation <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, active load demand <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and reactive load demand <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>Q</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, which are expressed as <inline-formula id="inf4">
<mml:math id="m4">
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf5">
<mml:math id="m5">
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf6">
<mml:math id="m6">
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, respectively. The RPOIU problem is modeled with the real power losses <inline-formula id="inf7">
<mml:math id="m7">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">l</mml:mi>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> as the objective function and power flow equations, security, and operational limits as constraints:<disp-formula id="e1">
<mml:math id="m8">
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">l</mml:mi>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:munder>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:munder>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>cos</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
</p>
<p>s.t.<disp-formula id="e2">
<mml:math id="m9">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<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 mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
<disp-formula id="e3">
<mml:math id="m10">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>P</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mover accent="true">
<mml:mi>Q</mml:mi>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
<disp-formula id="e4">
<mml:math id="m11">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<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 mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
<disp-formula id="e5">
<mml:math id="m12">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
<disp-formula id="e6">
<mml:math id="m13">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
<disp-formula id="e7">
<mml:math id="m14">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
</mml:msub>
<mml:mo>&#x222a;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<disp-formula id="e8">
<mml:math id="m15">
<mml:mrow>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
<disp-formula id="e9">
<mml:math id="m16">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">T</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>Here<disp-formula id="e10">
<mml:math id="m17">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:munder>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>cos</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>sin</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
<disp-formula id="e11">
<mml:math id="m18">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:munder>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
</mml:mstyle>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>sin</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<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:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>cos</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
</p>
<p>Moreover, <inline-formula id="inf8">
<mml:math id="m19">
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the subset of whole system buses, <inline-formula id="inf9">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the set of all generator buses, <inline-formula id="inf10">
<mml:math id="m21">
<mml:mrow>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the set of renewable power generator buses (except the slack bus), <inline-formula id="inf11">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the slack bus, where there is generally only one, <inline-formula id="inf12">
<mml:math id="m23">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the set of load buses, <inline-formula id="inf13">
<mml:math id="m24">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">C</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the index set of load buses with compensators, and <inline-formula id="inf14">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">T</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the index set of transformer branches. Eq. <xref ref-type="disp-formula" rid="e1">1</xref> is the objective function, where <inline-formula id="inf15">
<mml:math id="m26">
<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="inf16">
<mml:math id="m27">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the voltage magnitude and bus angle at bus <italic>i</italic>, respectively, <inline-formula id="inf17">
<mml:math id="m28">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf18">
<mml:math id="m29">
<mml:mrow>
<mml:msub>
<mml:mi>G</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf19">
<mml:math id="m30">
<mml:mrow>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the real and imaginary parts of the admittance matrix, respectively. Eqs <xref ref-type="disp-formula" rid="e2">2</xref>&#x2013;<xref ref-type="disp-formula" rid="e4">4</xref> are the power flow equations with interval uncertainties, where <inline-formula id="inf20">
<mml:math id="m31">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the active load generation, <inline-formula id="inf21">
<mml:math id="m32">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the active power generation of slack bus, <inline-formula id="inf22">
<mml:math id="m33">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the reactive power generation, <inline-formula id="inf23">
<mml:math id="m34">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">L</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the reactive load generation, <inline-formula id="inf24">
<mml:math id="m35">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the reactive power compensation of the capacitor, <inline-formula id="inf25">
<mml:math id="m36">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> (Eq <xref ref-type="disp-formula" rid="e10">10</xref>) and <inline-formula id="inf26">
<mml:math id="m37">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> (Eq <xref ref-type="disp-formula" rid="e11">11</xref>) are the injected active and reactive power at bus <italic>i</italic>, respectively. Eqs <xref ref-type="disp-formula" rid="e5">5</xref>&#x2013;<xref ref-type="disp-formula" rid="e9">9</xref> are the security and operational constraints, where <inline-formula id="inf27">
<mml:math id="m38">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the tap position of the transformer. The lower and upper limits of the variables are identified with the superscripts &#x201c;min&#x201d; and &#x201c;max,&#x201d; respectively.</p>
<p>All the variables in the RPOIU model can be divided into state variables and control variables. The state variables include the voltage magnitudes of the load buses, bus angle, and reactive power generation. The control variables include the generator voltage, transformer ratio, and reactive power compensation. Therefore, the formulation of the RPOIU model can be simplified by expressing the vector of state variables as <inline-formula id="inf28">
<mml:math id="m39">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and the set of control variables as <inline-formula id="inf29">
<mml:math id="m40">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x3bc;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>:<disp-formula id="e12">
<mml:math id="m41">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>f</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>f</mml:mi>
<mml:mi mathvariant="normal">U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi mathvariant="normal">U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mi>min</mml:mi>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mi>max</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>where <inline-formula id="inf30">
<mml:math id="m42">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents the real power losses of the RES power system, which is an interval and can be expressed as <inline-formula id="inf31">
<mml:math id="m43">
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>f</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>f</mml:mi>
<mml:mi mathvariant="normal">U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf32">
<mml:math id="m44">
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi mathvariant="normal">U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> is the variation vector of the power input data in Eqs <xref ref-type="disp-formula" rid="e2">2</xref>&#x2013;<xref ref-type="disp-formula" rid="e4">4</xref>, and <inline-formula id="inf33">
<mml:math id="m45">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi mathvariant="normal">U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> represent the deterministic input data. <inline-formula id="inf34">
<mml:math id="m46">
<mml:mrow>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represents all security and operational constraints, <inline-formula id="inf35">
<mml:math id="m47">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mi>min</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf36">
<mml:math id="m48">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">g</mml:mi>
<mml:mi>max</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> are the lower and upper limits, respectively.</p>
<p>To express the model more conveniently, the bus order of the system is adjusted. Assuming that the slack bus is denoted by index 1, the number of all system buses is <italic>n</italic>, the number of generator buses is <italic>m</italic> (including the slack bus), the number of buses with the reactive power capacitor is <italic>r</italic>, and the number of transformers is <italic>k</italic>. The generator buses are denoted by index numbers in the range from two to <italic>m</italic>, the load buses are denoted by index numbers from <italic>m</italic>&#x2b;1 to <italic>n</italic>, and the load buses with the reactive power capacitor are denoted by index numbers from <italic>m</italic>&#x2b;1 to <italic>m</italic> &#x2b; <italic>r</italic>. Therefore, the vectors of state and control variables are expressed as <inline-formula id="inf37">
<mml:math id="m49">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi mathvariant="normal">T</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf38">
<mml:math id="m50">
<mml:mrow>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>m</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>m</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi mathvariant="normal">T</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, respectively.</p>
<p>It is noted that the output of the reactive power compensator <inline-formula id="inf39">
<mml:math id="m51">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>m</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>m</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and transformer ratios <inline-formula id="inf40">
<mml:math id="m52">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are discrete, and the voltages of the generators <inline-formula id="inf41">
<mml:math id="m53">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are continuous for the control variable vector <inline-formula id="inf42">
<mml:math id="m54">
<mml:mrow>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. There are interval variables within the state variable vector <inline-formula id="inf43">
<mml:math id="m55">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. Accordingly, the RPOIU problem is a non-linear model that requires the hybrid processing of continuous and discrete variables.</p>
</sec>
<sec id="s3">
<title>3 Hybrid optimization for solving the RPOIU problem based on security limits method (SLM) and improved particle swarm optimization (IPSO)</title>
<p>The hybrid interval reactive power optimization algorithm adopts the SLM and IPSO to process the RPOIU problem alternately. The SLM is applied to deal with the continuous variables in the model to improve the efficiency and optimization effect of the model and ensure that the load voltage is not off-limit in all scenarios. The IPSO is applied to deal with the discrete variables in the model to avoid the problem that the continuous rounding of discrete quantities may lead to inaccurate or even infeasible solutions. It is noted that the power flow equations with interval uncertainties are solved by the optimizing-scenarios method (OSM) (<xref ref-type="bibr" rid="B16">Zhang et al., 2018c</xref>).</p>
<sec id="s3-1">
<title>3.1 SLM-based continuous variable processing</title>
<p>The RPOIU model is solved by the SLM under the condition that the discrete variables <inline-formula id="inf44">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf45">
<mml:math id="m57">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are fixed at stable values to obtain the optimal continuous variables <inline-formula id="inf46">
<mml:math id="m58">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. The specific process of the SLM is to define the determined security limits, and the interior point method (IPM) is used to solve the deterministic RPO model, which is modified by the security limits. Then, the optimal continuous variable is acquired.</p>
<p>Since the inequality constraints (5)&#x2013;(9) in the RPOIU model are all univariate, the model can be expressed as follows:<disp-formula id="e13">
<mml:math id="m59">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>f</mml:mi>
<mml:mi mathvariant="normal">L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>f</mml:mi>
<mml:mi mathvariant="normal">U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>min</mml:mi>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>max</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>where <inline-formula id="inf47">
<mml:math id="m60">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is a vector composed of the load bus voltage magnitudes and reactive power generation of the generator buses, and <inline-formula id="inf48">
<mml:math id="m61">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf49">
<mml:math id="m62">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the upper and lower bounds, respectively. The vector composed of bus angles and real power generation of the slack bus is denoted as <inline-formula id="inf50">
<mml:math id="m63">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. Then, the vector of state variables is <inline-formula id="inf51">
<mml:math id="m64">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi mathvariant="normal">T</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi mathvariant="normal">T</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi mathvariant="normal">T</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>. <inline-formula id="inf52">
<mml:math id="m65">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>max</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf53">
<mml:math id="m66">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>min</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> are the upper and lower bounds of the vector of control variables <inline-formula id="inf54">
<mml:math id="m67">
<mml:mrow>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, respectively.</p>
<p>To obtain the maximum radii of the interval variables, a vector consisting of the maximum radii of the state variables is defined as <inline-formula id="inf55">
<mml:math id="m68">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, which is formulated as follows and can be computed through the OSM and MCS (<xref ref-type="bibr" rid="B15">Zhang et al., 2018a</xref>):<disp-formula id="e14">
<mml:math id="m69">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x3d;</mml:mo>
<mml:munder>
<mml:mi>max</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>min</mml:mi>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>max</mml:mi>
</mml:msup>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="|" close="" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>where <inline-formula id="inf56">
<mml:math id="m70">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the radius of the <italic>i</italic>th variable in <inline-formula id="inf57">
<mml:math id="m71">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>According to <inline-formula id="inf58">
<mml:math id="m72">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>, the security limits of the RPOIU model are defined as follows:<disp-formula id="e15">
<mml:math id="m73">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mover accent="true">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mover accent="true">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
</p>
<p>Apparently, (15) represents the worst-case security bounds, while the difference between the security limit <inline-formula id="inf59">
<mml:math id="m74">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> (or <inline-formula id="inf60">
<mml:math id="m75">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> ) and the original limit <inline-formula id="inf61">
<mml:math id="m76">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> (or <inline-formula id="inf62">
<mml:math id="m77">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> ) is close to <inline-formula id="inf63">
<mml:math id="m78">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. In order to reduce the conservation of the proposed security limits, the interval ratio <inline-formula id="inf64">
<mml:math id="m79">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mi>I</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is introduced to modify the definition of the security limits, and it is expressed as follows assuming that the control variables <inline-formula id="inf65">
<mml:math id="m80">
<mml:mrow>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> are fixed at <inline-formula id="inf66">
<mml:math id="m81">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>min</mml:mi>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>max</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>:<disp-formula id="e16">
<mml:math id="m82">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mi>I</mml:mi>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:munder accentunder="true">
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#xaf;</mml:mo>
</mml:munder>
</mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:munder accentunder="true">
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#xaf;</mml:mo>
</mml:munder>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>where <inline-formula id="inf67">
<mml:math id="m83">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the state variables acquired by solving the equations <inline-formula id="inf68">
<mml:math id="m84">
<mml:mrow>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf69">
<mml:math id="m85">
<mml:mrow>
<mml:munder accentunder="true">
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#xaf;</mml:mo>
</mml:munder>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf70">
<mml:math id="m86">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> are the lower and upper bounds of the state variable intervals obtained by solving the equations <inline-formula id="inf71">
<mml:math id="m87">
<mml:mrow>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>Assuming that the interval ratio corresponding to <inline-formula id="inf72">
<mml:math id="m88">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is <inline-formula id="inf73">
<mml:math id="m89">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>I</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, the security limits are modified as follows:<disp-formula id="e17">
<mml:math id="m90">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>2</mml:mn>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>I</mml:mi>
</mml:msubsup>
<mml:mover accent="true">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>I</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mo>&#x394;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>where <inline-formula id="inf74">
<mml:math id="m91">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mi>I</mml:mi>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. It should be noted that there may be a violation when applying the modified security limits (17), because the interval ratio <inline-formula id="inf75">
<mml:math id="m92">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">k</mml:mi>
<mml:mi>I</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is defined at the midpoint of the control variables, while the state variables are not usually obtained at <inline-formula id="inf76">
<mml:math id="m93">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. Accordingly, the correction coefficients <inline-formula id="inf77">
<mml:math id="m94">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf78">
<mml:math id="m95">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are introduced to avoid the violation, and the corrected security limits are expressed as follows:<disp-formula id="e18">
<mml:math id="m96">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>S</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>S</mml:mi>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(18)</label>
</disp-formula>where <inline-formula id="inf79">
<mml:math id="m97">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the extent that <inline-formula id="inf80">
<mml:math id="m98">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> exceeds <inline-formula id="inf81">
<mml:math id="m99">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf82">
<mml:math id="m100">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the extent that <inline-formula id="inf83">
<mml:math id="m101">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> exceeds <inline-formula id="inf84">
<mml:math id="m102">
<mml:mrow>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>. If there is no violation, <inline-formula id="inf85">
<mml:math id="m103">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> or <inline-formula id="inf86">
<mml:math id="m104">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b4;</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>Therefore, the RPOIU model can be transformed to a deterministic RPO model through Eqs <xref ref-type="disp-formula" rid="e15">15</xref>&#x2013;<xref ref-type="disp-formula" rid="e18">18</xref>, expressed as follows:<disp-formula id="e19">
<mml:math id="m105">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="bold-italic">&#x3be;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>min</mml:mi>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi>S</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:msubsup>
<mml:mi mathvariant="bold-italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext>&#x2003;</mml:mtext>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>min</mml:mi>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">u</mml:mi>
<mml:mi>max</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:math>
<label>(19)</label>
</disp-formula>where <inline-formula id="inf87">
<mml:math id="m106">
<mml:mrow>
<mml:mi mathvariant="bold-italic">&#x3be;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is any vector in the interval <inline-formula id="inf88">
<mml:math id="m107">
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf89">
<mml:math id="m108">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="bold-italic">u</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the predictive value of the real power losses at the midpoint <inline-formula id="inf90">
<mml:math id="m109">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi mathvariant="bold-italic">h</mml:mi>
<mml:mi>U</mml:mi>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. It is noted that if the state variables of deterministic model (16) are restricted within the security limits, the state variable intervals of the RPOIU model must be within their limits.</p>
</sec>
<sec id="s3-2">
<title>3.2 IPSO-based discrete variable processing</title>
<p>PSO is applied to deal with the discrete variables <inline-formula id="inf91">
<mml:math id="m110">
<mml:mrow>
<mml:msub>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf92">
<mml:math id="m111">
<mml:mrow>
<mml:msub>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> when solving the RPOIU model, and the continuous variables <inline-formula id="inf93">
<mml:math id="m112">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msubsup>
<mml:mi>S</mml:mi>
<mml:mi mathvariant="normal">G</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> are fixed. Each variable in the population is regarded as a particle in the PSO, and the position and speed of each particle can be obtained. It should be noted that the values of the state variables corresponding to the particles should satisfy the constraint condition. Accordingly, the fitness value corresponding to each particle can be acquired. The fitness value is the midpoint of the real power losses, and the corresponding fitness function has a penalty term.</p>
<p>The position of each particle in the search space is represented as <inline-formula id="inf94">
<mml:math id="m113">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, and the speed is represented as <inline-formula id="inf95">
<mml:math id="m114">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. The speed and position updating rules are expressed respectively as follows:<disp-formula id="e20">
<mml:math id="m115">
<mml:mrow>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(20)</label>
</disp-formula>
<disp-formula id="e21">
<mml:math id="m116">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(21)</label>
</disp-formula>where <inline-formula id="inf96">
<mml:math id="m117">
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf97">
<mml:math id="m118">
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> are the learning parameters, which are usually taken as 2, <inline-formula id="inf98">
<mml:math id="m119">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is a random number within <inline-formula id="inf99">
<mml:math id="m120">
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mn>0,1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf100">
<mml:math id="m121">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the best solution of the <italic>i</italic>th particle, and <inline-formula id="inf101">
<mml:math id="m122">
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the global best solution of the whole population. <inline-formula id="inf102">
<mml:math id="m123">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the inertia factor, which is formulated as follows by the linearly decreasing weight (LDW) strategy:<disp-formula id="e22">
<mml:math id="m124">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</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:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mi>G</mml:mi>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3c9;</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>
<label>(22)</label>
</disp-formula>where <inline-formula id="inf103">
<mml:math id="m125">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the initial inertia weight, <inline-formula id="inf104">
<mml:math id="m126">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</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> is the inertial weight at the maximum iteration number, <inline-formula id="inf105">
<mml:math id="m127">
<mml:mrow>
<mml:mi>G</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the maximum number of iterations, and <italic>t</italic> is the current iteration time.</p>
<p>PSO is a global optimization method with a strong global search ability. However, it cannot make full use of the feedback information in the population, resulting in a poor local optimization ability, and the optimal value in the neighborhood of the <inline-formula id="inf106">
<mml:math id="m128">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is often ignored. In order to address this issue, a local search around <inline-formula id="inf107">
<mml:math id="m129">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is added in the PSO. The improvement of <inline-formula id="inf108">
<mml:math id="m130">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is determined as follows:<disp-formula id="e23">
<mml:math id="m131">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>&#x22c5;</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
<mml:mo>&#x22c5;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mn>0.5</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>&#x22c5;</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
<mml:mo>&#x22c5;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="normal">e</mml:mi>
<mml:mi mathvariant="normal">l</mml:mi>
<mml:mi mathvariant="normal">s</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(23)</label>
</disp-formula>where <italic>step</italic> is the initial step length of the local search. The relationship between the global and local optima is well balanced through the improvement of <inline-formula id="inf109">
<mml:math id="m132">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, allowing the algorithm to avoid falling into local optima and improving the accuracy of the PSO.</p>
<p>The discrete variables are processed by a crossover operation in the IPSO, including the crossover between the particle and itself and the crossover between the particle and optimal individuals. The crossover process can be expressed as follows:<disp-formula id="e24">
<mml:math id="m133">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(24)</label>
</disp-formula>where <inline-formula id="inf110">
<mml:math id="m134">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the discrete variables that require the crossover operation, <italic>c</italic> is a random number in [0,1], <inline-formula id="inf111">
<mml:math id="m135">
<mml:mrow>
<mml:msubsup>
<mml:mi>u</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>max</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the maximum of the transformer ratio and reactive power compensation, and <inline-formula id="inf112">
<mml:math id="m136">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents the optimal individuals including <inline-formula id="inf113">
<mml:math id="m137">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf114">
<mml:math id="m138">
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mi>B</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3-3">
<title>3.3 Hybrid optimization based on SLM and IPSO</title>
<p>The RPOIU problem is solved through the hybrid optimization of SLM and IPSO. The values of the continuous variables obtained by SLM are applied as fixed continuous variable values in the IPSO, and the values of the discrete variables obtained by the IPSO are applied as fixed discrete variable values in the SLM. The two methods are applied to solve the RPOIU model alternately, and the values of the control variables are interactive. The final solution of the control variables when solving the RPOIU problem is obtained when the control variable values obtained by the two methods are consistent. Because the discrete variable values obtained by the IPSO are directly used by the SLM, the values of the continuous variables are used for the termination criterion. For convenience, in the example below, when the difference of the continuous variable values between the two methods was less than 0.01, the control variables values were considered to be approximately consistent. Accordingly, the detailed procedure of the hybrid optimization based on the SLM and IPSO is described as follows. It is noted again that the intervals of the state variables are obtained by using the OSM, and they should satisfy the constraints. The flow chart of the proposed method is presented in <xref ref-type="fig" rid="F1">Figure 1</xref>.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Procedure of the hybrid processing based on security limits method (SLM) and improved particle swarm optimization (IPSO) for solving the reactive power optimization with interval uncertainty (RPOIU) problem.</p>
</caption>
<graphic xlink:href="fenrg-10-1086577-g001.tif"/>
</fig>
<p>The steps of the proposed algorithm are as follows:</p>
<p>Step (1) Input the power grid parameters and intervals of the power data and set the parameters of SLM and IPSO.</p>
<p>Step (2) Generate the initial values <inline-formula id="inf115">
<mml:math id="m139">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>0</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf116">
<mml:math id="m140">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mn>0</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf117">
<mml:math id="m141">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mn>0</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> randomly in the feasible region of the control variables.</p>
<p>Step (3) Set <inline-formula id="inf118">
<mml:math id="m142">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mn>0</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf119">
<mml:math id="m143">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>. Here, <inline-formula id="inf120">
<mml:math id="m144">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the fixed value in the IPSO and <italic>k</italic> is the time of circulation.</p>
<p>Step (4) Keep <inline-formula id="inf121">
<mml:math id="m145">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> stable and apply the IPSO to solve the RPOIU model to obtain the optimal discrete variables <inline-formula id="inf122">
<mml:math id="m146">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf123">
<mml:math id="m147">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>Step (5) Set <inline-formula id="inf124">
<mml:math id="m148">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf125">
<mml:math id="m149">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula id="inf126">
<mml:math id="m150">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf127">
<mml:math id="m151">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are the fixed values in the SLM, respectively.</p>
<p>Step (6) Keep <inline-formula id="inf128">
<mml:math id="m152">
<mml:mrow>
<mml:msubsup>
<mml:mi>Q</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">C</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf129">
<mml:math id="m153">
<mml:mrow>
<mml:msubsup>
<mml:mi>T</mml:mi>
<mml:mi>l</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> stable and apply the SLM to solve the RPOIU model to obtain the optimal continuous variable <inline-formula id="inf130">
<mml:math id="m154">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>Step (7) Determine whether the difference between <inline-formula id="inf131">
<mml:math id="m155">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf132">
<mml:math id="m156">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is less than 0.01. If it is, stop the iteration process and print results. Otherwise, set <inline-formula id="inf133">
<mml:math id="m157">
<mml:mrow>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>V</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>k</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf134">
<mml:math id="m158">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, then return to Step (4).</p>
</sec>
</sec>
<sec id="s4">
<title>4 Simulation results</title>
<p>In this section, the simulations conducted for an IEEE 30-bus system are discussed to demonstrate the effectiveness and superiority of the hybrid optimization based on the SLM and IPSO in solving the RPOIU model problem. The results obtained by the proposed method are compared with those obtained by the SLM and IPSO. All parameters in the simulations were assigned values in a per-unit system, with 100 <inline-formula id="inf135">
<mml:math id="m159">
<mml:mrow>
<mml:mi mathvariant="normal">M</mml:mi>
<mml:mi mathvariant="normal">V</mml:mi>
<mml:mo>&#x2022;</mml:mo>
<mml:mi mathvariant="normal">A</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> set as the base power. All calculations were conducted using MATLAB with a 2.9-GHz CPU and 8&#xa0;GB of RAM.</p>
<p>The IEEE-30 bus system included six generators (five renewable power generators), four transformers, and two capacitors. The topology of IEEE 30-bus system is shown in <xref ref-type="fig" rid="F2">Figure 2</xref>. The active power generation and related variable ranges of the generators are shown in <xref ref-type="table" rid="T1">Table 1</xref>. The settings of the capacitors are shown in <xref ref-type="table" rid="T2">Table 2</xref>. The voltage magnitudes of the load buses were limited to the range of [0.95, 1.05]. The transformer ratios were limited to the range of [0.9, 1.1] with a step of 0.05. The parameters of SLM and IPSO are set as follows. The iteration precision <inline-formula id="inf136">
<mml:math id="m160">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mn>10</mml:mn>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>4</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> in SLM. The number of iterations <inline-formula id="inf137">
<mml:math id="m161">
<mml:mrow>
<mml:mi mathvariant="normal">S</mml:mi>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">z</mml:mi>
<mml:mi mathvariant="normal">e</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>100</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, the population size M &#x3d; 50, the learning factors c1 &#x3d; c2 &#x3d; 2, the initial inertia weight <inline-formula id="inf138">
<mml:math id="m162">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.9</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and the final inertia weight <inline-formula id="inf139">
<mml:math id="m163">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> in IPSO.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Topology of IEEE 30-bus system.</p>
</caption>
<graphic xlink:href="fenrg-10-1086577-g002.tif"/>
</fig>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Active power generation and related variable ranges of generators in IEEE 30-bus system (p.u.).</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="left">Bus number</th>
<th rowspan="2" align="center">Active power generation</th>
<th colspan="2" align="center">Reactive power output</th>
<th colspan="2" align="center">Voltage magnitude</th>
</tr>
<tr>
<th align="center">Lower bounds</th>
<th align="center">Upper bounds</th>
<th align="center">Lower bounds</th>
<th align="center">Upper bounds</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">1</td>
<td align="center">&#x2014;</td>
<td align="center">&#x2212;0.2</td>
<td align="center">1.5</td>
<td align="center">0.9</td>
<td align="center">1.1</td>
</tr>
<tr>
<td align="center">2</td>
<td align="center">0.8</td>
<td align="center">&#x2212;0.2</td>
<td align="center">0.6</td>
<td align="center">0.9</td>
<td align="center">1.1</td>
</tr>
<tr>
<td align="center">5</td>
<td align="center">0.5</td>
<td align="center">&#x2212;0.15</td>
<td align="center">0.63</td>
<td align="center">0.9</td>
<td align="center">1.1</td>
</tr>
<tr>
<td align="center">8</td>
<td align="center">0.2</td>
<td align="center">&#x2212;0.15</td>
<td align="center">0.5</td>
<td align="center">0.9</td>
<td align="center">1.1</td>
</tr>
<tr>
<td align="center">11</td>
<td align="center">0.2</td>
<td align="center">&#x2212;0.1</td>
<td align="center">0.4</td>
<td align="center">0.9</td>
<td align="center">1.1</td>
</tr>
<tr>
<td align="center">13</td>
<td align="center">0.2</td>
<td align="center">&#x2212;0.15</td>
<td align="center">0.45</td>
<td align="center">0.9</td>
<td align="center">1.1</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Settings of capacitors in IEEE 30-bus system (p.u.).</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Bus number</th>
<th align="center">Lower bounds</th>
<th align="center">Upper bounds</th>
<th align="center">Variation step</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">10</td>
<td align="center">0</td>
<td align="center">0.5</td>
<td align="center">0.1</td>
</tr>
<tr>
<td align="center">24</td>
<td align="center">0</td>
<td align="center">0.1</td>
<td align="center">0.02</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>According to the settings specified in <xref ref-type="table" rid="T1">Tables 1</xref>, <xref ref-type="table" rid="T2">2</xref>, the proposed hybrid optimization strategy based on the SLM and IPSO was used to solve the RPOIU model problem for the IEEE 30-bus system, and the results were compared with those obtained by the SLM and IPSO. The results obtained by the hybrid optimization, SLM, and IPSO for the IEEE 30-bus system are presented in<xref ref-type="fig" rid="F3">Figures 3</xref>, <xref ref-type="fig" rid="F4">4</xref>. <xref ref-type="fig" rid="F3">Figure 3A</xref>; <xref ref-type="fig" rid="F4">Figure 4A</xref> show the voltage magnitude intervals acquired by the hybrid optimization, SLM, and IPSO. The interval bounds were all within the voltage limits. The boundary of state variable intervals obtained by the SLM was closer to the security limits than the hybrid optimization and IPSO. The intervals obtained by the hybrid optimization were close to that obtained by IPSO. <xref ref-type="fig" rid="F3">Figure 3B</xref>; <xref ref-type="fig" rid="F4">Figure 4B</xref> present the reactive power generation intervals acquired by the hybrid optimization, SLM, and IPSO. The interval bounds also were within the limits of the reactive power generation and the interval results obtained by the three methods were close for most of the buses. The results verified the effectiveness of the proposed method for solving the RPOIU problems. The reasons for ensuring the interval results within voltage limits or reactive power generation limits were that the hybrid optimization and SLM both used the security limits to ensure the feasibility of the control variables, and the IPSO determined the feasibility of the control variables by judging whether the state variable intervals satisfied the constraints of the RPOIU model. <xref ref-type="fig" rid="F5">Figure 5</xref> presents the iterative convergence process of the three algorithms, and the results are shown in <xref ref-type="table" rid="T3">Table 3</xref>. The hybrid optimization achieved the minimum real power loss, and the IPSO had a relatively large loss of active power compared to the other algorithms. This was because the hybrid optimization could obtain better solutions for the continuous and discrete variables, in contrast to the single optimization, which had difficulty dealing with mixed control variables. It demonstrated that the proposed method had higher accuracy than SLM and IPSO for solving RPOIU models.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Results obtained by the hybrid optimization and SLM for the IEEE 30-bus system: <bold>(A)</bold> voltage magnitude and <bold>(B)</bold> reactive power generation.</p>
</caption>
<graphic xlink:href="fenrg-10-1086577-g003.tif"/>
</fig>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Results obtained by the hybrid optimization and IPSO for the IEEE 30-bus system: <bold>(A)</bold> voltage magnitude and <bold>(B)</bold> reactive power generation.</p>
</caption>
<graphic xlink:href="fenrg-10-1086577-g004.tif"/>
</fig>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Iterative convergence process of the hybrid optimization, SLM, and IPSO.</p>
</caption>
<graphic xlink:href="fenrg-10-1086577-g005.tif"/>
</fig>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Values of real power losses optimized by the hybrid optimization, SLM, and IPSO.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center"/>
<th align="center">Hybrid Optimization</th>
<th align="center">SLM</th>
<th align="center">IPSO</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Real power losses [p.u.]</td>
<td align="center">0.0498</td>
<td align="center">0.0507</td>
<td align="center">0.0528</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>This paper proposed a data-driven hybrid interval reactive power optimization based on SLM and IPSO for solving the RPOIU problem to address the issue of dealing with mixed control variables. The large amount of uncertain data is expressed as intervals based on data-driven, and the control variable optimization is decomposed into continuous variable optimization and discrete variable optimization. For reducing the conservation of the interval algorithm, the SLM is applied for continuous variable optimization and the IPSO is applied for discrete variable optimization. The two processes are used to solve the RPOIU problem alternately and iteratively until the control variables optimized by the two processes are consistent.</p>
<p>The simulation results obtained by the proposed data-driven hybrid interval reactive power optimization for the IEEE 30-bus system were compared with those obtained by the SLM and IPSO. The proposed data-driven hybrid interval reactive power optimization acquired smaller real power losses than the SLM and IPSO, and it ensured that the interval bounds of the state variables remained within the constraints. The simulation results verified the effectiveness and advantages of the proposed method.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s7">
<title>Author contributions</title>
<p>DC conceptualized the study, contributed to the study methodology, and wrote the original draft. SQ contributed to the writing&#x2014;review and editing, data curation and investigation. QL contributed to study methodology, data analysis, wrote the original draft and writing-review. WX contributed to software and paper revision. XL contributed to investigation and writing&#x2014;original draft. YL contributed to supervision and writing&#x2014;review and editing. HY contributed to the revision of the paper. NK contributed to editing of the paper. All authors have read and agreed to the published version of the manuscript.</p>
</sec>
<sec id="s8">
<title>Funding</title>
<p>This work was supported by the science and technology project of Changsha Power Supply Branch, State Grid Hunan Electric Power Company Limited (Grant No. 00FCJS2210147), the National Natural Science Foundation of China (Grant No. 52007056), and the Natural Science Foundation of Hunan Province, China (Grant No. 2020JJ5077).</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>Authors DC, SQ, WX and XL were employed by the State Grid Hunan Electric Power Co., Ltd.</p>
<p>The remaining 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>
<p>The authors declare that this study received funding from State Grid Hunan Electric Power Company Limited. The funder had the following involvement in the study: Data curation, investigation, the study methodology, data analysis, and the writing-review\editing.</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>Arefifar</surname>
<given-names>S. A.</given-names>
</name>
<name>
<surname>Mohamed</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Probabilistic optimal reactive power planning in distribution systems with renewable resources in grid-connected and islanded modes</article-title>. <source>IEEE Trans. Ind. Electron.</source> <volume>61</volume> (<issue>11</issue>), <fpage>5830</fpage>&#x2013;<lpage>5839</lpage>. <pub-id pub-id-type="doi">10.1109/tie.2014.2308144</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chang</surname>
<given-names>S. Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>S. W.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Research on reactive power optimization algorithm of power system based on improved genetic algorithm</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)</conf-name>, <conf-loc>Wuhan, China</conf-loc>, <conf-date>02-03 December 2017</conf-date>, <fpage>21</fpage>&#x2013;<lpage>24</lpage>.</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ding</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Q. R.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Y. H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Bie</surname>
<given-names>Z. H.</given-names>
</name>
<name>
<surname>Blaabjerg</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A data-driven stochastic reactive power optimization considering uncertainties in active distribution networks and decomposition method</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>9</volume> (<issue>5</issue>), <fpage>4994</fpage>&#x2013;<lpage>5004</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2017.2677481</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gao</surname>
<given-names>H. J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J. Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y. B.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L. F.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J. Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>An improved ADMM-based distributed optimal operation model of AC/DC hybrid distribution network considering wind power uncertainties</article-title>. <source>IEEE Syst. J.</source> <volume>15</volume> (<issue>2</issue>), <fpage>2201</fpage>&#x2013;<lpage>2211</lpage>. <pub-id pub-id-type="doi">10.1109/jsyst.2020.2994336</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Z. G.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>Q. F.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>H. C.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>A new nonlinear interval programming method for uncertain problems with dependent interval variables</article-title>. <source>Eur. J. Operational Res.</source> <volume>238</volume> (<issue>1</issue>), <fpage>245</fpage>&#x2013;<lpage>253</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2014.03.029</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Keerio</surname>
<given-names>M. U.</given-names>
</name>
<name>
<surname>Ali</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Saleem</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hussain</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Hussain</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Multi-objective optimal reactive power dispatch considering probabilistic load demand along with wind and solar power integration</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on Smart Power &#x26; Internet Energy Systems (SPIES)</conf-name>, <conf-loc>Bangkok, Thailand</conf-loc>, <conf-date>15-18 September 2020</conf-date>, <fpage>502</fpage>&#x2013;<lpage>507</lpage>.</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khan</surname>
<given-names>N. H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Raja</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Jamal</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Muhammad</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Design of fractional particle swarm optimization gravitational search algorithm for optimal reactive power dispatch problems</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>146785</fpage>&#x2013;<lpage>146806</lpage>. <pub-id pub-id-type="doi">10.1109/access.2020.3014211</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Reactive power optimization of distribution network including photovoltaic power and SVG considering harmonic factors</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on High Voltage Engineering and Power Systems (ICHVEPS)</conf-name>, <conf-loc>Denpasar, Indonesia</conf-loc>, <conf-date>02-05 October 2017</conf-date>, <fpage>219</fpage>&#x2013;<lpage>224</lpage>.</citation>
</ref>
<ref id="B9">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>K. Y.</given-names>
</name>
<name>
<surname>Jia</surname>
<given-names>D. L.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>K. Y.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>T. T.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>F. Z.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>Research on probabilistic reactive power optimization considering the randomness of distribution network</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on Probabilistic Methods Applied to Power Systems (PMAPS)</conf-name>, <conf-loc>Beijing, China</conf-loc>, <conf-date>16-20 October 2016</conf-date>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation>
</ref>
<ref id="B10">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>S. Y.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Bie</surname>
<given-names>Z. H.</given-names>
</name>
<name>
<surname>Berizzi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hong</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>A second order cone based relaxation and decomposition algorithm for multi-period reactive power optimization considering uncertain PV integration in active distribution networks</article-title>,&#x201d; in <conf-name>Proceedings of the IEEE International Conference on Environment and Electrical Engineering</conf-name>, <conf-loc>Milan, Italy</conf-loc>, <conf-date>06-09 June 2017</conf-date>, <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Fang</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Multi-objective reactive power optimization based on improved particle swarm optimization with &#x3b5;-Greedy strategy and Pareto Archive algorithm</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>65650</fpage>&#x2013;<lpage>65659</lpage>. <pub-id pub-id-type="doi">10.1109/access.2021.3075777</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>H.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). &#x201c;<article-title>Distributed photovoltaic cluster partition and reactive power optimization strategy based on BAS-IGA algorithm</article-title>,&#x201d; in <conf-name>Proceedings of the Asia Conference on Power and Electrical Engineering (ACPEE)</conf-name>, <conf-loc>Hangzhou, China</conf-loc>, <conf-date>15-17 April 2022</conf-date>, <fpage>2198</fpage>&#x2013;<lpage>2203</lpage>.</citation>
</ref>
<ref id="B13">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Saraswat</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ucheniya</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gupta</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Two-stage stochastic optimization for reactive power dispatch with wind power uncertainties</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on Computation, Automation and Knowledge Management (ICCAKM)</conf-name>, <conf-loc>Dubai, United Arab Emirates</conf-loc>, <conf-date>09-10 January 2020</conf-date>, <fpage>332</fpage>&#x2013;<lpage>337</lpage>.</citation>
</ref>
<ref id="B14">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Shri</surname>
<given-names>S. H.</given-names>
</name>
<name>
<surname>Essa</surname>
<given-names>M. B.</given-names>
</name>
<name>
<surname>Mijbas</surname>
<given-names>A. F.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Solving reactive power optimization problem using weight improved PSO algorithm</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)</conf-name>, <conf-loc>Mauritius, Mauritius</conf-loc>, <conf-date>07-08 October 2021</conf-date>, <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</citation>
</ref>
<ref id="B15">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Hua</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X.</given-names>
</name>
<etal/>
</person-group> (<year>2018a</year>). &#x201c;<article-title>Solution of interval reactive power optimization model through defining security limits</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on Power System Technology (POWERCON)</conf-name>, <conf-loc>Guangzhou, China</conf-loc>, <conf-date>06-08 November 2018</conf-date>, <fpage>1384</fpage>&#x2013;<lpage>1389</lpage>.</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H. Y.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>Z. P.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>M. L.</given-names>
</name>
<name>
<surname>Hua</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Ngan</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2018c</year>). <article-title>Reactive power optimization under interval uncertainty by the linear approximation method and its modified method</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>9</volume> (<issue>5</issue>), <fpage>4587</fpage>&#x2013;<lpage>4600</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2017.2664816</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H. Y.</given-names>
</name>
<name>
<surname>Ngan</surname>
<given-names>H. W.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>Z. P.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>M. L.</given-names>
</name>
<name>
<surname>Hua</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Solution of reactive power optimisation including interval uncertainty using genetic algorithm</article-title>. <source>IET Gener. Transm. &#x26;amp. Distrib.</source> <volume>11</volume> (<issue>15</issue>), <fpage>3657</fpage>&#x2013;<lpage>3664</lpage>. <pub-id pub-id-type="doi">10.1049/iet-gtd.2016.1195</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H. Y.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>Z. P.</given-names>
</name>
<name>
<surname>Mo</surname>
<given-names>W. K.</given-names>
</name>
<name>
<surname>Hua</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A multi-time reactive power optimization under interval uncertainty of renewable power generation by an interval sequential quadratic programming method</article-title>. <source>IEEE Trans. Sustain. Energy</source> <volume>10</volume> (<issue>3</issue>), <fpage>1086</fpage>&#x2013;<lpage>1097</lpage>. <pub-id pub-id-type="doi">10.1109/tste.2018.2860901</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H. Y.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Qiu</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hua</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Ngan</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2018b</year>). <article-title>An interval power flow analysis through optimizing-scenarios method</article-title>. <source>IEEE Trans. Smart Grid</source> <volume>9</volume> (<issue>5</issue>), <fpage>5217</fpage>&#x2013;<lpage>5226</lpage>. <pub-id pub-id-type="doi">10.1109/tsg.2017.2684238</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>