<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="style/jpub3-html-trans.xsl"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">21783</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2022.021783</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Bio-Inspired Optimal Dispatching of Wind Power Consumption Considering Multi-Time Scale Demand Response and High-Energy Load Participation</article-title>
<alt-title alt-title-type="left-running-head">Bio-inspired Optimal Dispatching of Wind Power Consumption Considering Multi-Time Scale Demand Response and High-energy Load Participation</alt-title>
<alt-title alt-title-type="right-running-head">Bio-inspired Optimal Dispatching of Wind Power Consumption Considering Multi-Time Scale Demand Response and High-energy Load Participation</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Zhao</surname><given-names>Peng</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Zhang</surname><given-names>Yongxin</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Hua</surname><given-names>Qiaozhi</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>11722@hbuas.edu.cn</email></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Li</surname><given-names>Haipeng</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Wen</surname><given-names>Zheng</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<aff id="aff-1"><label>1</label><institution>School of Information Technology, Luoyang Normal University</institution>, <addr-line>Luoyang, 471022</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Computer School, Hubei University of Arts and Science</institution>, <addr-line>Xiangyang, 441000</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Capinfo Company, Ltd.</institution>, <addr-line>Beijing, 100010</addr-line>, <country>China</country></aff>
<aff id="aff-4"><label>4</label><institution>School of Fundamental Science and Engineering, Waseda University</institution>, <addr-line>Tokyo, 169-8050</addr-line>, <country>Japan</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Qiaozhi Hua. Email: <email>11722@hbuas.edu.cn</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-08-26"><day>26</day>
<month>08</month>
<year>2022</year></pub-date>
<volume>134</volume>
<issue>2</issue>
<fpage>957</fpage>
<lpage>979</lpage>
<history>
<date date-type="received"><day>04</day><month>2</month><year>2022</year></date>
<date date-type="accepted"><day>24</day><month>3</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Zhao et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Zhao et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_21783.pdf"></self-uri>
<abstract>
<p>Bio-inspired computer modelling brings solutions from the living phenomena or biological systems to engineering domains. To overcome the obstruction problem of large-scale wind power consumption in Northwest China, this paper constructs a bio-inspired computer model. It is an optimal wind power consumption dispatching model of multi-time scale demand response that takes into account the involved high-energy load. First, the principle of wind power obstruction with the involvement of a high-energy load is examined in this work. In this step, high-energy load model with different regulation characteristics is established. Then, considering the multi-time scale characteristics of high-energy load and other demand-side resources response speed, a multi-time scale model of coordination optimization is built. An improved bio-inspired model incorporating particle swarm optimization is applied to minimize system operation and wind curtailment costs, as well as to find the most optimal energy configuration within the system. Lastly, we take an example of regional power grid in Gansu Province for simulation analysis. Results demonstrate that the suggested scheduling strategy can significantly enhance the wind power consumption level and minimize the system&#x0027;s operational cost.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Biological system</kwd>
<kwd>multi-time scale</kwd>
<kwd>wind power consumption</kwd>
<kwd>demand response</kwd>
<kwd>bio-inspired computer modelling</kwd>
<kwd>particle swarm optimization</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>China&#x0027;s wind power industry keeps a quick increase in recent years. According to the National Energy Bureau data, at December 2019, the country&#x0027;s total wind power installation capacity was 210 million kW, among which three provinces of Xinjiang, Gansu, Inner Mongolia had a capacity of 60.57 million kW [<xref ref-type="bibr" rid="ref-1">1</xref>], accounting for 28.84&#x0025; of the total installed capacity. However, the problem of wind abandonment in the three provinces is also serious, and the total wind abandonment rate is as high as 28.7&#x0025; [<xref ref-type="bibr" rid="ref-2">2</xref>]. The issue of blocked wind power consumption has become one of the constraints for the wind power market&#x0027;s expansion in China.</p>
<p>When traditional thermal power units&#x2019; peak regulation capability is insufficient to consume wind power completely, using load-side resources to participate in system regulation can provide output space for large-scale integration of wind power [<xref ref-type="bibr" rid="ref-3">3</xref>&#x2013;<xref ref-type="bibr" rid="ref-6">6</xref>]. Zhang et al. [<xref ref-type="bibr" rid="ref-7">7</xref>] regulates the load through price-based demand response (DR) to actively adjust the system peak and configure the energy storage device at the source side. As a result, the system operation cost is reduced, and the system wind is reduced. Tan et al. [<xref ref-type="bibr" rid="ref-8">8</xref>] combines price-based and incentive DR: it verifies that wind power absorption is significantly increased after the introduction of DR. Tan et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] proposed a two-stage scheduling optimization model, in consideration of DR and energy storage system, to fix the problem by chaotic binary particle swarm optimization algorithm. It revealed that the synergistic effect of DR and energy storage systems could inhibit the uncertainty of wind power and lessen the system&#x0027;s wind curtailment rate. The above literatures have some valuable points in using load-side resources to ease the system&#x0027;s wind curtailment problem.</p>
<p>In July 2020, China&#x0027;s Northwest Power Grid has 14 high-capacity enterprises participating in market regulation, reaching a total peak capacity of 532,000&#x2005;kW. Therefore, the use of high energy load in the northwest region to attack wind curtailment has certain practical significance [<xref ref-type="bibr" rid="ref-10">10</xref>&#x2013;<xref ref-type="bibr" rid="ref-12">12</xref>]. Li et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] proposed a &#x2018;source-load&#x2019; coordinated scheduling model for high energy load and conventional power supply, which offers a novel approach to solving the issues of wind abandonment. Zhang et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] designed a coordinated scheduling strategy of high-energy load and wind power to take into account the load side&#x0027;s risk constraint to solve the issue of load and wind power mismatch. In reference [<xref ref-type="bibr" rid="ref-15">15</xref>], taking the maximum wind power consumption rate as the objective function, a peak-valley electricity price decision model considering the contribution of high energy load in peak shaving is established to encourage enterprises to take an active role in peak shaving.</p>
<p>The above literature offers a new perspective on the study of high energy load participation in wind power consumption in Northwest China, but there are still the following deficiencies:
<list list-type="simple">
<list-item><label>(1)</label><p>At present, most studies on high energy load only consider a single model rather than modeling it independently based on the high energy load&#x0027;s operation characteristics.</p></list-item>
<list-item><label>(2)</label><p>There is no consideration of the difference in the response speed of different types of high load energy to the dispatching signal.</p></list-item>
<list-item><label>(3)</label><p>The multi-time scale characteristics of high energy load and other demand-side resources are not combined to construct the multi-time scale optimization model of DR to engage in wind power consumption.</p></list-item>
</list></p>
<p>For solving the problems of the human real-world, researchers have resorted to nature and biology for a long time. The study of nature theories and principles such as biological structures and bionics bridges have brought development of many mathematical and metaheuristic algorithms by referring to these bio-inspired principles. Bio-inspired modeling researches computerized solutions from living phenomena or biological systems. They have great potential applications in areas such as Internet of Things (IoT) [<xref ref-type="bibr" rid="ref-16">16</xref>&#x2013;<xref ref-type="bibr" rid="ref-20">20</xref>], Internet of Vehicles (IoV) [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>], block chain [<xref ref-type="bibr" rid="ref-23">23</xref>&#x2013;<xref ref-type="bibr" rid="ref-26">26</xref>], image processing [<xref ref-type="bibr" rid="ref-27">27</xref>&#x2013;<xref ref-type="bibr" rid="ref-31">31</xref>], privacy-preserving [<xref ref-type="bibr" rid="ref-32">32</xref>&#x2013;<xref ref-type="bibr" rid="ref-34">34</xref>], unmanned aerial vehicles (UAVs) [<xref ref-type="bibr" rid="ref-35">35</xref>&#x2013;<xref ref-type="bibr" rid="ref-38">38</xref>], medical treatment [<xref ref-type="bibr" rid="ref-39">39</xref>&#x2013;<xref ref-type="bibr" rid="ref-43">43</xref>] and communication [<xref ref-type="bibr" rid="ref-44">44</xref>,<xref ref-type="bibr" rid="ref-45">45</xref>]. An increasing number of bio-inspired algorithms have been developed in recent decades. Many intelligent algorithms have been adopted recently, such as artificial intelligence algorithms [<xref ref-type="bibr" rid="ref-46">46</xref>&#x2013;<xref ref-type="bibr" rid="ref-48">48</xref>], the mathematical analytic methods [<xref ref-type="bibr" rid="ref-49">49</xref>&#x2013;<xref ref-type="bibr" rid="ref-52">52</xref>], ant colonial algorithm [<xref ref-type="bibr" rid="ref-53">53</xref>,<xref ref-type="bibr" rid="ref-54">54</xref>], genetic algorithm [<xref ref-type="bibr" rid="ref-55">55</xref>], particle swarm algorithm, deep learning [<xref ref-type="bibr" rid="ref-56">56</xref>,<xref ref-type="bibr" rid="ref-57">57</xref>] and so forth. Previous studies introduced a mixed-integer linear programming approach to maximize system performance and improve system operational stability [<xref ref-type="bibr" rid="ref-58">58</xref>]. RM et al. [<xref ref-type="bibr" rid="ref-59">59</xref>] proposed an energy efficient cloud algorithm based on Internet of Everything via the wind-driven optimization algorithm and firefly bio-inspired algorithm to handle this heavy flow of data traffic and process within the cloud computing edge. In reference [<xref ref-type="bibr" rid="ref-60">60</xref>], an optimal cluster head strategy is proposed via the employment of a hybrid WOA-MFO model, which optimizes the environmental and network factors. Similarly, the reference [<xref ref-type="bibr" rid="ref-61">61</xref>] designed an advanced approach for cluster head selection through an improved Rider optimization algorithm to optimize the delay minimization, energy sustainability in the IoT system. Neves et al. apply GA to minimize system operation costs in [<xref ref-type="bibr" rid="ref-62">62</xref>], comparing with other algorithms, PSO algorithm is considered more promising in dealing with multi-objective optimization problems. Kerdphol et al. applyed the PSO algorithm to optimize the MG energy storage system [<xref ref-type="bibr" rid="ref-63">63</xref>]. However, the basic PSO algorithm tends to easily fall into a local minimum. Thus, many improvements have been made to solve the disadvantage. To avoid the weaknesses of the PSO algorithm, the acceleration factor is used reasonably to improve the performance of the optimal operation in the power system.</p>
<p>In conclusion, this research examines the principle of high energy load participating in the system to absorb wind power and divides it into discrete adjustable load and continuously adjustable load according to the different operation modes of participating in DR. This study presents an improved bio-inspired algorithm for overcoming the obstruction problem of the large-scale wind power consumption. The main contributions of this work are summarized as follows: (1) The modeling of high energy load based on load characteristics has been designed to show the operation state. (2) The multi-time scale properties of high-energy load and DR are taken into account to minimize the operation cost and maximize the wind power consumption. (3) An improved bio-inspired PSO algorithm has been proposed to overcome the regionally optimal renewable energy power system problem.</p>
</sec>
<sec id="s2"><label>2</label><title>Load Regulation Characteristics of High Load Energy</title>
<sec id="s2_1"><label>2.1</label><title>The Principle of High Load Energy-Absorbing Blocked Wind Power</title>
<p>When wind power is at high risk of failure and power generation is constrained, the wind power enterprises can lower the peak-valley difference of equivalent load by coordinating with the high-energy enterprises and adjusting the duration period of high-energy load to improve wind power consumption. High load energy could be used as a resource to absorb wind power specifically in the two aspects as follows:
<list list-type="simple">
<list-item><label>(1)</label><p>With large adjustable capacity, wind power can be absorbed by increasing output when conventional load is low through load transfer.</p></list-item>
<list-item><label>(2)</label><p>The quick response: some high-energy loads can be quickly changed according to the fluctuation of wind power, with a high degree of automation.</p></list-item>
</list></p>
<p>In <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, Region 1 represents the peak regulation range of thermal power units. If the system&#x0027;s initial load curve is superposed with the negative wind power output curve, the system&#x0027;s equivalent load curve can be obtained. The equivalent load <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>E</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> expression is:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>E</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula></p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Principal diagram of high load energy accommodating impeded wind power</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-1.png"/></fig>
<p><italic>P<sub>L</sub></italic> is the system&#x0027;s initial load value when the high load is not involved in regulation; <italic>P<sub>W</sub></italic> represents wind power output.</p>
<p>Region 2 represents the abandoned air volume of the system under the traditional control mode. It is apparent from <xref ref-type="fig" rid="fig-1">Fig. 1</xref> that the equivalent load value in t<sub>1</sub>&#x2009;&#x2212;&#x2009;t<sub>2</sub> period is smaller than the minimum technical the thermal power unit&#x0027;s output, that is, in this period, the thermal power unit&#x0027;s peak regulation cannot completely suppress the wind power fluctuation, and only the wind power curtailment can be a solution to guarantee the system&#x0027;s operation safety. The abandoned air volume is:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>t</mml:mi></mml:math></disp-formula></p>
<p>When the high energy load is involved in the regulation and control, the power &#x0394;<italic>P<sub>H</sub></italic> is transferred into the t<sub>1</sub>&#x2009;&#x2212;&#x2009;t<sub>2</sub> period, the wind power blocked power will be reduced from Region 2 to Region 3, and the abandoned air volume is:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msubsup><mml:mi>E</mml:mi><mml:mi>W</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow></mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>W</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>H</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>t</mml:mi></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-2">Eqs. (2)</xref> and <xref ref-type="disp-formula" rid="eqn-3">(3)</xref> shows that the new wind power consumption after high-load energy load participating in regulation is:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>H</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>t</mml:mi></mml:math></disp-formula></p>
<p>Therefore, high load energy regulation can greatly minimize abandoned wind power while also improving the power grid&#x0027;s ability to absorb wind power.</p>
</sec>
<sec id="s2_2"><label>2.2</label><title>Regulation Characteristics of High Load Energy</title>
<p>We divide high-energy loads into discrete and continuous types [<xref ref-type="bibr" rid="ref-64">64</xref>].
<list list-type="simple">
<list-item><label>(1)</label><p>Discrete high-energy load is the part that can reduce or increase quantitative load corresponding to the power grid dispatch center&#x0027;s instructions within a given time frame. However, the input or interruption of high-energy load needs a consistently stable period; once the adjustment is carried out, the load power must be maintained for a limited time. It is unable to respond frequently to the adjustment demands, so that is suitable for day-ahead scheduling mode. Take a silicon carbide enterprise as an example. The smelting furnace can be adjusted within the rated capacity range of 80&#x0025;&#x223C;120&#x0025;, with a sustainable time of 4&#x2005;h and a discrete adjustment time interval of not less than 1&#x2005;h.</p></list-item>
</list></p>
<p>The formula of the discretely adjustable load is described as:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <italic>t</italic> is time, <italic>P<sub>DH</sub></italic> (t) denotes the total load of discretely adjustable load at t. <italic>N<sub>DH</sub></italic> denotes the number of discrete high-energy load units. <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denotes the state variable of the <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> discretely adjustable unit, the unit participates in the regulation when the value <italic>i</italic> is 1. <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> is the regulation quantity of discretely adjustable load of the <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> unit.
<list list-type="simple">
<list-item><label>(2)</label><p>Continuous high energy load is the part that is continuously adjustable and has no time limit on power retention. This kind of load can be adjusted continuously many times in a certain time range and track wind power fluctuation. Thus, it is suitable for intra-day dispatching mode. Taking one ferroalloy enterprise as an example, its ore heating furnace can be adjusted within the rated capacity range of 90&#x0025;&#x223C;110&#x0025;, with no strict restriction on adjusting time, and have frequent adjustment and high flexibility.</p></list-item>
</list></p>
<p>The formula of the continuously adjustable load is as follows:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <italic>P<sub>SH</sub></italic> (<italic>t</italic>) denotes the total load of continuously adjustable load at t. <italic>N<sub>SH</sub></italic> denotes the number of continuous high-energy load units. <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denotes the state variable of the <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mrow><mml:msub><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> continuously adjustable unit, the unit participates in the regulation when the value <italic>j</italic> is 1. <italic>P<sub>SH,j</sub> </italic>represents the load quantity of continuously adjustable load at t of the <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:msub><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> unit.</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Multi-Time Scale Model Architecture</title>
<sec id="s3_1"><label>3.1</label><title>Resource Classification of Demand Response</title>
<p>As discussed above, different kinds of high-energy loads show different response speeds, also for DR resources. There are two kinds of DR resources: price-based demand response (PDR) and incentive demand response (IDR) [<xref ref-type="bibr" rid="ref-65">65</xref>].</p>
<p>PDR refers to users&#x2019; change of their electricity demand in reaction to the variation of retail electricity prices. This means a portion of transferable load shifted to the trough stage of electricity price through economic decisions to reduce electricity consumption during peak times. Generally, the user makes the electricity usage plan in accordance with the previous day&#x0027;s price. Therefore, PDR is generally determined in the day-ahead planning.</p>
<p>IDR refers to the DR that the implementation agency encourages users to reply quickly and cut load when system reliability is threatened or at electricity peaks make deterministic or time-varying policies. IDRs can be generally separated into the following two categories [<xref ref-type="bibr" rid="ref-66">66</xref>]:</p>
<p>Class A IDR: Response time is long; scheduling plan have to be made one day in advance and is determined in day-ahead scheduling [<xref ref-type="bibr" rid="ref-67">67</xref>];</p>
<p>Class B IDR: The short response time is determined in the day rolling schedule.</p>
</sec>
<sec id="s3_2"><label>3.2</label><title>Multi-Time Scale Framework</title>
<p>Because of the increasing proportion of wind power integration, the traditional day-ahead scheduling method has difficulty solving the wind power consumption problem. Researches show that the multi-time scale scheduling scheme can alleviate the wind curtailment problem greatly [<xref ref-type="bibr" rid="ref-68">68</xref>].</p>
<p>To increase the system&#x0027;s capacity to absorb wind power and lessen operational costs, we design a multi-time scale day-ahead-in-day rolling scheduling model for DR of high load energy participating in wind power accommodation. The scheduling framework is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, and the multi-time scale scheduling flow chart is illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.
<fig id="fig-2"><label>Figure 2</label><caption><title>Multi-time scale framework</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-2.png"/></fig><fig id="fig-3"><label>Figure 3</label><caption><title>Multi-time scale dispatching flow chart</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-3.png"/></fig>
<list list-type="simple">
<list-item><label>(1)</label><p>Day-ahead scheduling plan: It has a time scale of 1&#x2005;h and an execution cycle of 24&#x2005;h. Because of the long start-stop time of thermal power units, the start-stop plan should be committed in the day-ahead dispatching. Moreover, PDR response quantity, class A IDR call volume, and discrete high-energy load call volume are supposed to be determined in the day-ahead scheduling. Then, the resource scheduling quantity settled in day-ahead scheduling is considered as the known quantities in intra-day scheduling.</p>
</list-item>
<list-item><label>(2)</label><p>Intra-day scheduling plan: In day scheduling plan rolls every 15&#x2005;min [<xref ref-type="bibr" rid="ref-69">69</xref>] and each time for 4&#x2005;h. The unit output of the first 15&#x2005;min period is adjusted according to the updated ultra-short-term forecast of wind power and load because the scheduling plan cannot be adjusted repeatedly. The output of the conventional thermal power unit is required to be determined, wind power generation output, IDR call volume of Class B, and continuous high-energy load call volume in the intra-day scheduling.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Multi-time Scale Scheduling Model</title>
<sec id="s4_1"><label>4.1</label><title>Day-Ahead Scheduling Model</title>
<sec id="s4_1_1"><label>4.1.1</label><title>Objective Function</title>
<p>The objective function of day-ahead scheduling is to minimize the total operating cost of the system, including thermal power unit operating cost <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, thermal power unit start-stop cost <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, two types of IDR resource call compensation cost <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, two types of high-energy load unit switching cost <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>H</mml:mi><mml:mi>E</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, and wind curtailment cost <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. The relevant formulas are as follows:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mtable columnalign="left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>f</mml:mi></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>24</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>H</mml:mi><mml:mi>E</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>G</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>G</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the total number of scheduling periods, the segmented amount of time-of-use electricity price curve, <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>G</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the total number of conventional units. <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the time-of-use electricity price of <italic>PDR</italic> at t; <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents the response quantity of <italic>PDR</italic>; <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denote the generation cost coefficients of the <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> thermal power unit, respectively; <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes the start-stop cost coefficient of the <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> thermal power unit; <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the running state coefficient of the <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> thermal power unit at t, and the value of 1 denotes the running state; <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the dispatching output of the <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> thermal power unit; <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mi>A</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represent the unit invoking cost of class A IDR resource and Class B IDR resource, respectively. <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the call volumes of class A IDR load and Class B IDR load at t time; <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the switching costs of discrete-continuous high-energy load units, respectively; <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the switching stages of discrete high-energy load and continuous high-energy load units, respectively, and the value of 1 denotes that the unit is put into operation, the value of 0 means that the unit is interrupted operation. <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the switching capacity of discrete high-energy load and continuous high-energy load, respectively; <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mi>w</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the wind curtailment penalty cost coefficient; <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denotes the wind curtailment power at t.</p>
</sec>
<sec id="s4_1_2"><label>4.1.2</label><title>Constraints</title>
<list list-type="simple">
<list-item><label>(1)</label><p>Active power balance constraints:</p></list-item></list>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>G</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>w</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>where <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>w</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents the wind power output at time t; <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents the predicted value of load power; <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents the operating power of discrete high-energy load after coordinated control optimization. <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents the operating power of continuous high-energy load after coordinated control optimization. <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the call volume of PDR.</p>
<list list-type="simple">
<list-item><label>(2)</label><p>The output constraint, climbing constraint and start-stop constraint of thermal power units are respectively referred to <xref ref-type="disp-formula" rid="eqn-15">formulas (15)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-17">(17)</xref> in reference [<xref ref-type="bibr" rid="ref-70">70</xref>].</p></list-item></list>
<list list-type="simple">
<list-item><label>(3)</label><p>Wind turbine output constraints</p></list-item></list>
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>w</mml:mi><mml:mrow></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mi>w</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<list list-type="simple">
<list-item><label>(4)</label><p>PDR constraints</p></list-item></list>
<p>For the electricity price DR, we select the widely used elastic matrix to calculate the electricity load after participating in the DR. Electricity price elasticity matrix E is obtained by the following formula:</p>
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x2026;</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x2026;</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></disp-formula>
<p>The left side of the Equation denotes the load changing rate; the matrix on the right side denotes the electricity price changing rate; <italic>E</italic> is the elastic matrix, whose main diagonal is the self-elasticity coefficient; the secondary diagonal is the mutual elasticity coefficient.</p>
<p>Upper and lower limit constraints on PDR resource volume are as follows:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the load changing rate of after PDR.
<list list-type="simple">
<list-item><label>(5)</label><p>Upper and lower constraints on IDR resource call volume:</p></list-item></list>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>+</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>B</mml:mi><mml:mi>t</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>B</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>+</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>B</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:msubsup><mml:mi>B</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
<list list-type="simple">
<list-item><label>(6)</label><p>The scheduling constraints of discretely adjustable high-energy load [<xref ref-type="bibr" rid="ref-71">71</xref>]:</p></list-item></list></p>
<p><list list-type="simple">
<list-item><label>1.</label><p>Total load conservation constraints:</p></list-item></list>
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mn>0</mml:mn></mml:msubsup><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The initial total load of discretely adjustable load i before scheduling; represents the quantity of discretely adjustable load <italic>i</italic> after scheduling.
<list list-type="simple">
<list-item><label>2.</label><p>Adjustment range constraints:</p></list-item>
</list>
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denote the upper and lower adjust limits of discrete high-energy load, separately.
<list list-type="simple">
<list-item><label>3.</label><p>Response speed constraints</p></list-item>
</list>
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula>where, <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> are respectively the up and down ramp rates of discrete high-energy load.
<list list-type="simple">
<list-item><label>4.</label><p>Response time interval constraints</p></list-item>
</list>
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>T</mml:mi><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>g</mml:mi></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>g</mml:mi></mml:msubsup></mml:math></inline-formula> represents the minimum response time interval of discrete high-energy load. This formula represents that if load i want to change its operating state, it must maintain the same operating state in <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msubsup><mml:mi>T</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mi>g</mml:mi></mml:msubsup></mml:math></inline-formula> time before changing.
<list list-type="simple">
<list-item><label>5.</label><p>Response time constraints</p></list-item>
</list>
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>M</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msubsup><mml:mi>M</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the maximum allowable response times of discrete high-energy load i within the scheduling cycle.
<list list-type="simple">
<list-item><label>(7)</label><p>Continuously adjustable high-energy load scheduling constraints</p></list-item></list>
<list list-type="simple">
<list-item><label>1.</label><p>Total load conservation constraints:</p></list-item>
</list>
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mn>0</mml:mn></mml:msubsup><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mn>0</mml:mn></mml:msubsup></mml:math></inline-formula> represents the initial total load of continuously adjustable load j before dispatching; <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the load of continuously adjustable load j after dispatching.
<list list-type="simple">
<list-item><label>2.</label><p>Adjustment range constraints</p></list-item>
</list>
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> are the lower and the upper adjust constraint of continuously adjustable high-energy load j, respectively.
<list list-type="simple">
<list-item><label>3.</label><p>Response speed constraints</p></list-item>
</list>
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> are the up and down ramp rates of continued high-energy load.
<list list-type="simple">
<list-item><label>(8)</label><p>Tie-line transmission power constraints</p></list-item>
</list>
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the transmission power of the grid tie-line; <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the transmission power limit of the grid tie-line. Since the transmission power of the grid tie-line is bidirectional, its power limit constraint has positive and negative signs.</p>
</sec>
</sec>
<sec id="s4_2"><label>4.2</label><title>Intra-Day Scheduling Model</title>
<sec id="s4_2_1"><label>4.2.1</label><title>Objective Function</title>
<p>The objective function of intra-day scheduling is still the minimum system operation cost, including thermal power unit output cost <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, B class IDR call cost <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, continuous high-energy load switching cost <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, and wind curtailment cost <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Since the start-stop plan of thermal power units, class A IDR call volume and discrete high-energy load call volume have been decided in day-ahead scheduling. Therefore, the start-stop cost of thermal power units, class A IDR calling cost and discrete high-energy load switching cost are constant in day-ahead scheduling and have not been written into the formula.</p>
</sec>
<sec id="s4_2_2"><label>4.2.2</label><title>Constraints</title>
<p>
<list list-type="simple">
<list-item><label>(1)</label><p>Active power balance constraints:</p></list-item>
</list>
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>f</mml:mi></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>96</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>h</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>G</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>H</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mi>w</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>I</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are constant.
<list list-type="simple">
<list-item><label>(2)</label><p>The thermal power unit constraints, fan constraints, B type IDR constraints, continuous high load call constraints and tie line transmission power constraints are the same as <xref ref-type="sec" rid="s4_1_2">4.1.2</xref>.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s4_3"><label>4.3</label><title>Optimization Algorithm</title>
<p>Commonly, the optimal operation of a power system can be formulated as a multi-objective or a single-objective function with multi-constraint optimization. The PSO algorithm is suitable for solving multi-objective optimization issues. It is often utilized in the solution of discontinuous and nonlinear problems. However, the basic PSO algorithm tends to result in local minimum. Thus, some improvement has been made to solve the disadvantage. To avoid the disadvantages of the PSO algorithm, the improved PSO method incorporates an inertia weight coefficient into the algorithm modeling, which allows for operational regulation and adjustment of the particles&#x2019; flight speed. The PSO has been frequently used to improve the power system optimization procedure in comparison to other algorithms; the PSO achieves a higher level of computation accuracy with fewer repetitions. The flow diagram of the improved PSO is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref> depicts the stage of optimizing the ultimate outcomes of operation costs.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Flow diagram of the proposed improved PSO</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-4.png"/></fig>
<p>The speed and position update formula in standard particle swarm optimization algorithm is:
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mrow><mml:mtext>gd</mml:mtext></mml:mrow></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mi>t</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> means inertia weight,
<disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" display="block"><mml:mi>&#x03C9;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>start</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>start</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>end</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mi>t</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>start</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the initial inertia weight, <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>end</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the termination inertia weight, <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the maximum number of iterations, and <italic>t</italic> is the current number of iterations.</p>
<p>The influence of the particle&#x0027;s previous velocity on the current velocity is determined by the inertia weight. By adjusting the inertia weight, the global search ability and local search ability can be coordinated. <xref ref-type="disp-formula" rid="eqn-26">Eq. (26)</xref> is a typical inertia weight decreasing strategy. Under this strategy, the global search ability is strong at the initial stage of iteration. If the best is not obtained at the initial stage, the local search ability will be strengthened with the decreasing, and the search results are easy to fall into the local optimum. Once trapped in the local optimum, it is difficult to jump out. In order to overcome this deficiency, a nonlinear dynamic inertia weight method is proposed in <xref ref-type="disp-formula" rid="eqn-27">Eq. (27)</xref>:
<disp-formula id="eqn-27"><label>(27)</label><mml:math id="mml-eqn-27" display="block"><mml:mi>&#x03C9;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>end</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>start</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mtext>end</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Case Study</title>
<sec id="s5_1"><label>5.1</label><title>Model Overview</title>
<p>In this study, the improved IEEE-30 node system shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref> is used to simulate the above design strategy. It contains six thermal power units located at nodes 1, 2, 5, 8, 11, and 13, respectively, and a wind power unit with a capacity of 350 MW at node 8. There are one discrete high-energy load unit and two continuous high-energy load units at nodes 4, 7, and 10, respectively. <xref ref-type="table" rid="table-1">Table 1</xref> displays the operating parameters of each thermal power unit, and <xref ref-type="table" rid="table-2">Table 2</xref> shows the remaining parameters. <xref ref-type="fig" rid="fig-6">Fig. 6</xref> illustrates the time-of-use electricity prices diagram, <xref ref-type="fig" rid="fig-7">Figs. 7a</xref>&#x2013;<xref ref-type="fig" rid="fig-7">7c</xref> demonstrate the total load prediction curve, and <xref ref-type="fig" rid="fig-8">Figs. 8a</xref>, <xref ref-type="fig" rid="fig-8">8b</xref> illustrate the forecasting power output of wind power under positive and reverse peak regulation of wind power.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>IEEE-30 system</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-5.png"/></fig><table-wrap id="table-1"><label>Table 1</label><caption><title>Operating parameters of thermal power units</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead valign="top">
<tr>
<th align="left" rowspan="2">Unit</th>
<th align="center" rowspan="2">The upper limit of output/MW</th>
<th align="center" rowspan="2">The lower limit of output/MW</th>
<th align="center" rowspan="2">Climbing rate/(MW&#x22C5;h<sup>&#x2212;1</sup>)</th>
<th align="center" colspan="3">Fuel cost factor</th>
</tr>
<tr>
<th align="left"><italic>a</italic>/(&#x0024;&#x22C5;MW<sup>&#x2212;2</sup>)</th>
<th align="left"><italic>b</italic>/(&#x0024;&#x22C5;MW<sup>&#x2212;1</sup>)</th>
<th align="left"><italic>c</italic>/&#x0024;</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">1</td>
<td align="left">200</td>
<td align="left">50</td>
<td align="left">120</td>
<td align="left">0.0059</td>
<td align="left">3.15</td>
<td align="left">58.66</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">80</td>
<td align="left">20</td>
<td align="left">48</td>
<td align="left">0.0276</td>
<td align="left">2.76</td>
<td align="left">55.48</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">50</td>
<td align="left">15</td>
<td align="left">30</td>
<td align="left">0.0984</td>
<td align="left">1.57</td>
<td align="left">49.84</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">35</td>
<td align="left">10</td>
<td align="left">21</td>
<td align="left">0.0131</td>
<td align="left">5.12</td>
<td align="left">51.84</td>
</tr>
<tr>
<td align="left">11</td>
<td align="left">30</td>
<td align="left">10</td>
<td align="left">18</td>
<td align="left">0.0393</td>
<td align="left">4.72</td>
<td align="left">43.53</td>
</tr>
<tr>
<td align="left">13</td>
<td align="left">40</td>
<td align="left">12</td>
<td align="left">24</td>
<td align="left">0.0393</td>
<td align="left">4.72</td>
<td align="left">50.90</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-2"><label>Table 2</label><caption><title>Other parameters of thermal power units</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Parameter</th>
<th align="left">Numerical value</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Self-elastic coefficient of the elastic matrix</td>
<td align="left">&#x02212;0.2</td>
</tr>
<tr>
<td align="left">Mutual elasticity coefficient of the elastic matrix</td>
<td align="left">0.03</td>
</tr>
<tr>
<td align="left">The upper limit of load change rate participating in PDR/&#x0025;</td>
<td align="left">7</td>
</tr>
<tr>
<td align="left">The upper limit of load change rate participating in IDRA/&#x0025;</td>
<td align="left">5</td>
</tr>
<tr>
<td align="left">The upper limit of load change rate participating in IDRB/&#x0025;</td>
<td align="left">3</td>
</tr>
<tr>
<td align="left">IDRA compensation cost factor/(&#x0024;/MW)</td>
<td align="left">7.78</td>
</tr>
<tr>
<td align="left">IDRB compensation cost factor/(&#x0024;/MW)</td>
<td align="left">9.45</td>
</tr>
<tr>
<td align="left">Abandonment cost coefficient/(&#x0024;/MW)</td>
<td align="left">36.22</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-6"><label>Figure 6</label><caption><title>Time-of-use price</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-6.png"/></fig><fig id="fig-7"><label>Figure 7</label><caption><title>(a) The day-ahead and daily load forecasting, (b) The day-ahead and daily wind power forecasting under reverse peak shaving, (c) The day-ahead and daily wind power forecasting under positive peak shaving</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-7a.png"/><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-7b.png"/></fig><fig id="fig-8"><label>Figure 8</label><caption><title>(a) Dispatching results under reverse peak regulation of wind power, (b) Dispatching results under positive peak regulation of wind power</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-8.png"/></fig>
</sec>
<sec id="s5_2"><label>5.2</label><title>Analysis of Scheduling Results</title>
<p>In both positive and reverse peak regulation scenarios, the results of the proposed scheduling strategy are compared and analyzed in <xref ref-type="fig" rid="fig-8">Figs. 8a</xref> and <xref ref-type="fig" rid="fig-8">8b</xref>.</p>
<p>As demonstrated in <xref ref-type="fig" rid="fig-7">Figs. 7</xref> and <xref ref-type="fig" rid="fig-9">9a</xref>, <xref ref-type="fig" rid="fig-9">9b</xref>, in the reverse-peaking scenario, the high incidence periods of wind power are from 1:00 am to 10:00 am, 11:00 pm&#x2013;12:00 pm, while the load demand is low at this time. Increasing the load demand at 1:00 am&#x2013;10:00 am and 11:00 pm&#x2013;12:00 pm is necessary by calling PDR and IDR to reduce wind curtailment. In the positive peak shaving scenario, the high-frequency period of wind power is between 10 and 19, which overlaps with the load utilization&#x0027;s peak period, and a large amount of wind power can be consumed without large-scale DR resource call. Compared with the peak inversion scenario, the DR resource transfer is reduced by 18.07&#x0025;.</p>
<fig id="fig-9"><label>Figure 9</label><caption><title>(a) Transferable energy with DR in the case of reverse peak shaving of wind power, (b) Transferable energy with DR in the case of positive peak shaving of wind power</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-9.png"/></fig>
<p>In addition, although the total amount of transferable load of type B IDR is small, compared with PDR and type A IDR, type B IDR is more flexible and has a faster response speed. Therefore, the change of type B IDR in intra-day scheduling is relatively severe, which is suitable for some sudden situations or the suppression of wind power fluctuations in short time scales.</p>
<p><xref ref-type="fig" rid="fig-10">Figs. 10</xref> and <xref ref-type="fig" rid="fig-11">11</xref> show the calls of discrete high-load and continuous high-load under two wind power scenarios. For the discrete high-load energy load, when the wind power is in the reverse peak trend, the high incidence of wind power is mostly in the morning, so the discrete high-load energy enterprises will transfer part of the 13&#x2013;24 h load to 1&#x2013;12 h. When wind power shows a positive peaking trend, high-capacity enterprises will move a portion of the load during the low wind power period to the high wind power period (13:00&#x2013;24:00). However, such load cannot be continuously regulated in a short time. The call trend for continuous high energy load is roughly the same as that of discrete high energy load in two wind power output scenarios. Moreover, due to its faster response speed, the continuous high load can alleviate the negative impact of large-scale wind power fluctuation in a brief duration in addition to peak load shifting.</p>
<fig id="fig-10"><label>Figure 10</label><caption><title>Response comparison of discrete high energy load under reverse and positive peak shaving regulation of wind power</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-10.png"/></fig><fig id="fig-11"><label>Figure 11</label><caption><title>Response comparison of continuous high energy load under reverse and positive peak shaving of wind power</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-11.png"/></fig>
<p>In summary, the proposed scheduling policy can fully utilize the time scale characteristics of high load and other DR resources to formulate a reasonable scheduling plan. It helps relieve the issue of wind curtailment and improves the system&#x0027;s economy.</p>
</sec>
<sec id="s5_3"><label>5.3</label><title>Comparative Analysis with Different Scheduling Modes</title>
<p>To fully prove that the above scheduling method can efficiently lessen the wind curtailment rate and system&#x0027;s operation cost, we set up the following three different schemes for comparative analysis under two scenarios in which wind power output presents positive and reverse peak regulation, respectively.</p>
<p>Scheduling scheme 1: day-ahead dispatching strategy without participation in system regulation high-energy load.</p>
<p>Scheduling scheme 2: day-ahead dispatching strategy with high-energy load participation in system regulation.</p>
<p>Scheduling scheme 3: adopt the scheduling scheme in this paper.</p>
<p>The scheduling results of scheme 1 are illustrated in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>. The scheduling results of scheme 2 are illustrated in <xref ref-type="fig" rid="fig-13">Figs. 13</xref> and <xref ref-type="fig" rid="fig-14">14</xref>. The results of the three schemes are presented in <xref ref-type="table" rid="table-3">Table 3</xref>.</p>
<fig id="fig-12"><label>Figure 12</label><caption><title>Scheduling results of scheme 1, (a) Scheduling results of wind power with reverse peak regulation, (b) Dispatching results of positive peak of wind power, (c) Demand response resource call in reverse peak regulation of wind power, (d) Demand response resource call when wind power positive peak</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-12a.png"/><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-12b.png"/></fig><fig id="fig-13"><label>Figure 13</label><caption><title>(a) Scheduling results of wind power with reverse peak regulation, (b) Dispatching results of the positive peak of wind power</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-13.png"/></fig><fig id="fig-14"><label>Figure 14</label><caption><title>(a) Demand response resource call in reverse peak regulation of wind power, (b) Demand response resource call when wind power positive peak, (c) Response of discrete high load energy load, (d) Response of continuous high energy load</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMES_21783-fig-14.png"/></fig><table-wrap id="table-3"><label>Table 3</label><caption><title>Comparison table of different scheduling schemes</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Scene</th>
<th align="left">Scheduling scheme</th>
<th align="left">/&#x0024;</th>
<th align="left">Abandonment rate/&#x0025;</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left" rowspan="3">Reverse peak shaving</td>
<td align="left">Option 1</td>
<td align="left">49538</td>
<td align="left">12.47</td>
</tr>
<tr>
<td align="left">Option 2</td>
<td align="left">44108</td>
<td align="left">10.28</td>
</tr>
<tr>
<td align="left">Option 3</td>
<td align="left">16815</td>
<td align="left">8.92</td>
</tr>
<tr>
<td align="left" rowspan="3">Positive peak shaving</td>
<td align="left">Option 1</td>
<td align="left">26223</td>
<td align="left">3.28</td>
</tr>
<tr>
<td align="left">Option 2</td>
<td align="left">4990</td>
<td align="left">2.91</td>
</tr>
<tr>
<td align="left">Option 3</td>
<td align="left">2345</td>
<td align="left">1.68</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Based on <xref ref-type="table" rid="table-3">Table 3</xref>, a small amount of DR resource calls cannot implement large-scale wind power consumption in scheduling scheme 1, especially under the reverse peak regulation scene in wind power peak time (1&#x2013;10&#x2005;h). This leads to serious wind curtailment; the wind curtailment rate reaches up to 12.47&#x0025;. Therefore, the system reaches the maximum operating cost under this scheme, which is 49,538 dollars.</p>

<p>Based on scheme 1, scheme 2 allows high-energy loads to engage in DR scheduling. Participation of high-energy loads can reduce the system wind curtailment according to the characteristics of high-energy load with large adjustable capacity and convenient control. Compared with plan 1, the wind curtailment rate was reduced by 0.37&#x0025; and 2.19&#x0025;, according with the positive and reverse peak regulation scenarios, respectively. As a significant proportion of wind power is consumed, the system wind curtailment cost and thermal power unit output cost are reduced. Compared with Plan 1, the system&#x0027;s operation cost is reduced by 21,233 dollars and 5430 dollars under positive and reverse peak regulation, respectively.</p>
<p>Based on Plan 2, Plan 3 makes full use of the multi-time-scale characteristics of the high-energy load and other DR resources, which can make timely adjustments according to wind power fluctuations in a shorter time scale, and further decrease the wind curtailment rate of the system. The curtailment rate in scheme 3 is reduced by 3.55&#x0025; and 1.36&#x0025; under reverse peak regulation and reduced by 1.60&#x0025; and 1.23&#x0025; under positive peak regulation, respectively compared with that in schemes 1 and 2. At this time, both the wind curtailment rate and the system operation cost of Scheme 3 is the lowest, with the wind curtailment rate of 1.68&#x0025; and the system operation cost of 2345 dollars.</p>
<p>To sum up, through the comparative analysis of three different schemes under two scenarios of forward and reverse peak shifting, the efficiency of the scheduling strategy designed in this work is verified for reducing the wind curtailment rate of the system.</p>
</sec>
</sec>
<sec id="s6"><label>6</label><title>Conclusion</title>
<p>To address the issues of large-scale wind power consumption and insufficient regulation capacity of traditional units, this paper constructs a bio-inspired computer model by fully exploring the multi-time scale features of DR resources and constructs day-ahead and intra-day rolling scheduling models that include high-energy load in system regulation. The method can obtain the system&#x0027;s optimal scheduling plan. The main conclusions are as follows:
<list list-type="simple">
<list-item><label>(1)</label><p>With the participation of high-energy load, the system&#x0027;s wind power accommodation rate is remarkably increased, and the peak pressure at the source side is effectively decreased. Under the two scenarios of forwarding peak regulation and reverse peak regulation, the system wind power curtailment ratio is decreased by 15.8&#x0025; in comparison with the traditional scheduling mode.</p></list-item>
<list-item><label>(2)</label><p>The multi-time-scale scheduling model is adopted to make peak-load shifting at the slow response load side resources so that the wind power fluctuations in a short time scale can be suppressed, and the wind power accommodation ability is increased. In addition, the system&#x0027;s operation cost is also lessened due to the decrease of wind power curtailment ratio and the increase of prediction accuracy.</p></list-item>
</list></p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> We would like to express our gratitude to the editors and anonymous reviewers for their comments and suggestions. This research study is supported by the Program for Innovative Research Team (in Science and Technology) in University of Henan Province (No. 22IRTSTHN016) and the Hubei Natural Science Foundation (No. 2021CFB156) and the Japan Society for the Promotion of Science (JSPS) Grants-in-Aid for Scientific Research (KAKENHI) (No. JP21K17737).</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Santoso</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Nuhung</surname>, <given-names>I. A.</given-names></string-name></person-group> (<year>2018</year>). Prospects of renewable energy development within remote or rural areas in Indonesia. In: <source>Transition towards 100&#x0025; renewable energy</source>. <publisher-loc>Cham</publisher-loc>, <publisher-name>Springer</publisher-name>. DOI <pub-id pub-id-type="doi">10.1007/978-3-319-69844-1_38</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Fox</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Flynn</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Bryans</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Jenkins</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Milborrow</surname>, <given-names>D.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2007</year>). <source>Wind power integration: Connection and system operational aspects</source>. UK: <publisher-name>IET</publisher-name>. DOI <pub-id pub-id-type="doi">10.1049/PBPO050E</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ju</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Qin</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>C.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2015</year>). <article-title>Wind power accommodation stochastic optimization model with multi-type demand response</article-title>. <source>Power System Technology</source><italic>,</italic> <volume>39</volume><issue>(7)</issue><italic>,</italic> <fpage>1839</fpage>&#x2013;<lpage>1846</lpage>. DOI <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2015.07.012</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhao</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Watson</surname>, <given-names>J. P.</given-names></string-name>, <string-name><surname>Guan</surname>, <given-names>P.</given-names></string-name></person-group> (<year>2013</year>). <article-title>Multi-stage robust unit commitment considering wind and demand response uncertainties</article-title>. <source>IEEE Transactions on Power Systems</source><italic>,</italic> <volume>28</volume><issue>(3)</issue><italic>,</italic> <fpage>2708</fpage>&#x2013;<lpage>2717</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TPWRS.2013.2244231</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Shahidehpour</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Al-Abdulwahab</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2013</year>). <article-title>Hourly demand response in day-ahead scheduling for managing the variability of renewable energy</article-title>. <source>IET Generation, Transmission &#x0026; Distribution</source><italic>,</italic> <volume>7</volume><issue>(3)</issue><italic>,</italic> <fpage>226</fpage>&#x2013;<lpage>234</lpage>. DOI <pub-id pub-id-type="doi">10.1049/iet-gtd.2012.0186</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Nejad</surname>, <given-names>M. F.</given-names></string-name>, <string-name><surname>Saberian</surname>, <given-names>A. M.</given-names></string-name>, <string-name><surname>Hizam</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Radzi</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Kadir</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2013</year>). <article-title>Application of smart power grid in developing countries</article-title>. <conf-name>2013 IEEE 7th International Power Engineering and Optimization Conference (PEOCO)</conf-name>, Malaysia. DOI <pub-id pub-id-type="doi">10.1109/PEOCO.2013.6564586</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>Q.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Study on peaking ability and operation safety of thermal power unit in peak load regulation of power system</article-title>. <conf-name>2018 2nd IEEE Conference on Energy Internet and Energy System Integration (EI2)</conf-name>, China. DOI <pub-id pub-id-type="doi">10.1109/EI2.2018.8581889</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Ju</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Reed</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Rao</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Peng</surname>, <given-names>D.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2015</year>). <article-title>The optimization model for multi-type customers assisting wind power consumptive considering uncertainty and demand response based on robust stochastic theory</article-title>. <source>Energy Conversion and Management</source><italic>,</italic> <volume>105</volume><italic>,</italic> <fpage>1070</fpage>&#x2013;<lpage>1081</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.enconman.2015.08.079</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Ju</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>H.</given-names></string-name></person-group> (<year>2014</year>). <article-title>A two-stage scheduling optimization model and solution algorithm for wind power and energy storage system considering uncertainty and demand response</article-title>. <source>International Journal of Electrical Power &#x0026; Energy Systems</source><italic>,</italic> <volume>63</volume><italic>,</italic> <fpage>1057</fpage>&#x2013;<lpage>1069</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.ijepes.2014.06.061</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhu</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2018</year>). <article-title>A practical load-source coordinative method for further reducing curtailed wind power in China with energy-intensive loads</article-title>. <source>Energies</source><italic>,</italic> <volume>11</volume><issue>(11)</issue><italic>,</italic> <fpage>2925</fpage>. DOI <pub-id pub-id-type="doi">10.3390/en11112925</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>G.</given-names></string-name></person-group> (<year>2017</year>). <article-title>Source-load joint multi-objective optimal scheduling for promoting wind power, photovoltaic accommodation</article-title>. <source>Journal of Renewable and Sustainable Energy</source><italic>,</italic> <volume>9</volume><issue>(6)</issue><italic>,</italic> <fpage>065507</fpage>. DOI <pub-id pub-id-type="doi">10.1063/1.4986412</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Tao</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Xia</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2019</year>). <article-title>Peak load regulation method considering wind power accommodation based on source-load coordination</article-title>. <conf-name>2019 IEEE 3rd Conference on Energy Internet and Energy System Integration (EI2)</conf-name>, China. DOI <pub-id pub-id-type="doi">10.1109/EI247390.2019.9061903</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>H.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Source-load cooperative optimization dispatch strategy considering wind power accommodation</article-title>. <source>Power Generation Technology</source><italic>,</italic> <volume>41</volume><issue>(2)</issue><italic>,</italic> <fpage>126</fpage>&#x2013;<lpage>130</lpage>. DOI <pub-id pub-id-type="doi">10.12096/j.2096-4528.pgt.18266</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Xie</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Wen</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>The bi-level optimization model research for energy-intensive load and energy storage system considering congested wind power consumption</article-title>. <source>Processes</source><italic>,</italic> <volume>10</volume><issue>(1)</issue><italic>,</italic> <fpage>51</fpage>. DOI <pub-id pub-id-type="doi">10.3390/pr10010051</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cui</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2015</year>). <article-title>Stagger peak electricity price for heavy energy-consuming enterprises considering improvement of wind power accommodation</article-title>. <source>Power System Technology</source><italic>,</italic> <volume>39</volume><issue>(4)</issue><italic>,</italic> <fpage>946</fpage>&#x2013;<lpage>952</lpage>. DOI <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2015.04.011</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A blockchain-based shamir&#x0027;s threshold cryptography scheme for data protection in industrial Internet of Things settings</article-title>. <source>IEEE Internet of Things Journal</source>. DOI <pub-id pub-id-type="doi">10.1109/JIOT.2021.3125190</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A blockchain-empowered access control framework for smart devices in green Internet of Things</article-title>. <source>ACM Transactions on Internet Technology</source><italic>,</italic> <volume>21</volume><issue>(3)</issue><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>20</lpage>. DOI <pub-id pub-id-type="doi">10.1145/3433542</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Delay sensitive secure NOMA transmission for hierarchical HAP-LAP medical-care IoT networks</article-title>. <source>IEEE Transactions on Industrial Informatics</source>. DOI <pub-id pub-id-type="doi">10.1109/TII.2021.3117263</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Dev</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Khowaja</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Flexible data integrity checking with original data recovery in IoT-enabled maritime transportation systems</article-title>. <source>IEEE Transactions on Intelligent Transportation Systems</source><italic>,</italic> 1--12. DOI <pub-id pub-id-type="doi">10.1109/TITS.2021.3125070</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Jolfaei</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Fuz-spam: Label smoothing-based fuzzy detection of spammers in Internet of Things</article-title>. <source>IEEE Transactions on Fuzzy Systems</source>. DOI <pub-id pub-id-type="doi">10.1109/TFUZZ.2021.3130311</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Graph neural networks-driven traffic forecasting for connected Internet of Vehicles</article-title>. <source>IEEE Transactions on Network Science and Engineering</source><italic>,</italic> 1--13. DOI <pub-id pub-id-type="doi">10.1109/TNSE.2021.3126830</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Feng</surname>, <given-names>C.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Attribute-based encryption with parallel outsourced decryption for edge intelligent IoV</article-title>. <source>IEEE Transactions on Vehicular Technology</source><italic>,</italic> <volume>69</volume><issue>(11)</issue><italic>,</italic> <fpage>13784</fpage>&#x2013;<lpage>13795</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TVT.2020.3027568</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>N.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Towards secure and privacy-preserving data sharing for COVID-19 medical records: A blockchain-empowered approach</article-title>. <source>IEEE Transactions on Network Science and Engineering</source><italic>,</italic> <volume>9</volume><issue>(1)</issue><italic>,</italic> <fpage>271</fpage>&#x2013;<lpage>281</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TNSE.2021.3101842</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Mumtaz</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Garg</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Guizani</surname>, <given-names>J.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Blockchain-based on-demand computing resource trading in IoV-assisted smart city</article-title>. <source>IEEE Transactions on Emerging Topics in Computing</source><italic>,</italic> <volume>9</volume><issue>(3)</issue><italic>,</italic> <fpage>1373</fpage>&#x2013;<lpage>1385</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TETC.2020.2971831</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Alazab</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Gadekallu</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Su</surname>, <given-names>C.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Blockchain-based reliable and efficient certificateless signature for IIoT devices</article-title>. <source>IEEE Transactions on Industrial Informatics</source><italic>,</italic> 1551--3203. DOI <pub-id pub-id-type="doi">10.1109/TII.2021.3084753</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>26.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Su</surname>, <given-names>C.</given-names></string-name></person-group> (<year>2020</year>). <article-title>CCBRSN: A system with high embedding capacity for covert communication in bitcoin</article-title>. <conf-name>35th International Conference on ICT Systems Security and Privacy Protection&#x2013;IFIP SEC</conf-name>, Slovenia. DOI <pub-id pub-id-type="doi">10.1007/978-3-030-58201-2_22</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>27.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Gu</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Perceptual enhancement for autonomous vehicles: Restoring visually degraded images for context prediction via adversarial training</article-title>. <source>IEEE Transactions on Intelligent Transportation Systems</source><italic>,</italic> 1--12. DOI <pub-id pub-id-type="doi">10.1109/TITS.2021.3120075</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>28.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A displacement estimated method for real time tissue ultrasound elastography</article-title>. <source>Mobile Networks and Applications</source><italic>,</italic> <volume>26</volume><issue>(3)</issue><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>10</lpage>. DOI <pub-id pub-id-type="doi">10.1007/s11036-021-01735-3</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>29.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Lin</surname>, <given-names>L.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Speech emotion recognition enhanced traffic efficiency solution for autonomous vehicles in a 5G-enabled space-air-ground integrated intelligent transportation system</article-title>. <source>IEEE Transactions on Intelligent Transportation Systems</source><italic>,</italic> 2830--2842. DOI <pub-id pub-id-type="doi">10.1109/TITS.2021.3119921</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>30.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zheng</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Qi</surname>, <given-names>X.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Neural network-based mapping mining of image style transfer in big data systems</article-title>. <source>Computational Intelligence and Neuroscience</source><italic>,</italic> 1--11. DOI <pub-id pub-id-type="doi">10.1155/2021/8387382</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>31.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Aloqaily</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Constructing a prior-dependent graph for data clustering and dimension reducton in the edge of AIoT</article-title>. <source>Future Generation Computer Systems</source><italic>,</italic> 381--394. DOI <pub-id pub-id-type="doi">10.1016/j.future.2021.09.044</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>32.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Cross-layer device authentication with quantum encryption for 5G enabled IIoT in Industry 4.0</article-title>. <source>IEEE Transactions on Industrial Informatics</source>. DOI <pub-id pub-id-type="doi">10.1109/TII.2021.3130163</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>33.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>B.</given-names></string-name></person-group> (<year>2021</year>). <article-title>An efficient ciphertext-policy weighted attribute-based encryption for the Internet of Health Things</article-title>. <source>IEEE Journal of Biomedical and Health Informatics</source>. DOI <pub-id pub-id-type="doi">10.1109/JBHI.2021.3075995</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>34.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Peng</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Jolfaei</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A novel real-time deterministic scheduling mechanism in industrial cyber-physical systems for Energy Internet</article-title>. <source>IEEE Transactions on Industrial Informatics</source>. DOI <pub-id pub-id-type="doi">10.1109/TII.2021.3139357</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>35.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Feng</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Blockchain-based cross-domain authentication for intelligent 5G-enabled Internet of Drones</article-title>. <source>IEEE Internet of Things Journal</source><italic>,</italic> 6224--6238. DOI <pub-id pub-id-type="doi">10.1109/JIOT.2021.3113321</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>36.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Feng</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Blockchain-empowered decentralized horizontal federated learning for 5G-enabled UAVs</article-title>. <source>IEEE Transactions on Industrial Informatics</source><italic>,</italic> 3582--3592. DOI <pub-id pub-id-type="doi">10.1109/TII.2021.3116132</pub-id>.</mixed-citation></ref>
<ref id="ref-37"><label>37.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ji</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Cao</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Mumtaz</surname>, <given-names>S.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Secrecy performance analysis of UAV assisted relay transmission for cognitive network with energy harvesting</article-title>. <source>IEEE Transactions on Vehicular Technology</source><italic>,</italic> <volume>69</volume><issue>(7)</issue><italic>,</italic> <fpage>7404</fpage>&#x2013;<lpage>7415</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TVT.2020.2989297</pub-id>.</mixed-citation></ref>
<ref id="ref-38"><label>38.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Balamurugan</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Mohan</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Adimoolam</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>John</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Reddy</surname>, <given-names>T.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>DOA tracking for seamless connectivity in beamformed IoT-based drones</article-title>. <source>Computer Standards &#x0026; Interfaces</source><italic>,</italic> <volume>79</volume><italic>,</italic> <fpage>103564</fpage>. DOI <pub-id pub-id-type="doi">10.1016/j.csi.2021.103564</pub-id>.</mixed-citation></ref>
<ref id="ref-39"><label>39.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Tan</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Lin</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Cheng</surname>, <given-names>X.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Deep-learning-empowered breast cancer auxiliary diagnosis for 5GB remote e-health</article-title>. <source>IEEE Wireless Communications</source><italic>,</italic> <volume>28</volume><issue>(3)</issue><italic>,</italic> <fpage>54</fpage>&#x2013;<lpage>61</lpage>. DOI <pub-id pub-id-type="doi">10.1109/MWC.001.2000374</pub-id>.</mixed-citation></ref>
<ref id="ref-40"><label>40.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>S. X.</given-names></string-name></person-group> (<year>2021</year>). <article-title>An intelligent trust cloud management method for secure clustering in 5G enabled Internet of Medical Things</article-title>. <source>IEEE Transactions on Industrial Informatics</source>. DOI <pub-id pub-id-type="doi">10.1109/TII.2021.3128954</pub-id>.</mixed-citation></ref>
<ref id="ref-41"><label>41.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Arifuzzaman</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Wen</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2015</year>). <article-title>A key management scheme for secure communications of information centric advanced metering infrastructure in smart grid</article-title>. <source>IEEE Transactions on Instrumentation and Measurement</source><italic>,</italic> <volume>64</volume><issue>(8)</issue><italic>,</italic> <fpage>2072</fpage>&#x2013;<lpage>2085</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TIM.2015.2444238</pub-id>.</mixed-citation></ref>
<ref id="ref-42"><label>42.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Bashir</surname>, <given-names>A. K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Towards real-time and efficient cardiovascular monitoring for COVID-19 patients by 5G-enabled wearable medical devices: A deep learning approach</article-title>. <source>Neural Computing and Applications</source><italic>,</italic> 1--14. DOI <pub-id pub-id-type="doi">10.1007/s00521-021-06219-9</pub-id>.</mixed-citation></ref>
<ref id="ref-43"><label>43.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sun</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Alazab</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Lin</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>PMRSS: Privacy-preserving medical record searching scheme for intelligent diagnosis in IoT healthcare</article-title>. <source>IEEE Transactions on Industrial Informatics</source><italic>,</italic> <volume>18</volume><issue>(3)</issue><italic>,</italic> <fpage>1981</fpage>&#x2013;<lpage>1990</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TII.2021.3070544</pub-id>.</mixed-citation></ref>
<ref id="ref-44"><label>44.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhen</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Early collision detection for massive random access in satellite-based Internet of Things</article-title>. <source>IEEE Transactions on Vehicular Technology</source><italic>,</italic> <volume>70</volume><issue>(5)</issue><italic>,</italic> <fpage>5184</fpage>&#x2013;<lpage>5189</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TVT.2021.3076015</pub-id>.</mixed-citation></ref>
<ref id="ref-45"><label>45.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhen</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Bashir</surname>, <given-names>A. K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Energy-efficient random access for LEO satellite-assisted 6G Internet of Remote Things</article-title>. <source>IEEE Internet of Things Journal</source><italic>,</italic> <volume>8</volume><issue>(7)</issue><italic>,</italic> <fpage>5114</fpage>&#x2013;<lpage>5128</lpage>. DOI <pub-id pub-id-type="doi">10.1109/JIOT.2020.3030856</pub-id>.</mixed-citation></ref>
<ref id="ref-46"><label>46.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gong</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>R.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Nonlinear MIMO for industrial Internet of Things in cyber&#x2013;physical systems</article-title>. <source>IEEE Transactions on Industrial Informatics</source><italic>,</italic> <volume>17</volume><issue>(8)</issue><italic>,</italic> <fpage>5533</fpage>&#x2013;<lpage>5541</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TII.2020.3024631</pub-id>.</mixed-citation></ref>
<ref id="ref-47"><label>47.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tan</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Ming</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Secure and resilient artificial intelligence of things: A HoneyNet approach for threat detection and situational awareness</article-title>. <source>IEEE Consumer Electronics Magazine</source>. DOI <pub-id pub-id-type="doi">10.1109/MCE.2021.3081874</pub-id>.</mixed-citation></ref>
<ref id="ref-48"><label>48.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Ouyang</surname>, <given-names>T.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Two-phase deep learning model for short-term wind direction forecasting</article-title>. <source>Renewable Energy</source><italic>,</italic> <volume>2021</volume><issue>(173)</issue><italic>,</italic> <fpage>1005</fpage>&#x2013;<lpage>1016</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.renene.2021.04.041</pub-id>.</mixed-citation></ref>
<ref id="ref-49"><label>49.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Fida M</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Lian</surname>, <given-names>Z.</given-names></string-name>, Yin, Z., Pham, P. Q. <etal>et al.</etal></person-group> (<year>2021</year>). <article-title>Secure-enhanced federated learning for AI-empowered electric vehicle energy prediction</article-title>. <source>IEEE Consumer Electronics Magazine</source>. DOI <pub-id pub-id-type="doi">10.1109/MCE.2021.3116917</pub-id>.</mixed-citation></ref>
<ref id="ref-50"><label>50.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Securing critical infrastructures: Deep-learning-based threat detection in IIoT</article-title>. <source>IEEE Communications Magazine</source><italic>,</italic> <volume>59</volume><issue>(10)</issue><italic>,</italic> <fpage>76</fpage>&#x2013;<lpage>82</lpage>. DOI <pub-id pub-id-type="doi">10.1109/MCOM.101.2001126</pub-id>.</mixed-citation></ref>
<ref id="ref-51"><label>51.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Zhu</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Alazab</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Deep-learning-empowered digital forensics for edge consumer electronics in 5G HetNets</article-title>. <source>IEEE Consumer Electronics Magazine</source><italic>,</italic> <volume>11</volume><issue>(2)</issue><italic>,</italic> <fpage>42</fpage>&#x2013;<lpage>50</lpage>. DOI <pub-id pub-id-type="doi">10.1109/MCE.2020.3047606</pub-id>.</mixed-citation></ref>
<ref id="ref-52"><label>52.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Secure artificial intelligence of things for implicit group recommendations</article-title>. <source>IEEE Internet of Things Journal</source><italic>,</italic> <volume>9</volume><issue>(4)</issue><italic>,</italic> <fpage>2698</fpage>&#x2013;<lpage>2707</lpage>. DOI <pub-id pub-id-type="doi">10.1109/JIOT.2021.3079574</pub-id>.</mixed-citation></ref>
<ref id="ref-53"><label>53.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Tan</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Newton-interpolation-based zk-SNARK for artificial Internet of Things</article-title>. <source>Ad Hoc Networks</source><italic>,</italic> <volume>123</volume><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>11</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.adhoc.2021.102656</pub-id>.</mixed-citation></ref>
<ref id="ref-54"><label>54.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zheng</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Yan</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Image super-resolution reconstruction for secure data transmission in Internet of Things environment</article-title>. <source>Mathematical Biosciences and Engineering</source><italic>,</italic> <volume>18</volume><issue>(5)</issue><italic>,</italic> <fpage>6652</fpage>&#x2013;<lpage>6671</lpage>. DOI <pub-id pub-id-type="doi">10.3934/mbe.2021330</pub-id>.</mixed-citation></ref>
<ref id="ref-55"><label>55.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2022</year>). <article-title>An improved pix2pix model based on gabor filter for robust color image rendering</article-title>. <source>Mathematical Biosciences and Engineering</source><italic>,</italic> <volume>19</volume><issue>(1)</issue><italic>,</italic> <fpage>86</fpage>&#x2013;<lpage>101</lpage>. DOI <pub-id pub-id-type="doi">10.3934/mbe.2022004</pub-id>.</mixed-citation></ref>
<ref id="ref-56"><label>56.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Zheng</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Du</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Pix2pix-based grayscale image coloring method</article-title>. <source>Journal of Computer-Aided Design &#x0026; Computer Graphics</source><italic>,</italic> <volume>33</volume><issue>(6)</issue><italic>,</italic> <fpage>929</fpage>&#x2013;<lpage>938</lpage>. DOI <pub-id pub-id-type="doi">10.3724/SP.J.1089.2021.18596</pub-id>.</mixed-citation></ref>
<ref id="ref-57"><label>57.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Zhu</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Anti-forensics for face swapping videos via adversarial training</article-title>. <source>IEEE Transactions on Multimedia</source>. DOI <pub-id pub-id-type="doi">10.1109/TMM.2021.3098422</pub-id>.</mixed-citation></ref>
<ref id="ref-58"><label>58.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Toma</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Tristiu</surname>, <given-names>I.</given-names></string-name>, <string-name><surname>Bulac</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Neagoe-Stefana</surname>, <given-names>A.</given-names></string-name></person-group> (<year>2016</year>). <article-title>Optimal generation scheduling strategy in a microgrid</article-title>. <conf-name>IEEE Transportation Electrification Conference and Expo, Asia-Pacific (ITEC)</conf-name>, <conf-loc>Busan, Korea</conf-loc>. DOI <pub-id pub-id-type="doi">10.1109/ITEC-AP.2016.7513004</pub-id>.</mixed-citation></ref>
<ref id="ref-59"><label>59.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>RM</surname>, <given-names>S. P.</given-names></string-name>, <string-name><surname>Bhattacharya</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Maddikunta</surname>, <given-names>P. K. R.</given-names></string-name>, <string-name><surname>Somayaji</surname>, <given-names>S. R. K.</given-names></string-name>, <string-name><surname>Lakshmanna</surname>, <given-names>K.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Load balancing of energy cloud using wind driven and firefly algorithms in Internet of Everything</article-title>. <source>Journal of Parallel and Distributed Computing</source><italic>,</italic> <volume>142</volume><italic>,</italic> <fpage>16</fpage>&#x2013;<lpage>26</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.jpdc.2020.02.010</pub-id>.</mixed-citation></ref>
<ref id="ref-60"><label>60.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Maddikunta</surname>, <given-names>P. K. R.</given-names></string-name>, <string-name><surname>Gadekallu</surname>, <given-names>T. R.</given-names></string-name>, <string-name><surname>Kaluri</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Srivastava</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Parizi</surname>, <given-names>R. M.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Green communication in IoT networks using a hybrid optimization algorithm</article-title>. <source>Computer Communications</source><italic>,</italic> <volume>159</volume><italic>,</italic> <fpage>97</fpage>&#x2013;<lpage>107</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.comcom.2020.05.020</pub-id>.</mixed-citation></ref>
<ref id="ref-61"><label>61.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alazab</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Lakshmanna</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Reddy</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Pham</surname>, <given-names>Q. V.</given-names></string-name>, <string-name><surname>Maddikunta</surname>, <given-names>P. K. R.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Multi-objective cluster head selection using fitness averaged rider optimization algorithm for IoT networks in smart cities</article-title>. <source>Sustainable Energy Technologies and Assessments</source><italic>,</italic> <volume>43</volume><italic>,</italic> <fpage>100973</fpage>. DOI <pub-id pub-id-type="doi">10.1016/j.seta.2020.100973</pub-id>.</mixed-citation></ref>
<ref id="ref-62"><label>62.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Neves</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Pina</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Silva</surname>, <given-names>C. A.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Comparison of different demand response optimization goals on an isolated MG</article-title>. <source>Sustainable Energy Technologies and Assessments</source><italic>,</italic> <volume>30</volume><italic>,</italic> <fpage>209</fpage>&#x2013;<lpage>215</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.seta.2018.10.006</pub-id>.</mixed-citation></ref>
<ref id="ref-63"><label>63.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kerdphol</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Fuji</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Mitani</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Watanabem</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Qudaih</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2016</year>). <article-title>Optimization of a battery storage system using particle swarm optimization for stand-alone MGs</article-title>. <source>International Journal of Electrical Power &#x0026; Energy Systems</source><italic>,</italic> <volume>81</volume><italic>,</italic> <fpage>32</fpage>&#x2013;<lpage>39</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.ijepes.2016.02.006</pub-id>.</mixed-citation></ref>
<ref id="ref-64"><label>64.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>L.</given-names></string-name></person-group> (<year>2008</year>). <article-title>Survey of demand response research in deregulated electricity markets</article-title>. <source>Automation of Electric Power Systems</source><italic>,</italic> <volume>32</volume><issue>(3)</issue><italic>,</italic> <fpage>97</fpage>&#x2013;<lpage>106</lpage>. DOI <pub-id pub-id-type="doi">10.3724/SP.J.1011.2008.00482</pub-id>.</mixed-citation></ref>
<ref id="ref-65"><label>65.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>C.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Hierarchical stochastic scheduling of multi-community integrated energy systems in uncertain environments via stackelberg game</article-title>. <source>Applied Energy</source><italic>,</italic> <volume>308</volume><italic>,</italic> <fpage>118392</fpage>. DOI <pub-id pub-id-type="doi">10.1016/j.apenergy.2021.118392</pub-id>.</mixed-citation></ref>
<ref id="ref-66"><label>66.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Han</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>G.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Coordinating flexible demand response and renewable uncertainties for scheduling of community integrated energy systems with an electric vehicle charging station: A bi-level approach</article-title>. <source>IEEE Transactions on Sustainable Energy</source><italic>,</italic> <volume>12</volume><issue>(4)</issue><italic>,</italic> <fpage>2321</fpage>&#x2013;<lpage>2331</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TSTE.2021.3090463</pub-id>.</mixed-citation></ref>
<ref id="ref-67"><label>67.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>R.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Stochastic optimal scheduling of demand response-enabled microgrids with renewable generations: An analytical-heuristic approach</article-title>. <source>Journal of Cleaner Production</source><italic>,</italic> <volume>330</volume><italic>,</italic> <fpage>129840</fpage>. DOI <pub-id pub-id-type="doi">10.1016/j.jclepro.2021.129840</pub-id>.</mixed-citation></ref>
<ref id="ref-68"><label>68.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cui</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Zhong</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Scheduling strategy of wind penetration multi-source system considering multi-time scale source-load coordination</article-title>. <source>Power System Technology</source><italic>,</italic> <volume>2020</volume><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>11</lpage>. DOI <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2019.2577</pub-id>.</mixed-citation></ref>
<ref id="ref-69"><label>69.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bao</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2016</year>). <article-title>Rolling dispatch model considering wind penetration and multi-scale demand response resources</article-title>. <source>Proceedings of the CSEE</source><italic>,</italic> <volume>36</volume><issue>(17)</issue><italic>,</italic> <fpage>4589</fpage>&#x2013;<lpage>4599</lpage>. DOI <pub-id pub-id-type="doi">10.13334/j.0258-8013.pcsee.151343</pub-id>.</mixed-citation></ref>
<ref id="ref-70"><label>70.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Fu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>T.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Improving wind power integration by regenerative electric boiler and battery energy storage device</article-title>. <source>International Journal of Electrical Power &#x0026; Energy Systems</source><italic>,</italic> <volume>131</volume><italic>,</italic> <fpage>107039</fpage>. DOI <pub-id pub-id-type="doi">10.1016/j.ijepes.2021.107039</pub-id>.</mixed-citation></ref>
<ref id="ref-71"><label>71.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ge</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Sun</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>W.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2017</year>). <article-title>Analysis method and empirical research on economic benefit of large-scale consumptive power grid investment</article-title>. <source>The Journal of Engineering</source><italic>,</italic> <volume>2017</volume><issue>(13)</issue><italic>,</italic> <fpage>1285</fpage>&#x2013;<lpage>1289</lpage>. DOI <pub-id pub-id-type="doi">10.1049/joe.2017.0536</pub-id>.</mixed-citation></ref>
</ref-list>
</back>
</article>
















