<?xml version="1.0" encoding="UTF-8"?>
<!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" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">EE</journal-id>
<journal-id journal-id-type="nlm-ta">EE</journal-id>
<journal-id journal-id-type="publisher-id">EE</journal-id>
<journal-title-group>
<journal-title>Energy Engineering</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-0118</issn>
<issn pub-type="ppub">0199-8595</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">70905</article-id>
<article-id pub-id-type="doi">10.32604/ee.2025.070905</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Predictive Maintenance Strategy for Photovoltaic Power Systems: Collaborative Optimization of Transformer-Based Lifetime Prediction and Opposition-Based Learning HHO Algorithm</article-title>
<alt-title alt-title-type="left-running-head">Predictive Maintenance Strategy for Photovoltaic Power Systems: Collaborative Optimization of Transformer-Based Lifetime Prediction and Opposition-Based Learning HHO Algorithm</alt-title>
<alt-title alt-title-type="right-running-head">Predictive Maintenance Strategy for Photovoltaic Power Systems: Collaborative Optimization of Transformer-Based Lifetime Prediction and Opposition-Based Learning HHO Algorithm</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Chen</surname><given-names>Wei</given-names></name></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Wu</surname><given-names>Yang</given-names></name><email>wuyangovo@163.com</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Pei</surname><given-names>Tingting</given-names></name></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Lin</surname><given-names>Jie</given-names></name></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Yuan</surname><given-names>Guojing</given-names></name></contrib>
<aff id="aff-1"><institution>School of Automation and Electrical Engineering, Lanzhou University of Technology</institution>, <addr-line>Lanzhou, 730050</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Yang Wu. Email: <email>wuyangovo@163.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2026</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>27</day><month>1</month><year>2026</year>
</pub-date>
<volume>123</volume>
<issue>2</issue>
<elocation-id>21</elocation-id>
<history>
<date date-type="received">
<day>27</day>
<month>7</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>10</day>
<month>9</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2026 The Authors.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>Published by Tech Science Press.</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_EE_70905.pdf"></self-uri>
<abstract>
<p>In view of the insufficient utilization of condition-monitoring information and the improper scheduling often observed in conventional maintenance strategies for photovoltaic (PV) modules, this study proposes a predictive maintenance (PdM) strategy based on Remaining Useful Life (RUL) estimation. First, a RUL prediction model is established using the Transformer architecture, which enables the effective processing of sequential degradation data. By employing the historical degradation data of PV modules, the proposed model provides accurate forecasts of the remaining useful life, thereby supplying essential inputs for maintenance decision-making. Subsequently, the RUL information obtained from the prediction process is integrated into the optimization of maintenance policies. An opposition-based learning Harris Hawks Optimization (OHHO) algorithm is introduced to jointly optimize two critical parameters: the maintenance threshold <italic>L</italic>, which specifies the degradation level at which maintenance should be performed, and the recovery factor <italic>r</italic>, which reflects the extent to which the system performance is restored after maintenance. The objective of this joint optimization is to minimize the overall operation and maintenance cost while maintaining system availability. Finally, simulation experiments are conducted to evaluate the performance of the proposed PdM strategy. The results indicate that, compared with conventional corrective maintenance (CM) and periodic maintenance (PM) strategies, the RUL-driven PdM approach achieves a reduction in the average cost rate by approximately 20.7% and 17.9%, respectively, thereby demonstrating its potential effectiveness for practical PV maintenance applications.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>State information</kwd>
<kwd>remaining useful life</kwd>
<kwd>Transformer model</kwd>
<kwd>Harris Hawks optimization</kwd>
<kwd>maintenance</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>51767017</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Key Research and Development Program of Gansu Province</funding-source>
<award-id>25YFGA032</award-id>
</award-group>
<award-group id="awg3">
<funding-source>Industry Support and Guidance Project for Higher Education Institutions of Gansu Province</funding-source>
<award-id>2022CYZC-22</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>In recent years, the scale of photovoltaic (PV) power generation has been growing rapidly, and effective operation and maintenance of PV power generation systems is essential to ensure their reliability and economy during operation. Usually, maintenance approaches for PV power generation systems are broadly classified into three forms: corrective maintenance (CM), preventive maintenance (PM), and predictive maintenance (PdM) [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-3">3</xref>].</p>
<p>The CM strategy for PV systems involves emergency repairs to restore operation after a system failure. Reference [<xref ref-type="bibr" rid="ref-4">4</xref>] established a general economic evaluation model and found that when the response time of the maintenance team is short, the CM strategy often has the lowest total cost in most scenarios, particularly suitable for small-scale PV plants with fewer components. Reference [<xref ref-type="bibr" rid="ref-5">5</xref>] decomposed the CM process into failure and repair processes and proposed an automated aggregation algorithm to model the failure and repair processes of multiple components in complex systems, simplifying the computational burden of CM modeling.</p>
<p>The PM strategy for PV systems involves performing maintenance before failures occur, primarily by establishing specific maintenance cycles for regular maintenance activities to minimize downtime caused by component failures and reduce unnecessary economic losses. Reference [<xref ref-type="bibr" rid="ref-6">6</xref>] established a preventive maintenance model for photovoltaic power generation systems based on reliability, and used the Zebra optimization algorithm to determine the maintenance threshold. Reference [<xref ref-type="bibr" rid="ref-7">7</xref>] proposed a refined fault detection method based on current signal analysis as a key support for improving PM accuracy, aiding in triggering PM at early fault stages to extend component lifespan and enhance system availability. Reference [<xref ref-type="bibr" rid="ref-8">8</xref>] proposed a preventive maintenance and replacement strategy for photovoltaic power generation systems based on reliability constraints. It constructed a non-periodic incomplete maintenance model and determined the optimal maintenance and replacement cycle by combining the inverter case study. Reference [<xref ref-type="bibr" rid="ref-9">9</xref>] proposed a PM strategy driven by structural correlation for PV systems, aiming to reduce high costs due to unreasonable maintenance timing and grouping. Reference [<xref ref-type="bibr" rid="ref-10">10</xref>] constructed a reliability model and a maintenance cost model for the wind-solar hybrid power system. By combining preventive maintenance and energy complementation strategies, it established a maintenance optimization model and verified its effectiveness through a case study.</p>
<p>The PdM strategy for PV systems is condition-based maintenance, involving periodic or continuous condition monitoring and fault diagnosis of key components during system operation, with maintenance performed when necessary [<xref ref-type="bibr" rid="ref-11">11</xref>]. Reference [<xref ref-type="bibr" rid="ref-12">12</xref>] focused on the three core tasks of condition monitoring, fault diagnosis, and lifespan prediction, summarizing common signal types, fault modes, and degradation features, and analyzing the application scenarios and adaptability of deep learning models in PdM. Reference [<xref ref-type="bibr" rid="ref-13">13</xref>] proposed a PdM optimization method for distributed PV plants by constructing a multi-constraint scheduling model and introducing genetic algorithms to achieve dynamic allocation of maintenance tasks guided by fault levels, equipment capacity, and remaining waiting time. Reference [<xref ref-type="bibr" rid="ref-14">14</xref>] addressed the challenge of predicting PV component degradation under dynamic environmental conditions, proposing a semi-parametric PdM framework that explicitly incorporates environmental condition information into Remaining Useful Life (RUL) prediction models, demonstrating effective support for PdM decisions in various PV technologies for health management and fault prevention. Reference [<xref ref-type="bibr" rid="ref-15">15</xref>] constructed a method for predicting the lifespan of photovoltaic modules and optimizing maintenance based on a two-stage Wiener degradation model. It proposed a predictive maintenance strategy to determine the optimal maintenance threshold and timing. Reference [<xref ref-type="bibr" rid="ref-16">16</xref>] proposed a data-driven process based on machine learning and time series methods for the performance modeling, fault detection, and trend prediction of photovoltaic systems, thereby achieving predictive maintenance alerts. Reference [<xref ref-type="bibr" rid="ref-17">17</xref>] provides a comprehensive review of predictive maintenance and fault diagnosis methods based on artificial intelligence in photovoltaic systems, and proposes a framework that combines fault mode analysis and severity assessment to enhance system reliability and operational efficiency.</p>
<p>In summary, the CM strategy of PV power generation system mainly takes whether the system is intact or whether it can continue to be used as the basis of maintenance, and restores the equipment to the initial state through repair or replacement actions after failure, which is a typical unplanned maintenance strategy, which will definitely lead to problems such as long downtime, large losses, and poor safety, and is not applicable to systems with high safety and reliability requirements; the PM strategy performs better in cost optimization compared to CM strategy, but in most cases, the optimal maintenance interval needs to be found, which poses a challenge to the actual operation. Building on the foregoing analysis, this study introduces a PdM framework for PV power systems that leverages RUL information. First, a Transformer network forecasts the system&#x2019;s RUL. Second, the predicted RUL values are coupled with an operation-and-maintenance (O&#x0026;M) cost formulation, and an opposition-based-learning Harris Hawks Optimization (OHHO) algorithm simultaneously adjusts the maintenance threshold <italic>L</italic> and restoration factor <italic>r</italic>. Thereby deriving an optimal maintenance schedule. Finally, through simulation, it was verified that this model can utilize the degraded data of the photovoltaic power generation system to predict its RUL, and this strategy can effectively reduce the total maintenance cost and enhance the forward-looking nature of maintenance decisions, thereby effectively extending the remaining useful life of the system.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>RUL Prediction Model for Photovoltaic Power Generation Systems</title>
<sec id="s2_1">
<label>2.1</label>
<title>Transformer Model</title>
<p>The Transformer architecture leverages a self-attention mechanism for sequence modelling. It comprises an encoder and a decoder built by stacking identical layers; each layer contains a multi-head attention block and a position-wise feed-forward network, supplemented with residual connections and layer normalization modules [<xref ref-type="bibr" rid="ref-18">18</xref>]. The overall structure of the Transformer is shown schematically in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Schematic diagram of the overall structure of Transformer</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-1.tif"/>
</fig>
<p>In the illustration, the encoder is placed on the left and the decoder on the right; within both, multi-head attention blocks and position-wise feed-forward networks are linked through residual paths and followed by layer-normalization. The zoomed-in image in the upper left of the figure demonstrates the computation of multi-head attention: the inputs are linearly transformed to produce queries (<bold><italic>Q</italic></bold>), keys (<bold><italic>K</italic></bold>), and values (<bold><italic>V</italic></bold>), which are spliced through multiple parallel sets of scaled dot-product attentions and linearly mapped to obtain the final output.</p>
<p>Self-attention is the pivotal operation within the Transformer architecture and is realised through scaled dot-product attention. Let the query, key and value matrices be denoted by <bold><italic>Q</italic></bold>, <bold><italic>K</italic></bold> and <bold><italic>V</italic></bold>, respectively. The computation proceeds as follows: (i) calculate the dot-product similarity between each query and every key, (ii) divide these scores by the square root of the key-vector dimension, (iii) convert the scaled scores into probability weights via the Softmax function, and (iv) obtain the output as the probability-weighted sum of the value vectors. The corresponding expression is:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>Q</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:mo>,</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mi>t</mml:mi><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>Q</mml:mi><mml:msup><mml:mi>K</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:msqrt><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:msqrt></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mi>V</mml:mi></mml:math></disp-formula></p>
<p>In the equation, <italic>d<sub><italic>k</italic></sub></italic> represents the dimension of the key vectors. The expression details the self-attention workflow: for each query, dot-product scores against every key are first calculated, then divided by <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msqrt><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:msqrt></mml:math></inline-formula> and normalised through the Softmax function, producing a probability distribution over the keys. These coefficients weight the associated value vectors, whose weighted combination forms the layer&#x2019;s output. Through this operation, self-attention fuses contextual cues from all positions in the input, effectively modelling long-range dependencies. Multi-head attention enhances the mechanism by mapping <bold><italic>Q</italic></bold>, <bold><italic>K</italic></bold> and <bold><italic>V</italic></bold> into <italic>n</italic> distinct representation subspaces that are processed in parallel. For the <italic>i</italic>-th head, let the transformed query, key, and value be denoted as <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>Q</mml:mi><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>K</mml:mi><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>V</mml:mi><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>V</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, respectively. Attention is computed separately in each subspace, and the resulting outputs are concatenated:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" 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:mtd><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>Q</mml:mi><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>V</mml:mi><mml:msubsup><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>V</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" 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:mtd><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>Q</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:mo>,</mml:mo><mml:mi>V</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Through multi-head parallelism, the model can focus on sequence features from different perspectives, enhancing its expressive capability. The Transformer also requires explicit injection of positional information because self-attention itself cannot distinguish the order of elements in a sequence. A widely used technique introduces periodic positional signals into the token embeddings by superimposing sine-and cosine-based vectors. For a token located at position <italic>pos</italic> and a model dimension index <italic>i</italic>, the corresponding positional component is given by:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" 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:mtd><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:msup><mml:mn>10000</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>i</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mrow><mml:mtext>m</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:msup><mml:mn>10000</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>i</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mrow><mml:mtext>m</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In the formula, <italic>d</italic><sub>m</sub> is the model dimension, with even indices using the sine function and odd indices using the cosine function, ensuring that encodings for adjacent positions have different frequencies, which allows sequences of varying lengths to be distinguished. The positional encoding is added to the input embeddings and serves as the input to the self-attention module, conveying the positional arrangement of elements within the token stream. The above derivations ensure that the Transformer model can perform parallel computations while effectively representing relationships and positional information between elements when processing sequence data.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>RUL Prediction Model of PV Power System Based on Transformer Model</title>
<p>Focusing on the degradation characteristics of PV power-system data, a Transformer-based model is constructed to predict the RUL. Firstly, the power degradation data collected during system operation is regarded as time series input. In order to be compatible with the input form of Transformer, the original features need to be mapped to a fixed-dimension vector space through linear layers, and position coding is added to reflect the time sequence. The architecture centres on a stack of Transformer encoder layers; every layer pairs a multi-head self-attention module with a position-wise fully connected network, and employs residual links together with layer normalization to keep training stable. The top-layer encoder output is passed through a dense regression layer, which converts it into remaining-lifetime estimates for forecasting future service life. The input sequence is first transformed through embedding and positional encoding, then fed into an N-layer Transformer encoder stack&#x2014;each layer comprising a multi-head self-attention block and a position-wise feed-forward network&#x2014;and finally passed through a dense regression head to yield the system&#x2019;s remaining-lifetime prediction [<xref ref-type="bibr" rid="ref-19">19</xref>].</p>
<p>During training, the raw degradation data are first segmented and perturbed to emulate fragmentary input sequences. Parameter updates are driven by minimizing the mean-squared error (MSE). For a dataset containing <italic>N</italic> samples, let <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denote the actual lifetime of the <italic>i</italic>-th instance and <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msubsup><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, its predicted counterpart; the loss is then given by the MSE formulation:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>By gently penalising prediction deviations&#x2014;yet assigning greater weight to large errors&#x2014;the loss guides the regression task toward robust convergence of its parameter updates. The optimization process continuously adjusts the model parameters through the gradient descent method to minimize the MSE loss and thus improve the prediction accuracy.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Predictive Maintenance Model for PV Power System Based on RUL Information</title>
<p>For a photovoltaic power generation system structured as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, perform maintenance on its associated system.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Structure diagram of PV power generation system</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-2.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>CM Strategy Model and PM Strategy Model</title>
<p>Under the CM strategy, the system operates continuously until a failure occurs, at which point maintenance is performed. The cost per renewal cycle is the failure repair cost, <italic>C</italic><sub><italic>C</italic></sub>, and the renewal cycle is the system lifespan <italic>T</italic> [<xref ref-type="bibr" rid="ref-20">20</xref>]. Therefore, the expected cost and expected cycle are as follows:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" 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:mtd><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" 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:mtd><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>In this expression, <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the survival function&#x2014;that is, the likelihood that the system remains operational up to time <italic>t</italic>. The cost rate of the <italic>CM</italic> strategy is then given by:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>For the <italic>PM</italic> strategy, assume the maintenance cycle is <italic>&#x03C4;</italic>. At the start of each cycle, if a failure occurs before <italic>&#x03C4;</italic> with probability <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, maintenance is performed at the time of failure, incurring a cost of <italic>C</italic><sub><italic>C</italic></sub>, and the cycle length is the failure time. If the system has not failed by <italic>&#x03C4;</italic>, with probability <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, a planned maintenance is performed at <italic>&#x03C4;</italic>, incurring a cost of <italic>C</italic><sub><italic>P</italic></sub>, and the cycle length is <italic>&#x03C4;</italic>. According to renewal theory [<xref ref-type="bibr" rid="ref-21">21</xref>], the expected cost and expected cycle length for periodic maintenance can be expressed as:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" 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:mtd><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" 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:mtd><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x03C4;</mml:mi></mml:mrow></mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Therefore, the cost rate of the <italic>PM</italic> strategy is:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>&#x03C4;</mml:mi></mml:mrow></mml:msubsup><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Predictive Maintenance Model for Photovoltaic Power Generation System Based on RUL Information</title>
<p>The PdM strategy for the photovoltaic power generation system utilizes the real-time assessed <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, setting a maintenance threshold <italic>L</italic> and a recovery factor <italic>r</italic> (<inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>). Maintenance is performed when the predicted remaining useful life <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi>L</mml:mi></mml:math></inline-formula>. The degree of recovery after maintenance depends on <italic>r</italic>. If the original lifespan is <italic>T</italic>, and <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>T</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>L</mml:mi></mml:math></inline-formula>, preventive maintenance is performed at <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mi>L</mml:mi></mml:math></inline-formula>, with the time remaining until failure given by:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>L</mml:mi></mml:math></disp-formula></p>
<p>The total operating time is <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>L</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>L</mml:mi></mml:math></inline-formula>. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> illustrates the complete maintenance workflow.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Schematic diagram of the maintenance process</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-3.tif"/>
</fig>
<p>If a failure occurs before the maintenance threshold&#x2014;denoted as case <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>T</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>L</mml:mi></mml:math></inline-formula>&#x2014;with a probability of <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, then the cycle length is <italic>T</italic> and the cycle cost is <italic>C</italic><sub><italic>C</italic></sub>. If the maintenance threshold is triggered before failure&#x2014;denoted as case <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>T</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>L</mml:mi></mml:math></inline-formula>&#x2014;with a probability of <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, then the cycle length is <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>T</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>L</mml:mi></mml:math></inline-formula> and the cycle cost is <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Based on these two scenarios, The PdM strategy&#x2019;s expected cost and cycle duration can be formulated as:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" 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:mtd><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" 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:mtd><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mi>t</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>L</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Accordingly, the cost rate for the <italic>PdM</italic> strategy is defined as:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mi>d</mml:mi><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mi>t</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:msubsup><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x00A5;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>L</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>In the actual solution, if the distribution of <italic>T</italic> is known, the above integrals can be calculated numerically directly; if the distribution is unknown or difficult to analyze, Monte Carlo simulation can be used, and then approximate calculation. It is worth noting that the above cost analysis did not include the monitoring costs for a specific period of time, and this aspect needs to be given special consideration in practical applications.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Solving Optimal Maintenance Strategy for PV Power System Based on OHHO</title>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>Opposition-Based-Learning Harris Hawks Optimization</title>
<p>Harris Hawks Optimization (HHO) is a swarm-based meta-heuristic that models the cooperative encirclement tactics observed in Harris&#x2019;s hawks [<xref ref-type="bibr" rid="ref-22">22</xref>]. HHO balances broad exploration with intensive exploitation by emulating the encirclement tactics Harris&#x2019;s hawks use to corner prey within the search space, and its basic process includes an exploration phase, a transition phase, and an exploitation phase [<xref ref-type="bibr" rid="ref-23">23</xref>].</p>
<p>(1) Exploratory stage</p>
<p>This stage consists of two strategies:
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mrow><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mo>{</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mrow><mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x394;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>B</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x394;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>B</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mrow><mml:mi>q</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the eagle&#x2019;s location in the upcoming iteration, <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the current coordinates of the prey, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the eagle&#x2019;s present location, <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> corresponds to an eagle chosen at random from the present swarm, <italic>r</italic><sub>1</sub>, <italic>r</italic><sub>2</sub>, <italic>r</italic><sub>3</sub>, <italic>r</italic><sub>4</sub>, <italic>q</italic> are all sampled at random within the range (0, 1), which will be updated as iteration proceeds, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mi>B</mml:mi><mml:mo>=</mml:mo><mml:mi>U</mml:mi><mml:mi>B</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>L</mml:mi><mml:mi>B</mml:mi></mml:math></inline-formula>, <italic>UB</italic> and <italic>LB</italic> are the upper and lower bounds of the variables, respectively, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, and <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> indicates the mean location of all eagles in the present swarm, as defined below:
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> represents the location of an eagle at iteration <italic>t</italic>, and <italic>N</italic> is the population size.</p>
<p>(2) Transition stage</p>
<p>The escape energy of prey at this stage is modeled as follows:
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mi>t</mml:mi><mml:mi>T</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <italic>E</italic> is the escape energy of the prey, <italic>T</italic> is the maximum number of iterations, <italic>t</italic> is the current number of iterations, and <italic>E</italic><sub>0</sub> is the initial energy, which takes the value of a random number within (&#x2212;1, 1). When <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, the Harris hawk will search different regions to further explore the location of the prey&#x2014;global exploration; when <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, the Harris hawk enters into local exploration.</p>
<p>(3) Development phase</p>
<p>Let the escape probability of the prey be <italic>R</italic>. According to the values of <italic>E</italic> and <italic>R</italic>, the following four roundup strategies can be set up:</p>
<p>The soft roundup&#x2014;<inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>R</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, is modeled by the following rule:
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" 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:mtd><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mi>J</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" 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:mtd><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the difference between the position vector of the prey in the <italic>t</italic>-th iteration and the current position vector, and the value of <italic>J</italic> varies randomly during the iteration, characterizing the fleeing intensity of the prey.</p>
<p>The results of the hard roundup&#x2014;<inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>R</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, position update are as follows:
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Indirect fast dive soft roundups&#x2014;<inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>R</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, are executed by the following maneuvers:
<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:mtd><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mi>J</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" 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:mtd><mml:mi>Z</mml:mi><mml:mo>=</mml:mo><mml:mi>Y</mml:mi><mml:mo>+</mml:mo><mml:mi>S</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>L</mml:mi><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>D</italic> is the problem dimension, <italic>S</italic> is a random vector, and <italic>LF</italic> is the L&#x00E9;vy flight function, defined as follows:
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03C3;</mml:mi></mml:mrow><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>&#x03B2;</mml:mi></mml:mfrac></mml:mrow></mml:msup></mml:mfrac></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x03C0;</mml:mi><mml:mi>&#x03B2;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0393;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mfrac><mml:mrow><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mi>&#x03B2;</mml:mi></mml:mfrac></mml:mstyle></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <italic>u</italic>, <italic>&#x03BC;</italic> are random values within (0, 1) and <italic>&#x03B2;</italic> is a default constant. Therefore, the position of this phase is updated as follows:
<disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" display="block"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>Y</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>Z</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>Z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula></p>
<p>Indirect fast dive hard roundups&#x2014;<inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>R</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, are executed by the following maneuvers:
<disp-formula id="eqn-27"><label>(27)</label><mml:math id="mml-eqn-27" 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:mtd><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mi>J</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-28"><label>(28)</label><mml:math id="mml-eqn-28" 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:mtd><mml:mi>Z</mml:mi><mml:mo>=</mml:mo><mml:mi>Y</mml:mi><mml:mo>+</mml:mo><mml:mi>S</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>L</mml:mi><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>D</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>X</italic><sub><italic>m</italic></sub> is obtained from <xref ref-type="disp-formula" rid="eqn-18">Eq. (18)</xref>. Therefore, the position of this stage is updated as follows:
<disp-formula id="eqn-29"><label>(29)</label><mml:math id="mml-eqn-29" display="block"><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>Y</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>Z</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mtable columnspacing="1em" rowspacing="4pt" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>Z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula></p>
<p>However, HHO may converge slowly and easily fall into local optimum when dealing with complex optimization problems. To enhance algorithmic performance, an opposition-based learning (OBL) mechanism is incorporated into OHHO, aiming to boost search efficiency and maintain population diversity [<xref ref-type="bibr" rid="ref-24">24</xref>], which accelerates the current solution by considering both the current solution and its opposites simultaneously to convergence and extend the search space by considering both the current solution and its opposites. Specifically, given a range of values for the <italic>j</italic>-th dimension in the decision variable space <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, for a current solution <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, its corresponding inverse solution is defined as:
<disp-formula id="eqn-30"><label>(30)</label><mml:math id="mml-eqn-30" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>D</mml:mi></mml:math></disp-formula>where <italic>D</italic> is the problem dimension. This reverse mapping makes the reverse solution located at the symmetric position of the current solution relative to the center of the hypercube, with an exploration direction relative to the original solution. After generating the reverse individuals, the current population is evaluated for fitness together with its reverse population, and a reverse selection strategy is used to construct a new generation of populations optimally. A common practice is to compare the fitness values <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for each individual <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. If the reverse solution is superior, <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is substituted for <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, otherwise the original solution is retained:
<disp-formula id="eqn-31"><label>(31)</label><mml:math id="mml-eqn-31" display="block"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Through the aforementioned reverse selection mechanism, it can help the algorithm escape from local extreme points, thereby accurately and efficiently determining the optimal combination of maintenance threshold and recovery factor required.</p>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>Model Solving</title>
<p>The model solving process is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, and the main steps are as follows:</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Model solution process</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-4.tif"/>
</fig>
<p>Step 1: Parameter initialization. Set the algorithm parameters&#x2014;the population size <italic>N</italic>, the maximum number of iterations <italic>T</italic>, and the periodic reverse operation interval <italic>K</italic>. Randomly generate <italic>N</italic> candidate solutions, each individual containing the parameter vector <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, and compute their corresponding reverse solutions <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, respectively:
<disp-formula id="eqn-32"><label>(32)</label><mml:math id="mml-eqn-32" 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:mtd><mml:msubsup><mml:mi>L</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-33"><label>(33)</label><mml:math id="mml-eqn-33" 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:mtd><mml:msubsup><mml:mi>r</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>L</italic> is the repair threshold and <italic>r</italic> is the recovery factor. The fitness is evaluated for all original and reversed individuals, and each (<italic>L</italic>, <italic>r</italic>) is substituted into the system predictive maintenance model to calculate the corresponding objective function value. The 2<italic>N</italic> candidate solutions are ranked according to the fitness values, and the top <italic>N</italic> solutions are optimally retained to form the initial population, providing a better starting point for the iterative process.</p>
<p>Step 2: Global iteration update. Let the current iteration number <italic>t</italic> &#x003D; 1. In each iteration, first calculate the prey&#x2019;s escape energy En and escape probability <italic>R</italic>, and then determine whether it is currently in the exploration phase or exploitation phase. For each eagle group individual <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, update its position according to the following: in the exploration phase, update the individual according to HHO&#x2019;s stochastic exploration formula; in the exploitation phase, execute different roundup strategies according to the escape probability <italic>R</italic>. Execute soft roundup when <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>R</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>0.5</mml:mn></mml:math></inline-formula>, otherwise execute hard roundup, and compute <italic>d</italic> against different formulas <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msubsup><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. Calculate the fitness for all the new individuals again after the update, and write down the current optimal solution <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>Step 3: Periodic reverse operation. If the current number of iterations satisfies the conditions of reverse operation, perform reverse learning again for the whole population updated in step 2, generate a reverse solution for each individual, and evaluate its fitness. The current population is merged with the reverse population and sorted by fitness, and the top <italic>N</italic> individuals are optimally selected as the new population. This step allows the algorithm to periodically introduce symmetric exploration nodes in the search space, which helps to update the population diversity and accelerate global convergence.</p>
<p>Step 4: Termination judgment. For the iteration number <italic>t</italic>, if <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>t</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>T</mml:mi></mml:math></inline-formula>, then return to step 2 to continue the iteration; otherwise, the iteration is terminated and the currently recorded optimal solution <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is output as the optimal configuration of the predictive maintenance parameters <italic>L</italic> and <italic>r</italic>. The maintenance strategy corresponding to this optimal solution is the optimal combination of maintenance parameters for the system under the given fault and degradation conditions.</p>
</sec>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>The Overall Framework of the Model</title>
<p>Based on the above analysis, <xref ref-type="fig" rid="fig-5">Fig. 5</xref> presents the flowchart of the maintenance decision-making process described in this paper, covering the entire process from RUL prediction to the formulation of system maintenance decisions based on RUL information. In the RUL prediction stage, the proposed model&#x2019;s prediction model can learn the degradation pattern of the equipment and use the fragment data to predict the system&#x2019;s RUL. During the stage of formulating the equipment maintenance strategy, the proposed PdM strategy monitors the RUL information of the photovoltaic power generation system in real time and finds the lowest annual cost rate through OHHO. Moreover, the convergence performance of this algorithm is superior to that of HHO.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Flowchart of the model process</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-5.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Case Analysis</title>
<p>The PdM strategy for the PV power system analyzes the power degradation process of a 5.28 kW system based on 22 PV modules over a period of 12.5 a, as shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. This system consists of 2 sets of PV strings connected in parallel, while each string consists of 11 PV modules connected in series [<xref ref-type="bibr" rid="ref-25">25</xref>].</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Power degradation process of photovoltaic system</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-6.tif"/>
</fig>
<sec id="s4_1">
<label>4.1</label>
<title>RUL Analysis of PV Power Systems with Fragmented Data</title>
<p>According to the overall process of this study, firstly, the overall degraded data is stratified. Based on the expected service life of the system in the case where no maintenance decisions are made, it is divided into three stages as shown in <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Results of time-stratified analysis of the original data</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Stage</th>
<th>Time/a</th>
<th>Degradation rate</th>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>0&#x2013;3.6</td>
<td>Slow</td>
</tr>
<tr>
<td>2</td>
<td>3.6&#x2013;7.2</td>
<td>Medium</td>
</tr>
<tr>
<td>3</td>
<td>7.2&#x2013;10.8</td>
<td>Fast</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Next, in order to simulate the output power degradation rate of the system under different working environments, data augmentation was carried out based on the initial power degradation curve. 200 different degradation curves were generated for each segment. By adding random weak perturbations to each segment, the power degradation rate fluctuated within the range of 10% above and below the initial value. This achieved the enhancement of the original data. The results of data augmentation are shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The introduced weak perturbations can bolster the prediction model&#x2019;s resistance to observed disturbances without altering the system&#x2019;s overall degradation trajectory.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Result of degraded data enhancement</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-7.tif"/>
</fig>
<p>The results of degradation data augmentation can be used as the original dataset for the system&#x2019;s RUL prediction. For the augmented data under different degradation rates, 80% of each set is selected as the training set and 20% as the test set. The Transformer model is utilized to achieve the training of the training set data, and the training process is shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Training process of the Transformer model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-8.tif"/>
</fig>
<p>Subsequently, the data from the test set was utilized for the prediction of the system RUL, and the prediction results are shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>The RUL prediction results of the Transformer model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-9.tif"/>
</fig>
<p>From <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, it is evident that the scatter describing the relationship between the predicted and actual RUL values lies almost on the line <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mi>x</mml:mi></mml:math></inline-formula>, demonstrating that the Transformer-driven RUL estimation scheme can produce more precise system-level remaining-life forecasts. Considering that there is a large amount of prediction data, <xref ref-type="fig" rid="fig-10">Fig. 10</xref> only shows the RUL probability distribution of some samples within the 95% confidence interval.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>The probability distribution of RUL for some samples. (<bold>a</bold>) RUL distribution of Sample 1 (<bold>b</bold>) RUL distribution of Sample 2 (<bold>c</bold>) RUL distribution of Sample 3 (<bold>d</bold>) RUL distribution of Sample 4 (<bold>e</bold>) RUL distribution of Sample 5</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-10.tif"/>
</fig>
<p>As can be seen from <xref ref-type="fig" rid="fig-10">Fig. 10</xref>, in the samples randomly selected at different stages, the RUL prediction model proposed in this study was able to predict the remaining useful life of each sample, verifying the effectiveness of the model. Then, the RUL prediction results of all samples were statistically analyzed and averaged to obtain the correlation information between the degradation rate of the system&#x2019;s output power and the average RUL, as shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Correlation information between output power and RUL</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-11.tif"/>
</fig>
<p>Finally, in order to verify the effectiveness of the method proposed in this paper, the prediction results of the Transformer model and the CNN model were compared. The prediction results of the CNN model are shown in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>The RUL prediction results of the CNN model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-12.tif"/>
</fig>
<p>As can be seen from <xref ref-type="fig" rid="fig-12">Fig. 12</xref>, although the CNN model can also predict the remaining useful life of the system with relatively high accuracy, the number of points deviating from the ideal prediction curve is greater than that of the Transformer model. Finally, <xref ref-type="table" rid="table-2">Table 2</xref> summarizes the error analysis of RUL prediction using the Transformer model and the CNN model.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Error analysis of different models</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Models</th>
<th>Mean absolute error/a</th>
<th>Root mean square error/a</th>
</tr>
</thead>
<tbody>
<tr>
<td>Transformer</td>
<td>0.143</td>
<td>0.172</td>
</tr>
<tr>
<td>CNN</td>
<td>0.151</td>
<td>0.188</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Predictive Maintenance Strategy for PV Power System Based on RUL Information</title>
<sec id="s4_2_1">
<label>4.2.1</label>
<title>Relevant Maintenance Information</title>
<p>The simulation parameters for this study are shown in <xref ref-type="table" rid="table-3">Table 3</xref>. Among them, the expected lifespan of the system when no maintenance decisions were involved was 10.9 years.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Simulation parameters settings</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Value</th>
</tr>
</thead>
<tbody>
<tr>
<td>Simulation time</td>
<td>12.5 a</td>
</tr>
<tr>
<td>CM downtime</td>
<td>7 days</td>
</tr>
<tr>
<td>PM and PdM downtime</td>
<td>1 day</td>
</tr>
<tr>
<td>PM interval</td>
<td>2 a</td>
</tr>
<tr>
<td>Maintenance-related fixed costs</td>
<td>500 RMB/day</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Suppose that the monitoring activities need to be carried out every day, referring to the literature [<xref ref-type="bibr" rid="ref-25">25</xref>], the relevant maintenance cost information is obtained as shown in <xref ref-type="table" rid="table-4">Table 4</xref>, where <italic>C</italic><sub><italic>s</italic></sub> denotes the cost of unit condition monitoring, <italic>C</italic><sub><italic>r</italic></sub> denotes the cost of maintenance preparation, <italic>C</italic><sub><italic>p</italic></sub> denotes the average cost of PM and PdM, and <italic>C</italic><sub><italic>c</italic></sub> denotes the average cost of CM.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Relevant maintenance costs</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Relevant costs/&#x00A5;</th>
<th><italic>C</italic> <sub><italic>s</italic></sub></th>
<th><italic>C</italic> <sub><italic>r</italic></sub></th>
<th><italic>C</italic> <sub><italic>p</italic></sub></th>
<th><italic>C</italic> <sub><italic>c</italic></sub></th>
</tr>
</thead>
<tbody>
<tr>
<td>Value</td>
<td>10</td>
<td>1000</td>
<td>3000</td>
<td>3500</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2_2">
<label>4.2.2</label>
<title>Comparative Analysis of Different Algorithms</title>
<p>This subsection searches for the optimal cost ratio and its corresponding algorithm by comparing and analyzing the convergence of HHO with OHHO and other improved HHO [<xref ref-type="bibr" rid="ref-26">26</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>]. The convergence curves of the algorithms as well as the computational time comparisons are shown in <xref ref-type="fig" rid="fig-13">Figs. 13</xref> and <xref ref-type="fig" rid="fig-14">14</xref>, respectively.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Convergence curves of each HHO</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-13.tif"/>
</fig><fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Calculation time for each HHO</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-14.tif"/>
</fig>
<p>Combining <xref ref-type="fig" rid="fig-13">Figs. 13</xref> and <xref ref-type="fig" rid="fig-14">14</xref>, the performance differences between HHO and each improved form of HHO in maintenance strategy optimization are compared and analyzed. It can be seen that each improved form of HHO can converge to a more optimal solution in fewer iterations, but the optimal solution of OHHO is smaller than the optimal solutions of several other improved forms, showing that OHHO has better convergence performance. And the overall computational time difference among the HHOs is not significant. In the comprehensive analysis, under the objective of minimizing the annual cost rate, OHHO combines good performance with the least computation time, making it ideally suited to the performance demands of a PdM scheme in photovoltaic power systems. The cost analysis of the PdM strategy is given in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>.</p>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>Cost analysis of PdM. (<bold>a</bold>) Cost plan; (<bold>b</bold>) Threshold-recovery factor-annual cost rate relationship plot</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-15.tif"/>
</fig>
<p>Considering that in practical engineering applications, the threshold <italic>L</italic> is difficult to be precisely matched, and the recovery degree is also difficult to be precisely determined, in this case, the concept of &#x201C;maintenance cost economic basin&#x201D; is introduced. Combined with <xref ref-type="fig" rid="fig-15">Fig. 15</xref> and the algorithm optimization results, if the cost rate does not exceed 103% of the optimal cost rate, then this cost rate is within the &#x201C;maintenance cost economic basin&#x201D;, which means that the threshold range is 15%&#x2013;20%, the recovery factor range is 0.60&#x2013;0.72, and the annual cost rate meets the above requirements for all combinations of <italic>L</italic> and <italic>r</italic>. Based on this, when the system RUL is only about 1.9 a left, corresponding levels of maintenance can be considered. Maintenance actions located within the &#x201C;maintenance cost economic basin&#x201D; are called &#x201C;actionable actions&#x201D;, and such actions can approximately achieve the optimal annual cost rate. Therefore, the corresponding maintenance actions can be adjusted according to the actual engineering situation, thereby effectively increasing the RUL of the system.</p>

</sec>
<sec id="s4_2_3">
<label>4.2.3</label>
<title>Comparative Analysis of Maintenance Strategies</title>
<p>In order to demonstrate that the PdM strategy of the photovoltaic power generation system has certain advantages over other maintenance strategies, in this study, the cost rates under the CM, PM, and PdM strategies were compared and analyzed through simulation. The results are shown in <xref ref-type="table" rid="table-5">Table 5</xref>.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Relevant maintenance costs</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Maintenance strategies</th>
<th>CM</th>
<th>PM</th>
<th>PdM</th>
</tr>
</thead>
<tbody>
<tr>
<td>Cost rate/RMB</td>
<td>6850</td>
<td>6610</td>
<td>5430</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="table" rid="table-5">Table 5</xref>, the PdM strategy performs better in minimizing the downtime cost. Compared with the CM and PM strategies, its annual cost rate can be reduced by approximately 20.7% and 17.9%, respectively. However, since the simulation only considered the ideal situation and assumed that the downtime after a failure was relatively short, the cost rates of the three strategies during the maintenance period were quite similar. But in actual engineering, due to many uncontrollable factors such as adverse weather conditions, spare parts issues, and the efficiency of manual maintenance, longer downtime due to failures may occur, which in turn leads to changes in the cost rates. At the same time, due to unplanned downtime, additional costs such as grid penalties and secondary damage to equipment may also be incurred. After comprehensive consideration, the PdM strategy based on RUL information can minimize the cost losses.</p>

</sec>
<sec id="s4_2_4">
<label>4.2.4</label>
<title>Sensitivity Analysis</title>
<p>In order to determine the degree of influence of maintenance threshold, recovery factor and monitoring cost per unit time on the cost rate of the PdM strategy for PV power systems, this paper conducts a sensitivity analysis of the cost parameters of the maintenance model, and analyzes the influence of this parameter on the cost rate by fixing the rest of the parameters and varying a certain parameter. The results of the analysis are shown in <xref ref-type="fig" rid="fig-16">Fig. 16</xref>.</p>
<fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>Sensitivity analysis</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="EE_70905-fig-16.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="fig-16">Fig. 16</xref>, for the PdM strategy of the photovoltaic power generation system, premature maintenance will lead to an excessively high cost rate; excessive maintenance or insufficient maintenance will also increase the maintenance cost; the impact of the recovery factor on the cost rate needs to be comprehensively evaluated in combination with the maintenance threshold; and as the monitoring cost per unit time increases, the annual cost rate will also increase accordingly.</p>

</sec>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This study proposes a (PdM) strategy for PV power systems that uses RUL information, and it derives the following conclusions from simulation analysis:
<list list-type="simple">
<list-item><label>(1)</label><p>In the stage of RUL prediction, the RUL prediction model based on the Transformer model, by learning the degradation law of the device, can achieve the purpose of predicting the RUL of the device by using the fragment data with high accuracy.</p></list-item>
<list-item><label>(2)</label><p>During the design stage of the equipment maintenance strategy, the proposed PdM strategy, by continuously monitoring the RUL information of the photovoltaic power generation system, incorporating the maintenance recovery factor, and using OHHO to find the lowest annual cost rate, can effectively prevent the occurrence of over-maintenance and under-maintenance events, extend the remaining service life of the photovoltaic power generation system, and increase the photovoltaic power generation revenue.</p></list-item>
<list-item><label>(3)</label><p>Unlike other maintenance strategies, the PdM strategy for PV power generation system based on RUL information does not give a specific downtime moment, but utilizes the threshold and recovery factor information provided by the &#x201C;maintenance economic basin&#x201D; to give a maintainable interval, which can be better applied to the actual project.</p></list-item>
</list></p>
<p>In this paper, the RUL prediction stage is modeled only based on the Transformer model, which leads to a weak ability to extract local degradation information, and the subsequent consideration will be given to adding relevant modules to improve the accuracy of the model prediction. Meanwhile, the validity of this framework needs to be verified on a wider range of types, scales and under different climatic conditions for photovoltaic systems, this aspect will be explored in the next stage of the research.</p>
</sec>
</body>
<back>
<ack>
<p>Not applicable.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This research was supported by the National Natural Science Foundation of China (No. 51767017), the Key Research and Development Program of Gansu Province (No. 25YFGA032), and the Industry Support and Guidance Project for Higher Education Institutions of Gansu Province (No. 2022CYZC-22).</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Wei Chen, Yang Wu; data collection: Yang Wu, Guojing Yuan; analysis and interpretation of results: Tingting Pei, Jie Lin; draft manuscript preparation: Yang Wu, Guojing Yuan. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>Data supporting this study are included within the article.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rajput</surname> <given-names>P</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>D</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>KY</given-names></string-name>, <string-name><surname>Karthick</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shah</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Meena</surname> <given-names>RS</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A comprehensive review on reliability and degradation of PV modules based on failure modes and effect analysis</article-title>. <source>Int J Low Carbon Technol</source>. <year>2024</year>;<volume>19</volume>:<fpage>922</fpage>&#x2013;<lpage>37</lpage>. doi:<pub-id pub-id-type="doi">10.1093/ijlct/ctad106</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abdulla</surname> <given-names>H</given-names></string-name>, <string-name><surname>Sleptchenko</surname> <given-names>A</given-names></string-name>, <string-name><surname>Nayfeh</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Photovoltaic systems operation and maintenance: a review and future directions</article-title>. <source>Renew Sustain Energy Rev</source>. <year>2024</year>;<volume>195</volume>(<issue>3</issue>):<fpage>114342</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.rser.2024.114342</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>Marangis</surname> <given-names>D</given-names></string-name>, <string-name><surname>Tziolis</surname> <given-names>G</given-names></string-name>, <string-name><surname>Livera</surname> <given-names>A</given-names></string-name>, <string-name><surname>Makrides</surname> <given-names>G</given-names></string-name>, <string-name><surname>Kyprianou</surname> <given-names>A</given-names></string-name>, <string-name><surname>Georghiou</surname> <given-names>GE</given-names></string-name></person-group>. <article-title>Intelligent maintenance approaches for improving photovoltaic system performance and reliability</article-title>. <source>Sol RRL</source>. <year>2025</year>;<volume>9</volume>(<issue>16</issue>):<fpage>2500289</fpage>. doi:<pub-id pub-id-type="doi">10.1002/solr.202500289</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>Peters</surname> <given-names>L</given-names></string-name>, <string-name><surname>Madlener</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Economic evaluation of maintenance strategies for ground-mounted solar photovoltaic plants</article-title>. <source>Appl Energy</source>. <year>2017</year>;<volume>199</volume>(<issue>7</issue>):<fpage>264</fpage>&#x2013;<lpage>80</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.apenergy.2017.04.060</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>Saltmarsh</surname> <given-names>EA</given-names></string-name>, <string-name><surname>Mavris</surname> <given-names>DN</given-names></string-name></person-group>. <article-title>Simulating corrective maintenance: aggregating component level maintenance time uncertainty at the system level</article-title>. <source>Procedia Comput Sci</source>. <year>2013</year>;<volume>16</volume>:<fpage>459</fpage>&#x2013;<lpage>68</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.procs.2013.01.048</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>W</given-names></string-name>, <string-name><surname>Li</surname> <given-names>M</given-names></string-name>, <string-name><surname>Pei</surname> <given-names>T</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Research on opportunity maintenance strategy for PV power generation systems considering random impact</article-title>. <source>Electr Eng</source>. <year>2024</year>;<volume>106</volume>(<issue>6</issue>):<fpage>7819</fpage>&#x2013;<lpage>30</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00202-024-02470-0</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Oviedo</surname> <given-names>EHS</given-names></string-name>, <string-name><surname>Trav&#x00E9;-Massuy&#x00E8;s</surname> <given-names>L</given-names></string-name>, <string-name><surname>Subias</surname> <given-names>A</given-names></string-name>, <string-name><surname>Pavlov</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alonso</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Detection and classification of faults aimed at preventive maintenance of PV systems</article-title>. <comment>arXiv:2306.08004. 2023</comment>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>W</given-names></string-name>, <string-name><surname>Li</surname> <given-names>M</given-names></string-name>, <string-name><surname>Pei</surname> <given-names>T</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>C</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Reliability-based model for incomplete preventive replacement maintenance of photovoltaic power systems</article-title>. <source>Energy Eng</source>. <year>2023</year>;<volume>121</volume>(<issue>1</issue>):<fpage>125</fpage>&#x2013;<lpage>44</lpage>. doi:<pub-id pub-id-type="doi">10.32604/ee.2023.042812</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>Chen</surname> <given-names>W</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>C</given-names></string-name>, <string-name><surname>Pei</surname> <given-names>T</given-names></string-name>, <string-name><surname>Li</surname> <given-names>M</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Opportunistic maintenance strategies for PV power systems considering the structural correlation</article-title>. <source>Electr Eng</source>. <year>2024</year>;<volume>106</volume>(<issue>4</issue>):<fpage>3947</fpage>&#x2013;<lpage>59</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00202-023-02182-x</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>Zhang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Dui</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>R</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Reliability model and maintenance cost optimization of wind-photovoltaic hybrid power systems</article-title>. <source>Reliab Eng Syst Saf</source>. <year>2025</year>;<volume>255</volume>(<issue>7</issue>):<fpage>110673</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ress.2024.110673</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>Ledmaoui</surname> <given-names>Y</given-names></string-name>, <string-name><surname>El Maghraoui</surname> <given-names>A</given-names></string-name>, <string-name><surname>El Aroussi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Saadane</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Review of recent advances in predictive maintenance and cybersecurity for solar plants</article-title>. <source>Sensors</source>. <year>2025</year>;<volume>25</volume>(<issue>1</issue>):<fpage>206</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s25010206</pub-id>; <pub-id pub-id-type="pmid">39796997</pub-id></mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Han</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Prognostics and health management of photovoltaic systems based on deep learning: a state-of-the-art review and future perspectives</article-title>. <source>Renew Sustain Energy Rev</source>. <year>2024</year>;<volume>205</volume>(<issue>4</issue>):<fpage>114861</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.rser.2024.114861</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>Hua</surname> <given-names>C</given-names></string-name>, <string-name><surname>Kuang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Pi</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Maintenance and operation optimization algorithm of PV plants under multiconstraint conditions</article-title>. <source>Complexity</source>. <year>2020</year>;<volume>2020</volume>(<issue>1</issue>):<fpage>7975952</fpage>. doi:<pub-id pub-id-type="doi">10.1155/2020/7975952</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>Liu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>D</given-names></string-name>, <string-name><surname>Mo</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Remaining useful life prediction of PV systems under dynamic environmental conditions</article-title>. <source>IEEE J Photovolt</source>. <year>2023</year>;<volume>13</volume>(<issue>4</issue>):<fpage>590</fpage>&#x2013;<lpage>602</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JPHOTOV.2023.3272071</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>Lin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Pei</surname> <given-names>T</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>A two-stage Wiener degradation model-based approach for visual maintenance of photovoltaic modules</article-title>. <source>Energy Eng</source>. <year>2025</year>;<volume>122</volume>(<issue>6</issue>):<fpage>2449</fpage>&#x2013;<lpage>63</lpage>. doi:<pub-id pub-id-type="doi">10.32604/ee.2025.065163</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>Marangis</surname> <given-names>D</given-names></string-name>, <string-name><surname>Livera</surname> <given-names>A</given-names></string-name>, <string-name><surname>Tziolis</surname> <given-names>G</given-names></string-name>, <string-name><surname>Makrides</surname> <given-names>G</given-names></string-name>, <string-name><surname>Kyprianou</surname> <given-names>A</given-names></string-name>, <string-name><surname>Georghiou</surname> <given-names>GE</given-names></string-name></person-group>. <article-title>Trend-based predictive maintenance and fault detection analytics for photovoltaic power plants</article-title>. <source>Sol RRL</source>. <year>2024</year>;<volume>8</volume>(<issue>24</issue>):<fpage>2400473</fpage>. doi:<pub-id pub-id-type="doi">10.1002/solr.202400473</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>Hamza</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ali</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Dudley</surname> <given-names>S</given-names></string-name>, <string-name><surname>Saleem</surname> <given-names>K</given-names></string-name>, <string-name><surname>Uneeb</surname> <given-names>M</given-names></string-name>, <string-name><surname>Christofides</surname> <given-names>N</given-names></string-name></person-group>. <article-title>A multi-stage review framework for AI-driven predictive maintenance and fault diagnosis in photovoltaic systems</article-title>. <source>Appl Energy</source>. <year>2025</year>;<volume>393</volume>(<issue>2</issue>):<fpage>126108</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.apenergy.2025.126108</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>J</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>D</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Shahidehpour</surname> <given-names>M</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Transformer-based probabilistic demand forecasting with adaptive online learning</article-title>. <source>Electr Power Syst Res</source>. <year>2025</year>;<volume>240</volume>(<issue>2</issue>):<fpage>111255</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.epsr.2024.111255</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>Jin</surname> <given-names>H</given-names></string-name>, <string-name><surname>Ru</surname> <given-names>R</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>L</given-names></string-name>, <string-name><surname>Meng</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>B</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A synthetic data generation method and evolutionary transformer model for degradation trajectory prediction in lithium-ion batteries</article-title>. <source>Appl Energy</source>. <year>2025</year>;<volume>377</volume>(<issue>14</issue>):<fpage>124629</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.apenergy.2024.124629</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>Caball&#x00E9;</surname> <given-names>NC</given-names></string-name>, <string-name><surname>Castro</surname> <given-names>IT</given-names></string-name></person-group>. <article-title>Assessment of the maintenance cost and analysis of availability measures in a finite life cycle for a system subject to competing failures</article-title>. <source>OR Spectr</source>. <year>2019</year>;<volume>41</volume>(<issue>1</issue>):<fpage>255</fpage>&#x2013;<lpage>90</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00291-018-0521-7</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>Brown</surname> <given-names>M</given-names></string-name>, <string-name><surname>Cohen</surname> <given-names>JE</given-names></string-name></person-group>. <article-title>Markov&#x2019;s inequality: sharpness, renewal theory, finite samples, reliability theory</article-title>. <source>Commun Stat Theory Meth</source>. <year>2023</year>;<volume>52</volume>(<issue>11</issue>):<fpage>3652</fpage>&#x2013;<lpage>60</lpage>. doi:<pub-id pub-id-type="doi">10.1080/03610926.2021.1977960</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>Heidari</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Mirjalili</surname> <given-names>S</given-names></string-name>, <string-name><surname>Faris</surname> <given-names>H</given-names></string-name>, <string-name><surname>Aljarah</surname> <given-names>I</given-names></string-name>, <string-name><surname>Mafarja</surname> <given-names>M</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Harris Hawks optimization: algorithm and applications</article-title>. <source>Future Gener Comput Syst</source>. <year>2019</year>;<volume>97</volume>:<fpage>849</fpage>&#x2013;<lpage>72</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.future.2019.02.028</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Tian</surname> <given-names>FL</given-names></string-name></person-group>. <article-title>Research and application of microgrid optimal scheduling based on multi-strategy harris eagle algorithm [master&#x2019;s thesis]. Changsha, China: Central South University</article-title>; <year>2023</year>. <comment>(In Chinese)</comment>. doi: <pub-id pub-id-type="doi">10.27661/d.cnki.gzhnu.2023.000970</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>Zhao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Opposition-based learning Harris Hawks optimization with steepest convergence for engineering design problems</article-title>. <source>J Supercomput</source>. <year>2024</year>;<volume>81</volume>(<issue>1</issue>):<fpage>148</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s11227-024-06649-x</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Lei</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Research on remaining life prediction and maintenance strategies for photovoltaic power generation systems based on wiener process [master&#x2019;s thesis]. Lanzhou, China: Lanzhou University of Technology</article-title>; <year>2023</year>. <comment>(In Chinese)</comment>. doi: <pub-id pub-id-type="doi">10.27206/d.cnki.ggsgu.2023.000763</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alsokhiry</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Leveraging Harris Hawks optimization for enhanced multi-objective optimal power flow in complex power systems</article-title>. <source>Energies</source>. <year>2025</year>;<volume>18</volume>(<issue>1</issue>):<fpage>18</fpage>. doi:<pub-id pub-id-type="doi">10.3390/en18010018</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>Su</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Dai</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>A hybrid parallel Harris Hawks optimization algorithm for reusable launch vehicle reentry trajectory optimization with no-fly zones</article-title>. <source>Soft Comput</source>. <year>2021</year>;<volume>25</volume>(<issue>23</issue>):<fpage>14597</fpage>&#x2013;<lpage>617</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00500-021-06039-y</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>