<?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">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">86196</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2026.086196</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A New Hybrid Framework Based on Grey and Neuro-Fuzzy Inference System for Energy Demand Forecasting in Vietnam</article-title>
<alt-title alt-title-type="left-running-head">A New Hybrid Framework Based on Grey and Neuro-Fuzzy Inference System for Energy Demand Forecasting in Vietnam</alt-title>
<alt-title alt-title-type="right-running-head">A New Hybrid Framework Based on Grey and Neuro-Fuzzy Inference System for Energy Demand Forecasting in Vietnam</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Pham</surname><given-names>Xuan Kien</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Nguyen</surname><given-names>Van Dat</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>datnv@hub.edu.vn</email></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Phan</surname><given-names>Van Thanh</given-names></name><xref ref-type="aff" rid="aff-3">3</xref><email>pvthanh@vku.udn.vn</email></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Nguyen</surname><given-names>Duc Trien</given-names></name><xref ref-type="aff" rid="aff-4">4</xref><email>triennd.23ai@vku.udn.vn</email></contrib>
<aff id="aff-1"><label>1</label><institution>Faculty of Management Information Systems, Ho Chi Minh University of Banking</institution>, <addr-line>36 Ton That Dam, Nguyen Thai Binh Ward, District 1, Ho Chi Minh City</addr-line>, <country>Vietnam</country></aff>
<aff id="aff-2"><label>2</label><institution>Faculty of Business Administration, Ho Chi Minh University of Banking</institution>, <addr-line>36 Ton That Dam, Nguyen Thai Binh Ward, District 1, Ho Chi Minh City</addr-line>, <country>Vietnam</country></aff>
<aff id="aff-3"><label>3</label><institution>Faculty of Digital Economy and E-Commerce, Vietnam-Korea University of Information and Communication Technology, The University of Danang</institution>, <addr-line>470 Tran Dai Nghia, Ngu Hanh Son Ward, Danang</addr-line>, <country>Vietnam</country></aff>
<aff id="aff-4"><label>4</label><institution>Faculty of Computer Science, Vietnam-Korea University of Information and Communication Technology, The University of Danang</institution>, <addr-line>470 Tran Dai Nghia, Ngu Hanh Son Ward, Danang</addr-line>, <country>Vietnam</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Van Dat Nguyen. Email: <email>datnv@hub.edu.vn</email>; Van Thanh Phan. Email: <email>pvthanh@vku.udn.vn</email>; Duc Trien Nguyen. Email: <email>triennd.23ai@vku.udn.vn</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>07</month><year>2026</year>
</pub-date>
<volume>148</volume>
<issue>1</issue>
<elocation-id>23</elocation-id>
<history>
<date date-type="received">
<day>26</day>
<month>05</month>
<year>2026</year>
</date>
<date date-type="accepted">
<day>01</day>
<month>07</month>
<year>2026</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2026 The Authors. Published by Tech Science Press.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>The Authors</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_86196.pdf"></self-uri>
<abstract>
<p>Accurate energy consumption forecasting faces two major challenges: limited historical data and complex consumption patterns. To address these challenges, this study proposes a new hybrid framework named the Decomposition-based Grey-Neuro-Fuzzy Architecture (DeGNA). The model first uses the Denton method to convert limited annual records into high-frequency monthly data. Next, it applies STL decomposition to separate the data into trend, seasonal and residuals components. A rolling-window GM(1,1) model is then used to predict the main growth trend, while a GWO-optimized ANFIS model uses economic indicators (IIP and FDI) to forecast complex seasonal changes. This study evaluates the performance of the DeGNA model using Vietnam&#x2019;s energy data from 2009 to 2024. The results show that DeGNA achieves high accuracy with a MAPE of 4.11%, performing competitively alongside modern machine learning (XGBoost) and deep learning (LSTM, BiLSTM) models. More importantly, a 5-fold cross-validation reveals that while autoregressive models such as SARIMAX perform well during stable growth periods, DeGNA provides more consistent performance under macroeconomic disruptions. While SARIMAX struggles with sudden demand shocks (maximum error of 22.23), DeGNA maintains a much tighter error distribution (maximum 15.39) and the lowest variance (&#x00B1;1.09%). Therefore, DeGNA provides a highly reliable tool for national energy planning under data constraints.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Data limitation</kwd>
<kwd>temporal disaggregation</kwd>
<kwd>hybrid time-series modeling</kwd>
<kwd>ANFIS</kwd>
<kwd>meta-heuristic optimization</kwd>
<kwd>emerging economies</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Rapid growth in developing countries makes energy security very important. Vietnam is a prime example. Due to increased manufacturing and foreign investment, Vietnam&#x2019;s electricity demand increased by an average of 11% during the 10-year period before the COVID-19 pandemic [<xref ref-type="bibr" rid="ref-1">1</xref>]. To support this growth, Vietnam&#x2019;s electricity demand is projected to reach approximately 505 billion kWh by 2030, with peak capacity demand of around 90,500 MW [<xref ref-type="bibr" rid="ref-2">2</xref>]. However, planning for this growth is challenging because there isn&#x2019;t enough detailed historical data. Because of this missing data, accurate energy forecasting becomes crucial. It helps prevent power shortages, guides investments in the power grid, and supports the goal of net-zero emissions by 2050.</p>
<p>Recently, many researchers used various methods to forecast energy, but each faces limitation in environments with limited data. Classical statistical models are easy to understand and theoretically reliable, but they need long, continuous historical records to work effectively [<xref ref-type="bibr" rid="ref-3">3</xref>]. In addition, artificial intelligence and deep learning models are known for the ability to detect complex patterns. However, they require large amounts of data. When data is limited, they risk over-fitting and act like &#x201C;black boxes&#x201D;, making it difficult for policymakers to trust or utilize their results [<xref ref-type="bibr" rid="ref-3">3</xref>]. As a result, depending on these standard models in data-limited situations presents a challenging trade-off between the amount of data needed and the accuracy of predictions.</p>
<p>To overcome these limitations, hybrid decomposition-based frameworks are often used. However, existing models fail to address Vietnam&#x2019;s specific challenges: the need to break down limited annual data, model nonlinear seasonal patterns, and handle extreme demand shocks. To bridge this gap, this study proposes DeGNA, a novel architecture that combines the Denton method for temporal disaggregation, STL decomposition, GM(1,1), and GWO-ANFIS. Evaluated on Vietnam&#x2019;s primary energy consumption data (2009&#x2013;2024), DeGNA not only demonstrates competitive average accuracy but also reduces the maximum absolute forecasting error by 44.5% compared to SARIMAX.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Review</title>
<p>In energy forecasting, the lack of high-frequency data poses a significant methodology challenge. While many regional studies rely on data-heavy models, these approaches often fail to address structural data constraints or misrepresent actual economic trends [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-5">5</xref>]. To overcome this, the Denton proportional method [<xref ref-type="bibr" rid="ref-6">6</xref>] has been applied as an econometric solution, disaggregating annual statistics into high-frequency series while preserving temporal consistency.</p>
<p>Even with high-frequency data, traditional standalone models (e.g., classical statistical methods or standard deep learning) struggle to capture complex non-linear seasonality. Consequently, the literature has increasingly shifted towards hybrid architectures [<xref ref-type="bibr" rid="ref-7">7</xref>]. Integrating Seasonal-Trend decomposition using Loess (STL) has proven highly effective in isolating structural signals, allowing specialized models to process trend and seasonal components separately [<xref ref-type="bibr" rid="ref-8">8</xref>].</p>
<p>Within these hybrid frameworks, fuzzy-based systems like the Adaptive Neuro-Fuzzy Inference System (ANFIS) are widely adopted to manage demand uncertainty, often outperforming standard neural networks [<xref ref-type="bibr" rid="ref-9">9</xref>]. However, classical gradient-based ANFIS training is stuck in local optima. To address this, recent studies have integrated meta-heuristic algorithms to tune neuro-fuzzy parameters by effectively balancing global exploration and local exploitation [<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>Despite these advances, recent hybrid forecasting studies still exhibit critical limitations across three distinct design philosophies. While decomposition-based ensembles effectively separate structural from residual dynamics [<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>], their seasonal components are modeled using linear or standard ML methods that cannot adaptively capture nonlinear economic-driven patterns. Similarly, grey system approaches retain strong performance under limited sample sizes [<xref ref-type="bibr" rid="ref-12">12</xref>], but they frequently constrain the seasonal structure to predefined functional forms or tune components in isolated stages, or handle trend and seasonality jointly without structural decomposition [<xref ref-type="bibr" rid="ref-13">13</xref>]. Furthermore, although ANFIS-metaheuristic hybrids successfully apply global search to parameter optimization [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>], they typically lack a preceding decomposition stage to isolate the underlying trend from complex seasonality.</p>
<p>To systematically illustrate these methodological gaps, <xref ref-type="table" rid="table-1">Table 1</xref> summarizes the existing frameworks and shows their limitations. Ultimately, no single framework currently combines all these solutions to simultaneously solve data shortages, track long-term growth, and handle complex seasonality. This gap directly motivates the proposed DeGNA architecture.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Summary of related hybrid energy forecasting frameworks and their methodological limitations.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Study</th>
<th>Method</th>
<th>Data/Problem</th>
<th>Methodological Gap</th>
</tr>
</thead>
<tbody>
<tr>
<td>Zhang &#x0026; Li (2021) [<xref ref-type="bibr" rid="ref-8">8</xref>]</td>
<td>STL &#x002B; SARIMA/SVR/ANN/LSTM ensemble</td>
<td>Monthly electricity consumption, China</td>
<td>Assumes sufficient high-frequency data; no exogenous variables; seasonal component modeled with linear ML methods</td>
</tr>
<tr>
<td>Tang et al. (2022) [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td>GM(1,1) &#x002B; seasonal index (linear/exp/log trend forms)</td>
<td>Monthly electricity, industrial sector, western China</td>
<td>Seasonal index fixed to predefined functional forms, not adaptively learned</td>
</tr>
<tr>
<td>Athanasopoulou et al. (2021) [<xref ref-type="bibr" rid="ref-11">11</xref>]</td>
<td>Linear regression (seasonality) &#x002B; LSTM</td>
<td>Half-hourly electricity demand, UK</td>
<td>Designed for data-rich, short-term horizons; linear seasonality cannot capture nonlinear economic-driven patterns</td>
</tr>
<tr>
<td>Wu et al. (2023) [<xref ref-type="bibr" rid="ref-14">14</xref>]</td>
<td>ANFIS&#x2013;ELM optimized via Developed Parasitism&#x2013;Predation Algorithm</td>
<td>Short-term (hourly) electricity demand</td>
<td>No signal decomposition; trend and seasonal patterns learned end-to-end without structural separation</td>
</tr>
<tr>
<td>Bakare et al. (2024) [<xref ref-type="bibr" rid="ref-15">15</xref>]</td>
<td>ANFIS &#x002B; Gene Expression Programming</td>
<td>Monthly industrial load, Uganda</td>
<td>No structural decomposition; exogenous inputs excluding macroeconomic drivers</td>
</tr>
<tr>
<td>Hao &#x0026; Ma (2024) [<xref ref-type="bibr" rid="ref-13">13</xref>]</td>
<td>Grey model &#x002B; stacked LSTM, grid-search-tuned</td>
<td>Annual energy consumption (coal, electricity, gasoline), Henan Province, China</td>
<td>Annual-only input, without decomposition, no economic context</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology and Proposed Approach</title>
<sec id="s3_1">
<label>3.1</label>
<title>The Denton Proportional Method</title>
<p>Advanced forecasting models often require large, high-frequency datasets to capture the temporal patterns. To overcome the limitation of annual energy consumption records, this study uses the Denton proportional disaggregation method [<xref ref-type="bibr" rid="ref-16">16</xref>]. This method converts low-frequency annual observations into monthly estimates by using a related indicator while preserving consistency with the original annual totals.</p>
<p>Let <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> be the annual energy consumption for year <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>T</mml:mi></mml:math></inline-formula> (where <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>M</mml:mi></mml:math></inline-formula>), and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> be the corresponding monthly indicator for month <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>t</mml:mi></mml:math></inline-formula> (<inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mn>12</mml:mn><mml:mi>M</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. The method aims to estimate the monthly energy series <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, under the constraint that the monthly estimates sum to the observed annual value for each year. This constraint is formally expressed as:<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:munder><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;for&#xA0;</mml:mtext></mml:mrow><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>M</mml:mi></mml:math></disp-formula></p>
<p>Specifically, <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mrow><mml:mtext mathvariant="italic">X</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">t</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is estimated by minimizing the first differences in the ratio between the interpolated series and the indicator (<inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mrow><mml:mtext>X</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>). This approach preserves the natural variability of the high-frequency indicator while avoiding the excessive smoothing introduced by linear interpolation. The objective function is defined as:<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mtext>X</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>12</mml:mn><mml:mrow><mml:mtext>M</mml:mtext></mml:mrow></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:msub><mml:mrow><mml:mtext>X</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mfrac><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:msub><mml:mrow><mml:mtext>X</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>Subject to the aggregation constraint defined in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, this approach solves via quadratic programming and distributes annual residuals without distorting the underlying trend. This property makes the method well suited for modeling energy consumption, which generally follows changes in economic activity.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Seasonal and Trend Decomposition Using Loess (STL)</title>
<p>Energy consumption data are complex, as it is a combination of long-term macroeconomic growth and the short-term cyclic fluctuations. So putting this complex, changing data straight into prediction models can decrease the accuracy. To separate these different dynamics, the Seasonal and Trend decomposition using Loess (STL) is applied to the high-frequency monthly datasets generated in the previous disaggregation step [<xref ref-type="bibr" rid="ref-17">17</xref>].</p>
<p>The STL method is a strong, filtering-based algorithm that decomposes the original time series into three additive components. Mathematically, the original sequence <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> at time <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>t</mml:mi></mml:math></inline-formula> is expressed as:<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>where:<list list-type="simple">
<list-item><label>-</label><p><inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the trend component, capturing the low-frequency, long-term progression of energy demand driven by economic factors.</p></list-item>
<list-item><label>-</label><p><inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the seasonal component, isolating the periodic cyclic variations (such as the 12-month climate-driven cycle).</p></list-item>
<list-item><label>-</label><p><inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the stochastic residual component, which contains unpredictable, non-linear noise and market shocks.</p></list-item>
</list></p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Rolling-Window Grey Forecasting Model&#x2014;GM(1,1)</title>
<p>The baseline Grey Model, GM(1,1) [<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>], is well known for effectively managing small datasets. After applying STL decomposition, GM(1,1) is used to forecast the deterministic trend component (<inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>). However, standard grey models are static, their accuracy tends to decline in long-term forecasts because they give equal importance to all past observations. To resolve this, a rolling-window approach with a fixed size of 12 steps is applied [<xref ref-type="bibr" rid="ref-20">20</xref>]. This 12-month window is selected because it matches the annual cycle of macroeconomic and energy data. By using exactly one year of data, this setup helps the model capture short-term trends and avoid noise from outdated information.</p>
<p>Mathematically, let the trend sequence within the current window be defined as
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msup><mml:mi>X</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>4</mml:mn></mml:math></disp-formula></p>
<p>The process within each window proceeds through the following steps:</p>
<p><bold>Step 1: Accumulated Generating Operation (AGO).</bold> To weaken the randomness of the raw data, the first-order AGO sequence <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is generated:<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>k</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:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:math></disp-formula></p>
<p><bold>Step 2: Grey Differential Equation.</bold> The core GM(1,1) model is established based on a first-order differential equation. The data matrix <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>B</mml:mi></mml:math></inline-formula> and the data vector <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>Y</mml:mi></mml:math></inline-formula> are constructed as follows:<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x2212;</mml:mo><mml:mn>0.5</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>;</mml:mo><mml:mi mathvariant="bold-italic">Y</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><bold>Step 3: Parameter Estimation.</bold> The parameter vector <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mrow><mml:mover><mml:mi>a</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>, consisting of the development coefficient <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>a</mml:mi></mml:math></inline-formula> and the grey action quantity <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>b</mml:mi></mml:math></inline-formula>, is estimated using the Ordinary Least Squares (OLS) method:<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mover><mml:mi mathvariant="bold-italic">a</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>a</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>b</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mi mathvariant="bold-italic">Y</mml:mi></mml:math></disp-formula></p>
<p><bold>Step 4: Time Response Function.</bold> By solving the differential equation, the predicted accumulated value at step <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> is given by the time response function:<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msup><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mi>b</mml:mi><mml:mi>a</mml:mi></mml:mfrac><mml:mo>]</mml:mo></mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mfrac><mml:mi>b</mml:mi><mml:mi>a</mml:mi></mml:mfrac><mml:mo>,</mml:mo><mml:mi>k</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:math></disp-formula></p>
<p><bold>Step 5: Inverse AGO (I-AGO) and Rolling Mechanism.</bold> The predicted trend value is then reconstructed by subtracting the previous accumulated value:<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msup><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>To forecast the next month (step <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>), the formula is applied for <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mi>n</mml:mi></mml:math></inline-formula>. When this prediction is generated, the temporal window moves forward by one month. The oldest observation <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is discarded, the newly observed value is appended, and the parameters <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:mover><mml:mi>a</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> are continuously re-estimated. This sliding mechanism ensures the trend projection is adaptive to the latest changes in the time series.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Adaptive Neuro-Fuzzy Inference System (ANFIS) Architecture</title>
<p>While GM(1,1) is effective for linear trend, it is unsuited to capture volatile, non-linear fluctuations. To address this limitation, the Adaptive Neuro-Fuzzy Inference System (ANFIS) is used [<xref ref-type="bibr" rid="ref-21">21</xref>]. ANFIS effectively maps complex, non-linear relationships by combining the learning capabilities of artificial neural networks with the reasoning strengths of fuzzy logic. This study used a first-order Takagi-Sugeno ANFIS architecture [<xref ref-type="bibr" rid="ref-22">22</xref>], as illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Architecture of the first-order Takagi-Sugeno ANFIS model. The diagram illustrates the five processing layers and highlights the specific parameters targeted for optimization.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_86196-fig-1.tif"/>
</fig>
<p><bold>Layer 1: Fuzzification Layer.</bold> This layer contains adaptive nodes that map the input variables into fuzzy membership degrees. For each node <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>i</mml:mi></mml:math></inline-formula> the output represents the degree to which the input <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>x</mml:mi></mml:math></inline-formula> belongs to the fuzzy set <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mrow><mml:mtext>A</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> (e.g., &#x201C;Low&#x201D;, &#x201C;High&#x201D;). The corresponding output is expressed as:<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x0B5;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtext>&#xA0;for&#xA0;</mml:mtext></mml:mrow><mml:mi>i</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:math></disp-formula></p>
<p>This study employs Gaussian membership functions owing to their smoothness and strong capability in representing nonlinear patterns. The formulation of the Gaussian function is given by:<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x0B5;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula> are the center and width.</p>
<p><bold>Layer 2: Rule Layer.</bold> This layer is composed of fixed nodes represented by the <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:mi mathvariant="normal">&#x03A0;</mml:mi></mml:mrow></mml:math></inline-formula> operator. Each node determines the firing strength of a fuzzy rule by multiplying the incoming membership degrees, corresponding to the fuzzy AND operation:<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x0B5;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x0B5;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:math></disp-formula></p>
<p><bold>Layer 3: Normalization Layer.</bold> This layer contains fixed nodes denoted by <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>N</mml:mi></mml:math></inline-formula>. Each node normalizes the firing strength of the corresponding rule by dividing it by the sum of the firing strengths from all rules:<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mover><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:math></disp-formula></p>
<p><bold>Layer 4: Defuzzification (Consequent) Layer.</bold> This is the second adaptive layer. Each node computes the contribution of its corresponding fuzzy rule through a linear function. The output is defined as:<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mover><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mover><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>y</mml:mi><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></disp-formula>where {<inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>q</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:math></inline-formula>} are consequent parameters.</p>
<p><bold>Layer 5: Output Layer.</bold> The final layer consists of a single fixed node, denoted by <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow></mml:math></inline-formula>. It generates the overall predicted output by aggregating the outputs received from the preceding layer:<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mtext>Overall Output</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mover><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>Traditional ANFIS training typically uses a hybrid method combining gradient descent and least squares. However, because the search space is highly complex, gradient-based methods frequently get trapped in local optima. To address this limitation, the proposed framework employs the Grey Wolf Optimizer (GWO) to optimize both the premise parameters (Layer 1) and the consequent parameters (Layer 4).</p>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Grey Wolf Optimizer</title>
<p>Training the ANFIS model can be formulated as a global optimization problem, where the objective is to minimize the prediction error. Let <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:mi mathvariant="normal">&#x0398;</mml:mi></mml:mrow></mml:math></inline-formula> denote the complete parameter vector, consisting of both the nonlinear premise parameters and the linear consequent parameters:<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:mi mathvariant="normal">&#x0398;</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>here, <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>c</mml:mi></mml:math></inline-formula> represent the width and center of the Gaussian membership functions, while <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:math></inline-formula> are the consequent weights.</p>
<p>The optimization objective is to determine the optimal set <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msup><mml:mrow><mml:mi mathvariant="normal">&#x0398;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> that minimizes the cost function, defined as the Mean Squared Error (MSE):<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msup><mml:mrow><mml:mi mathvariant="normal">&#x0398;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>arg</mml:mi><mml:mo>&#x2061;</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x0398;</mml:mi></mml:mrow></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>actual</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>forecast</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x0398;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow></mml:math></inline-formula> is the sample size, <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msubsup><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>actual</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> is the observed value, and <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msubsup><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>forecast</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> is the model output.</p>
<p>Developed by Mirjalili et al. (2014), the GWO [<xref ref-type="bibr" rid="ref-23">23</xref>] is a meta-heuristic algorithm inspired by the social hierarchy and hunting behavior of grey wolves. The best solution is designated as the leader (<inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:math></inline-formula>), followed by the second (<inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:math></inline-formula>) and third (<inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi></mml:mrow></mml:math></inline-formula>) best solutions, while all remaining candidates are classified as followers (<inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula>). The positions of the <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> wolves are updated using the guidance provided by the three leading wolves, thereby simulating the hunting process. The distance and movement toward each leader are calculated as follows:<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" 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:msub><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi mathvariant="bold-italic">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-19"><label>(19)</label><mml:math id="mml-eqn-19" 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:msub><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi mathvariant="bold-italic">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-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:msub><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi mathvariant="bold-italic">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:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" 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:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B2;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<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:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The final position of a wolf in the next iteration is determined by averaging the positions indicated by the three leaders:<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:mi mathvariant="bold-italic">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:mfrac><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mn>3</mml:mn></mml:mfrac></mml:math></disp-formula></p>
<p>In these equations, <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi mathvariant="bold-italic">A</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi mathvariant="bold-italic">C</mml:mi></mml:math></inline-formula> are coefficient vectors. Throughout the optimization process, these parameters are adaptively updated to enable a gradual transition from exploration to exploitation.</p>
</sec>
<sec id="s3_6">
<label>3.6</label>
<title>Forecasting Framework Proposed</title>
<p>While individual forecasting models possess specific strengths, they often fail to capture the full series of energy demand when used in isolation. Building upon the strengths of temporal disaggregation, neural forecasting, and heuristic optimization, this study develops a hybrid framework termed the Decomposition-based Grey-Neuro-Fuzzy Architecture (DeGNA).</p>
<p>The DeGNA framework is systematically designed to address data scarcity as well as model linear economic growth and highly non-linear seasonal fluctuations. The complete pipeline is illustrated in <xref ref-type="fig" rid="fig-2">Fig. 2</xref> and proceeds through these fundamental steps:</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Flowchart of the proposed DeGNA framework, illustrating the data processing pipeline from Denton disaggregation to the final forecast.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_86196-fig-2.tif"/>
</fig>
<p><bold>Step 1: Temporal Disaggregation:</bold> Annual primary energy consumption data, alongside monthly reference indicator, are fed into the Denton proportional module. This mathematical transformation generates a high-frequency monthly energy series without data loss.</p>
<p><bold>Step 2: Structural Decomposition:</bold> To separate the underlying economic growth from short-term market noise, the high-frequency energy series undergoes STL decomposition. This process splits the data into three components: underlying trend, periodic seasonality, and residuals.</p>
<p><bold>Step 3: Underlying Trend Forecasting:</bold> The underlying trend component is processed by the Rolling-window GM(1,1) module (with a window size of <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>12</mml:mn></mml:math></inline-formula>). This step efficiently projects the baseline growth trajectory while adapting to recent economic shifts.</p>
<p><bold>Step 4: Non-Linear Forecasting:</bold> At the same time, an enriched feature is constructed by combining the seasonality, the residuals, and exogenous variables. This input is fed into the GWO-ANFIS engine. The GWO algorithm globally optimizes the premise and consequent parameters of the fuzzy network to accurately forecast the highly complex, non-linear variations.</p>
<p><bold>Step 5: Final Forecast:</bold> In the final step, the predicted trend from the GM(1,1) module and the predicted non-linear variation from the GWO-ANFIS module are additively combined. This reconstruction yields the final, high-precision energy demand forecast.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Simulation Experimental</title>
<sec id="s4_1">
<label>4.1</label>
<title>Data Preparation</title>
<p>This study uses macroeconomic and energy data from Vietnam from January 2009 to December 2024. The main target variable is total energy consumption, which is collected annually from Our World in Data [<xref ref-type="bibr" rid="ref-24">24</xref>]. Because forecasting models need higher-frequency data to train effectively, we use the monthly commercial electricity output from the Ministry of Industry and Trade (MOIT) [<xref ref-type="bibr" rid="ref-25">25</xref>] as a reference series. Electricity use is a reliable indicator of total energy demand, making it highly suitable for temporal disaggregation.</p>
<p>Additionally, we selected two primary input variables for the forecasting model: the Index of Industrial Production (IIP) and registered Foreign Direct Investment (FDI). We collected the IIP from the General Statistics Office [<xref ref-type="bibr" rid="ref-26">26</xref>] because the industrial sector accounts for most of Vietnam&#x2019;s energy consumption. FDI data comes from the Ministry of Planning and Investment [<xref ref-type="bibr" rid="ref-27">27</xref>], since the country&#x2019;s manufacturing activities rely heavily on foreign capital, which directly affects energy demand. The descriptive statistics for all datasets are summarized in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Descriptive statistics of the raw datasets.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Variable</th>
<th>N</th>
<th>Mean</th>
<th>Std. Dev.</th>
<th>Min</th>
<th>Max</th>
<th>Skewness</th>
</tr>
</thead>
<tbody>
<tr>
<td>Annual Data</td>
<td>Primary Energy (Billion kWh)</td>
<td>16</td>
<td>933.54</td>
<td>322.95</td>
<td>462.68</td>
<td>1457.18</td>
<td>0.0904</td>
</tr>
<tr>
<td rowspan="3">Monthly Indicators</td>
<td>Industrial Production Index (IIP)</td>
<td>192</td>
<td>101.46</td>
<td>46.04</td>
<td>36.90</td>
<td>176.20</td>
<td>0.1474</td>
</tr>
<tr>
<td>Foreign Direct Investment (Million USD)</td>
<td>192</td>
<td>1376.15</td>
<td>594.62</td>
<td>300.00</td>
<td>3671.00</td>
<td>0.8436</td>
</tr>
<tr>
<td>Commercial electricity (Billion kWh)</td>
<td>192</td>
<td>13.99</td>
<td>5.3143</td>
<td>5.0620</td>
<td>25.2000</td>
<td>0.1773</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As mentioned, advanced forecasting models&#x2014;especially neuro-fuzzy&#x2014;require large, high-frequency datasets to find patterns effectively. However, our total energy data is annual, while the economic indicators are monthly. To fix this difference in data frequency, we applied the Denton proportional disaggregation method. Using the commercial electricity output as our reference indicator, this process converts the annual energy data into a monthly series. The Denton method is ideal for this task because it ensures that the new monthly values sum exactly to the original annual total while preserving the seasonal trends in the electricity data.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Benchmark Models Configuration</title>
<p><bold>Statistical Models (ARIMA and SARIMAX) [<xref ref-type="bibr" rid="ref-28">28</xref>].</bold> For the traditional statistical models, the specific parameters included auto-regressive order (<inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>p</mml:mi></mml:math></inline-formula>), differencing degree (<inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>d</mml:mi></mml:math></inline-formula>), and moving average order (<inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>q</mml:mi></mml:math></inline-formula>), along with their seasonal counterparts (<inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>Q</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:math></inline-formula>) for SARIMAX were determined by using an automated stepwise search algorithm to minimize the Akaike Information Criterion (AIC) [<xref ref-type="bibr" rid="ref-29">29</xref>]. Based on this search process, the ARIMA model was configured with the order (<inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>). The SARIMAX model was configured with a non-seasonal order of (<inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula>) and an additional seasonal component (<inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>Q</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>12</mml:mn></mml:math></inline-formula>) to capture the 12-month cycle in the data, with IIP and FDI included as exogenous variables.</p>
<p><bold>Grey Forecasting Model&#x2014;GM(1,1).</bold> The baseline GM(1,1) model is well known for handling small datasets effectively [<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>]. To adapt it for continuous monthly forecasting, we applied a rolling-window approach [<xref ref-type="bibr" rid="ref-20">20</xref>] with a fixed size of 12 steps. We chose this 12-month window because it perfectly matches the annual cycle of our macroeconomic and energy data. By using exactly one year of data, this setup helps the model capture short-term trends and avoid noise from outdated information.</p>
<p><bold>Machine Learning &#x0026; Deep Learning Models.</bold> To evaluate the performance against modern data-driven approaches, we designed specific architectures for deep learning (LSTM [<xref ref-type="bibr" rid="ref-30">30</xref>], BiLSTM [<xref ref-type="bibr" rid="ref-31">31</xref>]) and implemented an advanced tree-based machine learning model (XGBoost [<xref ref-type="bibr" rid="ref-32">32</xref>]). For the deep learning baselines, both LSTM and BiLSTM architectures consist of a single 32-unit recurrent layer, a Dropout layer (rate &#x003D; 0.1) to avoid over-fitting, and a 16-unit ReLU Dense layer. Both were compiled with the Adam optimizer (learning rate &#x003D; 0.001) and trained for up to 300 epochs, utilizing a 15% validation split and an early stopping mechanism (patience &#x003D; 20). Furthermore, an Extreme Gradient Boosting (XGBoost) model was introduced to represent state-of-the-art machine learning. To strictly prevent over-fitting on the constrained datasets, its complexity was restricted using a shallow tree structure (max depth &#x003D; 3), a learning rate of 0.05, 300 estimators, alongside both L1 and L2 regularization penalties.</p>
<p><bold>Neuro-Fuzzy Systems.</bold> To evaluate the proposed architecture, three first-order Takagi-Sugeno ANFIS [<xref ref-type="bibr" rid="ref-21">21</xref>] variations (Gaussian membership, 4 rules) were implemented: Standard ANFIS, ANFIS-GWO, and DeGNA. The number of fuzzy rules was deliberately limited to four to reduce model complexity and mitigate over-fitting. Given four input features (lag-1, lag-12, IIP, and FDI), increasing the number of rules would substantially expand the parameter space. Restricting the model to 4 rules keeps the number of trainable parameters proportional to the available sample size (approximately 192 monthly observations), helping maintain a balance between model flexibility and generalization. Standard ANFIS was optimized via gradient descent (learning rate: 0.01, 500 epochs). Conversely, to prevent local optima, both ANFIS-GWO and DeGNA utilized the Grey Wolf Optimizer (80 search agents, 200 iterations, MSE objective), selecting the best global optimum from 30 independent runs. This GWO configuration was determined empirically through preliminary experimentation. Furthermore, the 30 independent runs act as a multi-start strategy to neutralize the stochastic sensitivity inherent to population-based search. While ANFIS-GWO uses standard historical features, DeGNA processes an enriched input space&#x2014;integrating STL seasonality, residuals, and macroeconomic indicators (IIP, FDI)&#x2014;to effectively capture complex non-linear variations. Additionally, <xref ref-type="sec" rid="s5_4">Section 5.4</xref> provides a dedicated sensitivity analysis quantifying the robustness of DeGNA&#x2019;s performance to these specific parameter choices.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Evaluation Framework and Statistical Tests</title>
<p>To fully test the stability and effectiveness of the proposed DeGNA framework, a strict testing process was established, including data validation strategies, stationarity checks, standard error metrics, and non-parametric statistical tests.</p>
<p><bold>Data Splitting and Cross-Validation Strategy.</bold> To evaluate the models, we kept the natural order of the data by splitting it into 80% for training and 20% for testing. The first 80% of the data was used to train the models and find the best parameters, while the last 20% was kept for testing. Additionally, to ensure the models are stable over time, we used a Time-Series Walk-Forward Cross-Validation. This method used an &#x201C;expanding window&#x201D; with 5 folds. In each step, we moved the testing period forward by 12 months.</p>
<p><bold>Stationarity Tests.</bold> To ensure reliable forecasting, verifying time-series stationarity is essential. This study employs a dual-validation framework utilizing the Augmented Dickey-Fuller (ADF) [<xref ref-type="bibr" rid="ref-33">33</xref>,<xref ref-type="bibr" rid="ref-34">34</xref>] and Kwiatkowski-Phillips-Schmidt-Shin (KPSS) [<xref ref-type="bibr" rid="ref-35">35</xref>] tests. The ADF test evaluates the presence of a unit root (stationarity confirmed if <italic>p</italic> &#x003C; 0.05), while the KPSS test assumes stationarity as its null hypothesis (stability confirmed if <italic>p</italic> &#x003E; 0.05). Consequently, a series is considered strictly stationary only if it satisfies both criteria. This cross-verification dictates whether further differencing is necessary prior to modeling.</p>
<p><bold>Forecasting Evaluation Metrics.</bold> To validate the predictive accuracy of the models, four metrics were calculated: Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), and the Coefficient of Determination (<inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:msup><mml:mrow><mml:mtext>R</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>) [<xref ref-type="bibr" rid="ref-36">36</xref>,<xref ref-type="bibr" rid="ref-37">37</xref>]. They are mathematically defined as follows:<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" 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>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" 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>A</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<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>M</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>100</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>|</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mfrac><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:msup><mml:mi>R</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><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:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><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:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mover><mml:mi>y</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of predictions, <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the actual observed value, <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mrow><mml:mover><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> is the forecasted value, and <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mover><mml:mi>y</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:math></inline-formula> denotes the mean of the actual values.</p>
<p><bold>Statistical Significance.</bold> Standard error metrics alone cannot determine whether performance disparities stem from true algorithmic superiority or random sample variance. To rigorously validate the proposed framework, we employed the Diebold&#x2013;Mariano (DM) test [<xref ref-type="bibr" rid="ref-38">38</xref>], incorporating the Harvey et al. (1997) [<xref ref-type="bibr" rid="ref-39">39</xref>] modification to correct for small-sample biases in finite time series. If the resulting <italic>p</italic>-value is below 0.05, the difference in performance is considered statistically significant.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Empirical Results &#x0026; Analysis</title>
<sec id="s5_1">
<label>5.1</label>
<title>Data Preprocessing &#x0026; Stationarity Analysis</title>
<p><bold>Temporal Disaggregation Analysis.</bold> To resolve the frequency mismatch between annual energy consumption data and monthly indicators, this study employed the Denton proportional temporal disaggregation method. Monthly commercial electricity output was selected as the reference indicator, given its near-perfect linear correlation with primary energy at the annual level (<inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>0.9977</mml:mn></mml:math></inline-formula>). However, it should be noted that residual uncertainty remains, particularly at seasonal turning points where the reference indicator may not perfectly capture total primary energy dynamics. This is an inherent limitation of any disaggregation approach in the absence of directly observed monthly data.</p>
<p>The requirement of this process is the preservation of the original low-frequency data. Notably, the computational results confirm that the Denton method perfectly maintains the annual totals, with a maximum error of <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mn>2.27</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>13</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>. This clearly ensures no data loss during transformation, providing a highly reliable high-frequency dataset for the next forecasting phase. It should be noted, however, that the resulting monthly series constitutes synthetic (pseudo-monthly) data derived from annual totals, not directly observed records. Downstream forecasting results should therefore be interpreted with this disaggregation uncertainty in mind. As illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, the Denton method preserves within-year seasonal patterns more faithfully than linear interpolation.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>A visual comparison of temporal disaggregation methods. The subplots display the within-year trends generated by the Denton method and standard linear interpolation, clearly demonstrating the Denton method&#x2019;s advantage in preserving seasonal patterns and maintaining structural smoothness.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_86196-fig-3.tif"/>
</fig>
<p>To verify the reliability of the high-frequency data, we compared the Denton method against a standard linear approach. <xref ref-type="table" rid="table-3">Table 3</xref> shows the detailed quantitative results of this comparison.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Quantitative comparison of temporal disaggregation methods.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Evaluation Metric</th>
<th>Denton Method</th>
<th>Linear Interpolation</th>
</tr>
</thead>
<tbody>
<tr>
<td>Annual Constraint Error</td>
<td>0.0000</td>
<td>0.0000</td>
</tr>
<tr>
<td>SSD of Ratio Diff</td>
<td>0.0413</td>
<td>27.9342</td>
</tr>
<tr>
<td>Pattern Fidelity</td>
<td>0.9974</td>
<td>0.9741</td>
</tr>
<tr>
<td>Max Year-Boundary Jump</td>
<td>25.9040</td>
<td>4.4239</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As presented in <xref ref-type="table" rid="table-3">Table 3</xref>, both approaches perfectly preserve the annual totals (<inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>0.000</mml:mn></mml:math></inline-formula>). While linear interpolation shows a smaller maximum year-boundary jump (4.4239 vs. 25.9040), this smoothness completely ignores the reference indicator, resulting in a lower pattern fidelity (<inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>0.9741</mml:mn></mml:math></inline-formula>) and failing to reflect actual consumption dynamics. In contrast, the Denton method is directly designed to balance temporal distribution with structural preservation. It minimizes the Sum of Squared Differences (SSD) to 0.0413, outperforming the baseline by approximately 677. Notably, the Denton-derived series achieves a near-perfect Pearson correlation (<inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>0.9974</mml:mn></mml:math></inline-formula>) with the reference indicator. This confirms that the Denton method successfully captures the seasonal variations, which logically explains its larger year-boundary jumps.</p>

<p><bold>Stationarity Assessment.</bold> Following the successful temporal disaggregation of the datasets, the next phase is to verify the stationarity of the generated high-frequency series. As outlined in <xref ref-type="sec" rid="s4_3">Section 4.3</xref>, a dual-testing approach using the Augmented Dickey-Fuller (ADF) and Kwiatkowski-Phillips-Schmidt-Shin (KPSS) tests was conducted. As detailed in <xref ref-type="table" rid="table-4">Table 4</xref>, the evaluation shows that the monthly energy consumption data are non-stationary. The data get an ADF <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>p</mml:mi></mml:math></inline-formula>-value of 0.9914 and a KPSS <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>p</mml:mi></mml:math></inline-formula>-value of 0.0100. This non-stationarity is visually evident in the data&#x2019;s clear upward trend and the slow decay of its Autocorrelation Function (ACF) plot (<xref ref-type="fig" rid="fig-4">Fig. 4</xref>). To stabilize the series, first-order differencing (<inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>) was applied. Subsequent tests confirmed that the transformed data (dEnergy) successfully achieved stationarity, as the ADF <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>p</mml:mi></mml:math></inline-formula>-value dropped to 0.0000 and the KPSS <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>p</mml:mi></mml:math></inline-formula>-value rose to 0.1000.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Unit root and stationarity test results for energy demand.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Variable</th>
<th>Test</th>
<th>Raw Level Statistic (<inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi mathvariant="bold-italic">p</mml:mi></mml:math></inline-formula>-Value)</th>
<th>Differenced Statistic (<inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi mathvariant="bold-italic">p</mml:mi></mml:math></inline-formula>-Value)</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="2">Energy Demand</td>
<td><italic>ADF</italic></td>
<td>0.9914</td>
<td>0.0000</td>
</tr>
<tr>
<td><italic>KPSS</italic></td>
<td>0.0100</td>
<td>0.1000</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Stationarity transformation and exploratory data analysis of the monthly energy demand.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_86196-fig-4.tif"/>
</fig>
<p>Beyond confirming stationarity, the Exploratory Data Analysis (EDA) uncovered key structural patterns in the data. While the auto-correlation function (ACF) of the differenced series decays rapidly, it shows a significant spike at lag 12, clearly indicating a strong annual cycle. This seasonality is further supported by the monthly consumption profile, which peaks in June and reaches a trough in February. These empirical findings strongly justify the inclusion of seasonal features, specifically 12-month lags, in the forecasting models.</p>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Forecasting Performance Comparison</title>
<p>To provide a comprehensive evaluation for the DeGNA framework, we used the stationary, high-frequency monthly datasets derived from the previous step. The model&#x2019;s performance on the test set was compared against four benchmarks: traditional statistical methods (ARIMA, SARIMAX), the classic grey forecasting model (GM(1,1)), machine learning models like XGBoost, deep learning architectures (LSTM, BiLSTM), and existing neuro-fuzzy baselines (Standard ANFIS, ANFIS-GWO). <xref ref-type="table" rid="table-5">Table 5</xref> presents the forecasting performance of all models on the held-out test set.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Forecasting performance comparison of the proposed DeGNA framework against baseline models on the test set.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Model</th>
<th>RMSE</th>
<th>MAE</th>
<th>MAPE</th>
<th>R<sup>2</sup></th>
<th>Training Time (s)</th>
</tr>
</thead>
<tbody>
<tr>
<td></td>
<td>GM(1,1)</td>
<td>14.7308</td>
<td>12.9028</td>
<td>11.6312</td>
<td>&#x2212;0.3219</td>
<td>0.040</td>
</tr>
<tr>
<td rowspan="2">ANFIS Variants</td>
<td>ANFIS_Std</td>
<td>8.5706</td>
<td>6.4498</td>
<td>5.8797</td>
<td>0.5525</td>
<td>24.282</td>
</tr>
<tr>
<td>ANFIS_GWO</td>
<td>6.4590</td>
<td>5.2143</td>
<td>4.7928</td>
<td>0.7459</td>
<td>177.586</td>
</tr>
<tr>
<td rowspan="2">Statistical Models</td>
<td>ARIMA</td>
<td>8.4778</td>
<td>6.2375</td>
<td>5.8496</td>
<td>0.5622</td>
<td>0.520</td>
</tr>
<tr>
<td>SARIMAX</td>
<td>5.6947</td>
<td>4.0175</td>
<td>3.7049</td>
<td>0.8024</td>
<td>200.110</td>
</tr>
<tr>
<td rowspan="3">ML and DL Models</td>
<td>XGBoost</td>
<td>7.4868</td>
<td>4.9202</td>
<td>4.6715</td>
<td>0.6585</td>
<td>0.194</td>
</tr>
<tr>
<td>LSTM</td>
<td>7.1728</td>
<td>5.1385</td>
<td>4.8603</td>
<td>0.6866</td>
<td>12.847</td>
</tr>
<tr>
<td>BiLSTM</td>
<td>7.2877</td>
<td>5.3193</td>
<td>5.0242</td>
<td>0.6765</td>
<td>12.000</td>
</tr>
<tr>
<td>Proposed Model</td>
<td>DeGNA</td>
<td>5.7620</td>
<td>4.5071</td>
<td>4.1052</td>
<td>0.7977</td>
<td>168.790</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Compared with the deep learning baselines, DeGNA achieves consistently lower forecasting errors. Specifically, it reduces the RMSE to 5.76 and the MAPE to 4.11%, achieving lower point-forecasting errors on this test set than LSTM (RMSE: 7.17; MAPE: 4.86%) and BiLSTM (RMSE: 7.28; MAPE: 5.02%), and the advanced tree-based XGBoost model (RMSE: 7.49; MAPE: 4.67%). These results suggest that the hybrid grey-neuro-fuzzy architecture remains effective under limited-data conditions. The visual fit of all models on the test set is shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Predicted vs. actual monthly energy demand on the test set, comparing the visual fit of the proposed DeGNA framework against benchmark statistical and deep learning models.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_86196-fig-5.tif"/>
</fig>
<p>Furthermore, an internal evaluation of the neuro-fuzzy models confirms the efficiency of the proposed architecture. First, replacing standard gradient-based training with the GWO meta-heuristic yields substantial improvements: specifically, ANFIS-GWO achieves a 24.6% reduction in RMSE (from 8.57 to 6.46) and a decrease in MAPE from 5.88% to 4.79%. These results indicate that GWO effectively addresses the non-convex optimization problem encountered during ANFIS training. Finally, the proposed architecture&#x2014;DeGNA performs even better than ANFIS-GWO. Specifically, it reduces the RMSE by 10.8% (from 6.46 to 5.76) and the MAPE by 14.2% (from 4.79% to 4.11%). This finding suggests that decomposing the original series into trend, seasonal, and residual components improves forecasting accuracy beyond optimization alone.</p>
<p>Regarding computational complexity, <xref ref-type="table" rid="table-5">Table 5</xref> also reports the execution time for the training phase. The proposed DeGNA framework requires approximately 168.79 s to complete its rigorous global optimization process. While this computational overhead is higher than that of deep learning baselines (e.g., LSTM at 12.85 s) or shallow tree models (XGBoost at 0.19 s), this represents an acceptable trade-off. The additional training time is a necessary investment in global parameter optimization, allowing DeGNA to achieve higher point-forecasting accuracy and greater structural stability than these computationally lighter deep learning models. Furthermore, the framework remains highly tractable; in fact, DeGNA executes faster than the automated stepwise parameter search required for SARIMAX (200.11 s). Given that national energy demand forecasting operates on a monthly planning horizon, a training phase of under three minutes demonstrates practical for monthly energy planning applications.</p>

<p>Although SARIMAX achieves a slightly lower average forecasting error (MAPE of 3.70% compared to 4.11% for DeGNA), its performance deteriorates under extreme demand conditions. As shown in <xref ref-type="table" rid="table-6">Table 6</xref> and <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, SARIMAX exhibits substantially larger prediction errors during these periods, with a maximum error of 22.23, which is 44.5% higher than DeGNA&#x2019;s worst-case error of 15.39. In addition, DeGNA yields a lower error standard deviation (3.59 vs. 4.04) and produces no extreme outliers. These findings indicate that while SARIMAX is slightly more accurate on average under normal conditions, DeGNA provides more consistent forecasts under highly volatile demand conditions.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Error distribution comparison.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Metric</th>
<th>SARIMAX</th>
<th>DeGNA</th>
</tr>
</thead>
<tbody>
<tr>
<td>Max Absolute Error</td>
<td>22.2339</td>
<td>15.3872</td>
</tr>
<tr>
<td>95th Percentile Error</td>
<td>9.8758</td>
<td>10.0685</td>
</tr>
<tr>
<td>Std of Absolute Errors</td>
<td>4.0361</td>
<td>3.5899</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Boxplot of absolute forecasting errors on the test set.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_86196-fig-6.tif"/>
</fig>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Robustness and Significance Analysis</title>
<p>To ensure that DeGNA&#x2019;s results in <xref ref-type="sec" rid="s5_2">Section 5.2</xref> are not just due to luck, we performed further tests. This validation includes two parts: first, checking whether the differences between models are statistically significant, and second, testing the model&#x2019;s stability over different time periods using cross-validation.</p>
<p><xref ref-type="table" rid="table-7">Table 7</xref> summarizes the results of the Diebold&#x2013;Mariano (DM) test with the small-sample correction and the Wilcoxon signed-rank test. Notably, DeGNA demonstrates a clear statistical advantage over foundational benchmarks, confirming high significance (<italic>p</italic> &#x003C; 0.01) against GM(1,1). Furthermore, the framework remains reliable when compared to Standard ANFIS and ARIMA. With <italic>p</italic>-values generally under 0.10&#x2013;and strictly <italic>p</italic> less than 0.05 in the DM test for ANFIS and the Wilcoxon test for ARIMA.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Statistical significance tests against the proposed DeGNA framework.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th></th>
<th colspan="3">Diebold&#x2013;Mariano Test</th>
<th colspan="3">Wilcoxon Signed-Rank Test</th>
</tr>
<tr>
<th></th>
<th>DM stat</th>
<th><italic>p</italic>-Value</th>
<th>Result</th>
<th>W stat</th>
<th><italic>p</italic>-Value</th>
<th>Result</th>
</tr>
</thead>
<tbody>
<tr>
<td>GM (1,1)</td>
<td>&#x2212;4.657</td>
<td>0.000</td>
<td>&#x002A;&#x002A;&#x002A;</td>
<td>33.0</td>
<td>0.000</td>
<td>&#x002A;&#x002A;&#x002A;</td>
</tr>
<tr>
<td>ANFIS_Std</td>
<td>&#x2212;2.327</td>
<td>0.026</td>
<td>&#x002A;&#x002A;</td>
<td>231.0</td>
<td>0.056</td>
<td>&#x002A;</td>
</tr>
<tr>
<td>ANFIS_GWO</td>
<td>&#x2212;1.320</td>
<td>0.195</td>
<td>ns</td>
<td>269.0</td>
<td>0.161</td>
<td>ns</td>
</tr>
<tr>
<td>ARIMA</td>
<td>&#x2212;1.988</td>
<td>0.055</td>
<td>&#x002A;</td>
<td>226.0</td>
<td>0.047</td>
<td>&#x002A;&#x002A;</td>
</tr>
<tr>
<td>SARIMAX</td>
<td>&#x002B;0.061</td>
<td>0.952</td>
<td>ns</td>
<td>384.0</td>
<td>0.788</td>
<td>ns</td>
</tr>
<tr>
<td>XGBoost</td>
<td>&#x2212;1.238</td>
<td>0.224</td>
<td>ns</td>
<td>343.0</td>
<td>0.565</td>
<td>ns</td>
</tr>
<tr>
<td>LSTM</td>
<td>&#x2212;1.524</td>
<td>0.137</td>
<td>ns</td>
<td>311.0</td>
<td>0.369</td>
<td>ns</td>
</tr>
<tr>
<td>BiLSTM</td>
<td>&#x2212;1.668</td>
<td>0.104</td>
<td>ns</td>
<td>296.0</td>
<td>0.285</td>
<td>ns</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-7fn1" fn-type="other">
<p>Note: &#x002A;&#x002A;&#x002A;<italic>p</italic> &#x003C; 0.01, &#x002A;&#x002A;<italic>p</italic> &#x003C; 0.05, &#x002A;<italic>p</italic> &#x003C; 0.10, ns &#x003D; not significant. DM test applies the Harvey&#x2013;Leybourne&#x2013;Newbold (1997) small-sample correction.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>In contrast, the statistical tests indicate no significant differences in average point-forecasting accuracy between DeGNA and advanced data-driven baselines like XGBoost, LSTM, and BiLSTM. Consequently, we acknowledge that DeGNA performs comparably to these models on this specific test split. Nevertheless, achieving this comparable accuracy remains a substantial advantage, as it proves the proposed framework can deliver highly competitive results without demanding massive training datasets, GPU acceleration, or suffering from black-box opacity. Furthermore, while their average errors on the test set are statistically similar, DeGNA possesses a distinct structural advantage in mitigating temporal variance, which will be demonstrated in the subsequent cross-validation analysis.</p>
<p>Finally, the comparison with SARIMAX highlights a crucial trade-off between average accuracy and structural stability. It is important to note that while DeGNA yields a slightly higher average MAPE than SARIMAX (4.11% vs. 3.70%), the Diebold&#x2013;Mariano test confirms this difference is not statistically significant (DM stat &#x003D; &#x002B;0.061, <italic>p</italic> &#x003D; 0.952). The preference for the DeGNA framework is therefore justified not by marginal gains in average accuracy, but by its capacity to mitigate extreme forecasting failures. Specifically, SARIMAX&#x2019;s maximum absolute error reaches 22.23, which is 44.5% higher than DeGNA&#x2019;s worst-case error of 15.39. Furthermore, DeGNA maintains a lower error standard deviation (3.59 vs. 4.04), indicating superior temporal stability across structurally disrupted periods. By avoiding these extreme deviations, DeGNA proves to be significantly more robust when the underlying data distribution shifts.</p>
<p>Cross-validation results summarized in <xref ref-type="table" rid="table-8">Table 8</xref>, deep learning models (LSTM and BiLSTM) yield the highest mean errors alongside the largest fold-to-fold variance (MAPE &#x003E; 8.0 &#x00B1; 3.0%), which is consistent with their well-known sensitivity to limited training data. While XGBoost and SARIMAX achieve lower mean MAPE (6.06% and 6.51%, respectively), both exhibit notable instability across folds (standard deviations of &#x00B1;1.71% and &#x00B1;2.81%). In contrast, DeGNA records the lowest standard deviation (&#x00B1;1.09%), indicating the most consistent forecasting performance across different validation periods.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Summary of walk-forward cross-validation performance (Mean &#x00B1; Std) across 5 sequential folds.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>RMSE</th>
<th>MAE</th>
<th>MAPE</th>
</tr>
</thead>
<tbody>
<tr>
<td>ARIMA</td>
<td>11.848 &#x00B1; 3.057</td>
<td>10.375 &#x00B1; 3.239</td>
<td>9.372 &#x00B1; 2.474</td>
</tr>
<tr>
<td>SARIMAX</td>
<td>7.868 &#x00B1; 2.783</td>
<td>6.638 &#x00B1; 2.629</td>
<td>6.511 &#x00B1; 2.809</td>
</tr>
<tr>
<td>XGBoost</td>
<td>7.711 &#x00B1; 2.300</td>
<td>6.624 &#x00B1; 2.269</td>
<td>6.062 &#x00B1; 1.714</td>
</tr>
<tr>
<td>LSTM</td>
<td>10.213 &#x00B1; 3.859</td>
<td>8.726 &#x00B1; 3.667</td>
<td>8.472 &#x00B1; 3.751</td>
</tr>
<tr>
<td>BiLSTM</td>
<td>10.502 &#x00B1; 3.519</td>
<td>9.233 &#x00B1; 3.466</td>
<td>8.900 &#x00B1; 3.613</td>
</tr>
<tr>
<td>DeGNA (Proposed)</td>
<td>9.114 &#x00B1; 1.600</td>
<td>7.681 &#x00B1; 1.713</td>
<td>7.043 &#x00B1; 1.089</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The per-fold results in <xref ref-type="table" rid="table-9">Table 9</xref> provide additional insight into the source of this stability. During Folds 1&#x2013;3 (2020&#x2013;2022)&#x2014;a period marked by the COVID-19 demand shock and subsequent recovery&#x2014;DeGNA consistently outperforms SARIMAX (average MAPE: 6.26% vs. 7.99%), as its STL-based decomposition effectively separates structural disruptions from the underlying trend. Conversely, in Folds 4&#x2013;5 (2023&#x2013;2024), a period characterized by rapid and near-monotonic demand growth driven by post-pandemic manufacturing expansion and rising FDI inflows, SARIMAX&#x2019;s auto-regressive structure adapts more efficiently to the accelerating regime (average MAPE: 4.31% vs. 8.21%). This pattern indicates that DeGNA&#x2019;s decomposition architecture is particularly well-suited to structurally volatile periods, while purely statistical models retain an advantage under smooth, trend-dominant conditions. For national energy planning in an emerging economy facing recurring external shocks, DeGNA&#x2019;s stable performance may be more operationally reliable than models with lower average errors but larger worst-case failures.</p>
<table-wrap id="table-9">
<label>Table 9</label>
<caption>
<title>Per-fold MAPE (%) across the walk-forward cross-validation window. Bold values indicate the best-performing model for each fold.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>Fold 1</th>
<th>Fold 2</th>
<th>Fold 3</th>
<th>Fold 4</th>
<th>Fold 5</th>
</tr>
</thead>
<tbody>
<tr>
<td>ARIMA</td>
<td>7.34</td>
<td>7.08</td>
<td>7.70</td>
<td>12.86</td>
<td>11.87</td>
</tr>
<tr>
<td>SARIMAX</td>
<td>8.07</td>
<td>11.35</td>
<td>4.54</td>
<td><bold>4.38</bold></td>
<td><bold>4.23</bold></td>
</tr>
<tr>
<td>XGBoost</td>
<td><bold>4.82</bold></td>
<td><bold>4.49</bold></td>
<td>4.69</td>
<td>8.10</td>
<td>8.22</td>
</tr>
<tr>
<td>LSTM</td>
<td>14.56</td>
<td>10.81</td>
<td><bold>4.00</bold></td>
<td>6.47</td>
<td>6.52</td>
</tr>
<tr>
<td>BiLSTM</td>
<td>14.95</td>
<td>10.80</td>
<td>4.68</td>
<td>7.38</td>
<td>6.69</td>
</tr>
<tr>
<td>DeGNA (Proposed)</td>
<td>5.56</td>
<td>6.65</td>
<td>6.58</td>
<td>8.77</td>
<td>7.65</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5_4">
<label>5.4</label>
<title>Sensitivity Analysis</title>
<p>To assess the robustness of DeGNA with respect to its key hyper-parameters, a one-at-a-time sensitivity analysis was performed using the same 5-fold walk-forward cross-validation procedure described in <xref ref-type="sec" rid="s4_3">Section 4.3</xref>. The analysis focused on the rolling window size, the number of ANFIS rules, and the GWO population and iteration settings. For each experiment, all parameters were fixed at their default values (window size equal 12, number of rules equal 4, number of wolves equal 80, and maximum iterations equal 200), while only one parameter was varied within a reasonable range. The resulting test MAPE and its standard deviation were then averaged across the five validation folds.</p>
<p>As shown in <xref ref-type="table" rid="table-10">Table 10</xref> and <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, the mean MAPE remained relatively stable across all tested parameter ranges, varying by only 0.13&#x2013;0.97 percentage points. This variation was smaller than the cross-fold standard deviation (1.09&#x2013;1.64 percentage points), and the uncertainty ranges largely overlapped across all parameter settings.</p>
<table-wrap id="table-10">
<label>Table 10</label>
<caption>
<title>Summary of sensitivity analysis results for key empirical hyper-parameters.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Tested Values</th>
<th>MAPE (%) Mean &#x00B1; Std</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="5">Rolling window size</td>
<td>6</td>
<td>7.00 &#x00B1; 1.12</td>
</tr>
<tr>
<td>9</td>
<td>7.01 &#x00B1; 1.10</td>
</tr>
<tr>
<td>12 (used)</td>
<td>7.04 &#x00B1; 1.09</td>
</tr>
<tr>
<td>15</td>
<td>7.08 &#x00B1; 1.08</td>
</tr>
<tr>
<td>18</td>
<td>7.12 &#x00B1; 1.09</td>
</tr>
<tr>
<td rowspan="5">Number of ANFIS rules</td>
<td>2</td>
<td>6.37 &#x00B1; 1.24</td>
</tr>
<tr>
<td>3</td>
<td>6.45 &#x00B1; 1.25</td>
</tr>
<tr>
<td>4 (used)</td>
<td>7.04 &#x00B1; 1.09</td>
</tr>
<tr>
<td>5</td>
<td>6.44 &#x00B1; 1.22</td>
</tr>
<tr>
<td>6</td>
<td>6.74 &#x00B1; 1.24</td>
</tr>
<tr>
<td rowspan="5">GWO population size (n_wolves)</td>
<td>20</td>
<td>6.07 &#x00B1; 1.64</td>
</tr>
<tr>
<td>40</td>
<td>6.48 &#x00B1; 1.41</td>
</tr>
<tr>
<td>60</td>
<td>6.18 &#x00B1; 1.10</td>
</tr>
<tr>
<td>80 (used)</td>
<td>7.04 &#x00B1; 1.09</td>
</tr>
<tr>
<td>100</td>
<td>6.94 &#x00B1; 1.57</td>
</tr>
<tr>
<td rowspan="5">GWO max iterations</td>
<td>50</td>
<td>6.86 &#x00B1; 1.44</td>
</tr>
<tr>
<td>100</td>
<td>7.20 &#x00B1; 1.10</td>
</tr>
<tr>
<td>150</td>
<td>6.58 &#x00B1; 1.26</td>
</tr>
<tr>
<td>200 (used)</td>
<td>7.04 &#x00B1; 1.09</td>
</tr>
<tr>
<td>300</td>
<td>6.79 &#x00B1; 1.36</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Sensitivity analysis of key empirical hyperparameters. The solid blue line represents the mean MAPE across 5 folds, while the error bars indicate the standard deviation. The red dot highlights the final hyper-parameter value selected for the DeGNA framework.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_86196-fig-7.tif"/>
</fig>
<p>Among the tested parameters, the rolling window size exhibited the lowest sensitivity, with the mean MAPE ranging from 7.00% to 7.12% for window sizes between 6 and 18 months. The selected value of 12 months is also consistent with the annual seasonal cycle identified in the earlier time-series analysis (<xref ref-type="fig" rid="fig-4">Fig. 4</xref>). The number of fuzzy rules showed similarly stable behavior, with the mean MAPE varying between 6.37% and 7.04% for configurations ranging from 2 to 6 rules. The selected configuration of four rules provides a reasonable balance between model complexity and the available sample size (<inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>n</mml:mi><mml:mo>&#x2248;</mml:mo><mml:mn>192</mml:mn></mml:math></inline-formula> monthly observations).</p>

<p>For the GWO parameters, increasing the population size from 20 to 80 wolves reduced the cross-fold standard deviation from &#x00B1;1.64% to &#x00B1;1.09%, indicating more consistent optimization performance across folds. Further increases beyond 80 wolves provided limited additional improvement, suggesting that this setting offers a practical trade-off between stability and computational cost. Similarly, the maximum number of iterations showed only modest variation in mean MAPE (6.58%&#x2013;7.20%), indicating that 200 iterations are sufficient to achieve stable optimization performance.</p>
<p>Overall, the sensitivity analysis suggests that DeGNA&#x2019;s forecasting performance is relatively robust to moderate changes in its hyper-parameter settings, supporting the reliability of the reported configuration.</p>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>Forecasting national energy demand under data-scarce conditions presents a critical challenge for developing economies. This study addresses the data limitation by developing DeGNA, a hybrid forecasting framework for long-term macroeconomic prediction. By combining STL, GM(1,1), GWO-ANFIS, and key economic indicators (IIP and FDI), DeGNA successfully captures complex consumption patterns without requiring extensive historical datasets.</p>
<p>Empirical evaluations confirm the robustness of the proposed framework. On the test set, DeGNA achieved a MAPE of 4.11%, statistically outperforming foundational models such as GM(1,1) (<italic>p</italic> &#x003C; 0.01) and ARIMA (<italic>p</italic> &#x003C; 0.05). Statistical significance testing demonstrates that DeGNA performs comparably to advanced ML/DL models (XGBoost, LSTM, and BiLSTM). However, evaluation on a single test split does not fully reflect model stability under varying temporal conditions. The 5-fold walk-forward cross-validation results (<xref ref-type="table" rid="table-8">Tables 8</xref> and <xref ref-type="table" rid="table-9">9</xref>) provide a complementary assessment of generalization performance. Although SARIMAX and XGBoost obtain lower average MAPEs (6.51% and 6.06%, respectively), they exhibit substantially greater variability across folds (&#x00B1;2.81% and &#x00B1;1.71%), indicating less stable generalization performance. In contrast, DeGNA demonstrates superior performance precisely during structurally disrupted periods, where its STL decomposition isolates demand shocks from the underlying trend&#x2014;a scenario frequently encountered in emerging economies.</p>

<p>Under stable, trend-dominant conditions, purely autoregressive models such as SARIMAX may retain a marginal average accuracy advantage. However, for emerging economies subject to recurring structural shocks, DeGNA&#x2019;s stability evidenced by the lowest cross-validation variance (&#x00B1;1.09%) offers greater operational reliability. In real-world energy management, especially in Vietnam, forecasting stability may be more valuable than marginal improvements in average accuracy because large prediction errors can disproportionately affect long-term planning decisions. By minimizing extreme forecasting failures, DeGNA provides policymakers with a dependable tool to optimize grid investments, mitigate supply shortage risks, and safeguard national energy security. Although the proposed framework achieved strong predictive performance, several limitations should be acknowledged. First, the monthly observations were generated using the Denton interpolation method rather than directly measured, resulting in a pseudo-monthly dataset. As a result, errors introduced during disaggregation may also affect the subsequent forecasting results. Although this risk was mitigated by anchoring the disaggregation to a highly correlated reference indicator (r &#x003D; 0.9974) and by employing strict out-of-sample validation, these limitations should still be acknowledged. Secondly, the temporal scope is limited to a relatively short data period (2009&#x2013;2024), which may restrict the models&#x2019; exposure to long-term multi-decadal economic cycles. Lastly, this research serves as a single-country case study focused exclusively on Vietnam. While it is highly representative of rapidly growing emerging economies, the specific macroeconomic dynamics (IIP, FDI) may not perfectly generalize to developed nations with different energy consumption patterns.</p>
<p>As official high-frequency macroeconomic datasets and longer historical time series become available, future studies could further validate and refine this framework using those ground-truth records. Furthermore, future research should expand the application of the DeGNA framework to a multi-country analysis, comparing its robustness across different developing and developed economic regions. Incorporating variables such as renewable-energy penetration or climate indicators represents a promising extension for improving long-term forecasting accuracy.</p>
</sec>
</body>
<back>
<ack>
<p>Not applicable.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The research article was contributed by: Conceptualization, Xuan Kien Pham, Van Thanh Phan, Duc Trien Nguyen, and Van Dat Nguyen; methodology, Van Thanh Phan and Duc Trien Nguyen; software, Van Thanh Phan, Duc Trien Nguyen, Van Dat Nguyen, and Xuan Kien Pham; validation, Van Thanh Phan, Duc Trien Nguyen, Van Dat Nguyen, and Xuan Kien Pham; formal analysis, Duc Trien Nguyen, Van Dat Nguyen, and Xuan Kien Pham; investigation, Van Thanh Phan and Duc Trien Nguyen; resources, Van Thanh Phan and Duc Trien Nguyen; data curation, Duc Trien Nguyen, Xuan Kien Pham, and Van Dat Nguyen; writing&#x2014;original draft preparation, Van Thanh Phan, Duc Trien Nguyen, Van Dat Nguyen, and Xuan Kien Pham; writing&#x2014;review and editing, Van Thanh Phan, Duc Trien Nguyen, Van Dat Nguyen, and Xuan Kien Pham; visualization, Van Thanh Phan, Duc Trien Nguyen, Van Dat Nguyen, and Xuan Kien Pham; supervision, Van Thanh Phan; project administration, Van Thanh Phan, Van Dat Nguyen, and Xuan Kien Pham. All authors reviewed and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The datasets supporting the findings of this study are publicly available on Zenodo at <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.5281/zenodo.21028899">https://doi.org/10.5281/zenodo.21028899</ext-link>. Raw data were originally sourced from Our World in Data [<xref ref-type="bibr" rid="ref-24">24</xref>], MOIT [<xref ref-type="bibr" rid="ref-25">25</xref>], GSO [<xref ref-type="bibr" rid="ref-26">26</xref>], and MPI [<xref ref-type="bibr" rid="ref-27">27</xref>].</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.</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>Nguyen</surname> <given-names>MP</given-names></string-name>, <string-name><surname>Ponomarenko</surname> <given-names>T</given-names></string-name>, <string-name><surname>Nguyen</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Energy transition in Vietnam: a strategic analysis and forecast</article-title>. <source>Sustainability</source>. <year>2024</year>;<volume>16</volume>(<issue>5</issue>):<fpage>1969</fpage>. doi:<pub-id pub-id-type="doi">10.3390/su16051969</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Prime Minister of Vietnam</collab></person-group>. <article-title>Decision No. 500/QD-TTg: approving the national power development plan for 2021&#x2013;2030, with a vision to 2050. Hanoi, Vietnam: Government of Vietnam</article-title>; <year>2023 [cited 2026 Jan 1]</year>. Available from: <ext-link ext-link-type="uri" xlink:href="https://vanban.chinhphu.vn/?pageid=27160&#x0026;docid=207889">https://vanban.chinhphu.vn/?pageid=27160&#x0026;docid=207889</ext-link>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kontopoulou</surname> <given-names>VI</given-names></string-name>, <string-name><surname>Panagopoulos</surname> <given-names>AD</given-names></string-name>, <string-name><surname>Kakkos</surname> <given-names>I</given-names></string-name>, <string-name><surname>Matsopoulos</surname> <given-names>GK</given-names></string-name></person-group>. <article-title>A review of ARIMA vs. machine learning approaches for time series forecasting in data driven networks</article-title>. <source>Fut Internet</source>. <year>2023</year>;<volume>15</volume>(<issue>8</issue>):<fpage>255</fpage>. doi:<pub-id pub-id-type="doi">10.3390/fi15080255</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>Steinbuks</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Assessing the accuracy of electricity production forecasts in developing countries</article-title>. <source>Int J Forecast</source>. <year>2019</year>;<volume>35</volume>(<issue>3</issue>):<fpage>1175</fpage>&#x2013;<lpage>85</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ijforecast.2019.04.009</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>Bhattacharyya</surname> <given-names>SC</given-names></string-name>, <string-name><surname>Timilsina</surname> <given-names>GR</given-names></string-name></person-group>. <article-title>Modelling energy demand of developing countries: are the specific features adequately captured?</article-title> <source>Energy Policy</source>. <year>2010</year>;<volume>38</volume>(<issue>4</issue>):<fpage>1979</fpage>&#x2013;<lpage>90</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.enpol.2009.11.079</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>Denton</surname> <given-names>FT</given-names></string-name></person-group>. <article-title>Adjustment of monthly or quarterly series to annual totals: an approach based on quadratic minimization</article-title>. <source>J Am Stat Assoc</source>. <year>1971</year>;<volume>66</volume>(<issue>333</issue>):<fpage>99</fpage>&#x2013;<lpage>102</lpage>. doi:<pub-id pub-id-type="doi">10.1080/01621459.1971.10482227</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dong</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>R</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>C</given-names></string-name>, <string-name><surname>Towey</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>L</given-names></string-name>, <string-name><surname>Tian</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Short-term electricity-load forecasting by deep learning: a comprehensive survey</article-title>. <source>Eng Appl Artif Intell</source>. <year>2025</year>;<volume>154</volume>(<issue>7</issue>):<fpage>110980</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.engappai.2025.110980</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Li</surname> <given-names>R</given-names></string-name></person-group>. <article-title>A novel decomposition and combination technique for forecasting monthly electricity consumption</article-title>. <source>Front Energy Res</source>. <year>2021</year>;<volume>9</volume>:<fpage>792358</fpage>. doi:<pub-id pub-id-type="doi">10.3389/fenrg.2021.792358</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>Acakpovi</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ternor</surname> <given-names>AT</given-names></string-name>, <string-name><surname>Asabere</surname> <given-names>NY</given-names></string-name>, <string-name><surname>Adjei</surname> <given-names>P</given-names></string-name>, <string-name><surname>Iddrisu</surname> <given-names>AS</given-names></string-name></person-group>. <article-title>Time series prediction of electricity demand using adaptive neuro-fuzzy inference systems</article-title>. <source>Math Probl Eng</source>. <year>2020</year>;<volume>2020</volume>(<issue>2</issue>):<fpage>4181045</fpage>. doi:<pub-id pub-id-type="doi">10.1155/2020/4181045</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>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>B</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>H</given-names></string-name>, <string-name><surname>Li</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>C</given-names></string-name></person-group>. <article-title>AnFiS-MoH: systematic exploration of hybrid ANFIS frameworks <italic>via</italic> metaheuristic optimization hybridization with evolutionary and swarm-based algorithms</article-title>. <source>Appl Soft Comput</source>. <year>2024</year>;<volume>167</volume>(<issue>2</issue>):<fpage>112334</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.asoc.2024.112334</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Athanasopoulou</surname> <given-names>ME</given-names></string-name>, <string-name><surname>Deveikyte</surname> <given-names>J</given-names></string-name>, <string-name><surname>Mosca</surname> <given-names>A</given-names></string-name>, <string-name><surname>Peri</surname> <given-names>I</given-names></string-name>, <string-name><surname>Provetti</surname> <given-names>A</given-names></string-name></person-group>. <article-title>A hybrid model for forecasting short-term electricity demand</article-title>. In: <conf-name>Proceedings of the Second ACM International Conference on AI in Finance; 2021 Nov 3&#x2013;5; Virtual</conf-name>. p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3490354.3494371</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>Tang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Nie</surname> <given-names>J</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>X</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>GM(1,1) based improved seasonal index model for monthly electricity consumption forecasting</article-title>. <source>Energy</source>. <year>2022</year>;<volume>252</volume>(<issue>2</issue>):<fpage>124041</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.energy.2022.124041</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>Hao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>X</given-names></string-name></person-group>. <article-title>A hybrid grey system model based on stacked long short-term memory layers and its application in energy consumption forecasting</article-title>. <source>Processes</source>. <year>2024</year>;<volume>12</volume>(<issue>8</issue>):<fpage>1749</fpage>. doi:<pub-id pub-id-type="doi">10.3390/pr12081749</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>Wu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>W</given-names></string-name>, <string-name><surname>He</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Nourmohammadi</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Short-term electricity demand forecasting using a hybrid ANFIS&#x2013;ELM network optimised by an improved parasitism&#x2013;predation algorithm</article-title>. <source>Appl Energy</source>. <year>2023</year>;<volume>345</volume>(<issue>1</issue>):<fpage>121316</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.apenergy.2023.121316</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>Bakare</surname> <given-names>MS</given-names></string-name>, <string-name><surname>Abdulkarim</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shuaibu</surname> <given-names>AN</given-names></string-name>, <string-name><surname>Muhamad</surname> <given-names>MM</given-names></string-name></person-group>. <article-title>A hybrid long-term industrial electrical load forecasting model using optimized ANFIS with gene expression programming</article-title>. <source>Energy Rep</source>. <year>2024</year>;<volume>11</volume>(<issue>1</issue>):<fpage>5831</fpage>&#x2013;<lpage>44</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.egyr.2024.05.045</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>Sax</surname> <given-names>C</given-names></string-name>, <string-name><surname>Steiner</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Temporal disaggregation of time series</article-title>. <source>R J</source>. <year>2013</year>;<volume>5</volume>(<issue>2</issue>):<fpage>80</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.32614/rj-2013-028</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Cleveland</surname> <given-names>R</given-names></string-name></person-group>. <article-title>STL: a seasonal-trend decomposition procedure based on loess</article-title>. <comment>1990 [cited 2026 Apr 7]</comment>. Available from: <ext-link ext-link-type="uri" xlink:href="https://www.semanticscholar.org/paper/STL-%3A-A-Seasonal-Trend-Decomposition-Procedure-on-Cleveland/585bf445ec84c1d9621b2726bdcce9f544b515c8">https://www.semanticscholar.org/paper/STL-%3A-A-Seasonal-Trend-Decomposition-Procedure-on-Cleveland/585bf445ec84c1d9621b2726bdcce9f544b515c8</ext-link>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Deng</surname> <given-names>JL</given-names></string-name></person-group>. <article-title>Control problems of grey systems</article-title>. <source>Syst Control Lett</source>. <year>1982</year>;<volume>1</volume>(<issue>5</issue>):<fpage>288</fpage>&#x2013;<lpage>94</lpage>. doi:<pub-id pub-id-type="doi">10.1016/S0167-6911(82)80025-X</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>Deng</surname> <given-names>JL</given-names></string-name></person-group>. <article-title>Introduction to grey system theory</article-title>. <source>J Grey Syst</source>. <year>1989</year>;<volume>1</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>24</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Li</surname> <given-names>L</given-names></string-name></person-group>. <article-title>An intelligence optimized rolling grey forecasting model fitting to small economic dataset</article-title>. <source>Abstr Appl Anal</source>. <year>2014</year>;<volume>2014</volume>(<issue>4</issue>):<fpage>641514</fpage>. doi:<pub-id pub-id-type="doi">10.1155/2014/641514</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>Jang</surname> <given-names>JSR</given-names></string-name></person-group>. <article-title>ANFIS: adaptive-network-based fuzzy inference system</article-title>. <source>IEEE Trans Syst Man Cybern</source>. <year>1993</year>;<volume>23</volume>(<issue>3</issue>):<fpage>665</fpage>&#x2013;<lpage>85</lpage>. doi:<pub-id pub-id-type="doi">10.1109/21.256541</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>Takagi</surname> <given-names>T</given-names></string-name>, <string-name><surname>Sugeno</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Fuzzy identification of systems and its applications to modeling and control</article-title>. <source>IEEE Trans Syst Man Cybern</source>. <year>1985</year>;<volume>SMC-15</volume>(<issue>1</issue>):<fpage>116</fpage>&#x2013;<lpage>32</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TSMC.1985.6313399</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mirjalili</surname> <given-names>S</given-names></string-name>, <string-name><surname>Mirjalili</surname> <given-names>SM</given-names></string-name>, <string-name><surname>Lewis</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Grey wolf optimizer</article-title>. <source>Adv Eng Softw</source>. <year>2014</year>;<volume>69</volume>:<fpage>46</fpage>&#x2013;<lpage>61</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.advengsoft.2013.12.007</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Vietnam Country Profile</collab></person-group>. <article-title>Energy. Our world in data</article-title>. <comment>[cited 2026 Apr 3]</comment>. Available from: <ext-link ext-link-type="uri" xlink:href="https://ourworldindata.org/profile/energy/vietnam">https://ourworldindata.org/profile/energy/vietnam</ext-link>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Ministry of Industry and Trade of Vietnam (MOIT)</collab></person-group>. <article-title>Report on power production and business activities</article-title>. <year>2024 [cited 2026 Jan 1]</year>. Available from: <ext-link ext-link-type="uri" xlink:href="https://moit.gov.vn/thong-ke/bao-cao-tong-hop">https://moit.gov.vn/thong-ke/bao-cao-tong-hop</ext-link>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>General Statistics Office of Vietnam</collab></person-group>. <article-title>Statistical data: index of industrial production (IIP)</article-title>. <comment>2024 [cited 2026 Jan 1]</comment>. Available from: <ext-link ext-link-type="uri" xlink:href="https://www.nso.gov.vn/so-lieu-thong-ke/">https://www.nso.gov.vn/so-lieu-thong-ke/</ext-link>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Ministry of Planning and Investment (MPI)</collab></person-group>. <article-title>Situation of foreign direct investment (FDI) in Vietnam</article-title>. <comment>2024 [cited 2026 Jan 1]</comment>. Available from: <ext-link ext-link-type="uri" xlink:href="https://www.mpi.gov.vn/portal/Pages/solieudautunuocngoai.aspx">https://www.mpi.gov.vn/portal/Pages/solieudautunuocngoai.aspx</ext-link>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Box</surname> <given-names>GEP</given-names></string-name>, <string-name><surname>Jenkins</surname> <given-names>GM</given-names></string-name>, <string-name><surname>Reinsel</surname> <given-names>GC</given-names></string-name>, <string-name><surname>Ljung</surname> <given-names>GM</given-names></string-name></person-group>. <source>Time series analysis: forecasting and control</source>. <edition>5th</edition> ed. <publisher-loc>Hoboken, NJ, USA</publisher-loc>: <publisher-name>John Wiley &#x0026; Sons, Inc</publisher-name>; <year>2016</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Akaike</surname> <given-names>H</given-names></string-name></person-group>. <article-title>A new look at the statistical model identification</article-title>. <source>IEEE Trans Autom Control</source>. <year>1974</year>;<volume>19</volume>(<issue>6</issue>):<fpage>716</fpage>&#x2013;<lpage>23</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TAC.1974.1100705</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hochreiter</surname> <given-names>S</given-names></string-name>, <string-name><surname>Schmidhuber</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Long short-term memory</article-title>. <source>Neural Comput</source>. <year>1997</year>;<volume>9</volume>(<issue>8</issue>):<fpage>1735</fpage>&#x2013;<lpage>80</lpage>. doi:<pub-id pub-id-type="doi">10.1162/neco.1997.9.8.1735</pub-id>; <pub-id pub-id-type="pmid">9377276</pub-id></mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Schuster</surname> <given-names>M</given-names></string-name>, <string-name><surname>Paliwal</surname> <given-names>KK</given-names></string-name></person-group>. <article-title>Bidirectional recurrent neural networks</article-title>. <source>IEEE Trans Signal Process</source>. <year>1997</year>;<volume>45</volume>(<issue>11</issue>):<fpage>2673</fpage>&#x2013;<lpage>81</lpage>. doi:<pub-id pub-id-type="doi">10.1109/78.650093</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>T</given-names></string-name>, <string-name><surname>Guestrin</surname> <given-names>C</given-names></string-name></person-group>. <article-title>XGBoost: a scalable tree boosting system</article-title>. In: <conf-name>Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2016 Aug 13&#x2013;17</conf-name>; <publisher-loc>San Francisco, CA, USA</publisher-loc>. p. <fpage>785</fpage>&#x2013;<lpage>94</lpage>. doi:<pub-id pub-id-type="doi">10.1145/2939672.2939785</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dickey</surname> <given-names>DA</given-names></string-name>, <string-name><surname>Fuller</surname> <given-names>WA</given-names></string-name></person-group>. <article-title>Distribution of the estimators for autoregressive time series with a unit root</article-title>. <source>J Am Stat Assoc</source>. <year>1979</year>;<volume>74</volume>(<issue>366</issue>):<fpage>427</fpage>. doi:<pub-id pub-id-type="doi">10.2307/2286348</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Said</surname> <given-names>SE</given-names></string-name>, <string-name><surname>Dickey</surname> <given-names>DA</given-names></string-name></person-group>. <article-title>Testing for unit roots in autoregressive-moving average models of unknown order</article-title>. <source>Biometrika</source>. <year>1984</year>;<volume>71</volume>(<issue>3</issue>):<fpage>599</fpage>&#x2013;<lpage>607</lpage>. doi:<pub-id pub-id-type="doi">10.1093/biomet/71.3.599</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kwiatkowski</surname> <given-names>D</given-names></string-name>, <string-name><surname>Phillips</surname> <given-names>PCB</given-names></string-name>, <string-name><surname>Schmidt</surname> <given-names>P</given-names></string-name>, <string-name><surname>Shin</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Testing the null hypothesis of stationarity against the alternative of a unit root How sure are we that economic time series have a unit root?</article-title> <source>J Econ</source>. <year>1992</year>;<volume>54</volume>(<issue>1&#x2013;3</issue>):<fpage>159</fpage>&#x2013;<lpage>78</lpage>. doi:<pub-id pub-id-type="doi">10.1016/0304-4076(92)90104-Y</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hyndman</surname> <given-names>RJ</given-names></string-name>, <string-name><surname>Koehler</surname> <given-names>AB</given-names></string-name></person-group>. <article-title>Another look at measures of forecast accuracy</article-title>. <source>Int J Forecast</source>. <year>2006</year>;<volume>22</volume>(<issue>4</issue>):<fpage>679</fpage>&#x2013;<lpage>88</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ijforecast.2006.03.001</pub-id>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chicco</surname> <given-names>D</given-names></string-name>, <string-name><surname>Warrens</surname> <given-names>MJ</given-names></string-name>, <string-name><surname>Jurman</surname> <given-names>G</given-names></string-name></person-group>. <article-title>The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation</article-title>. <source>PeerJ Comput Sci</source>. <year>2021</year>;<volume>7</volume>(<issue>3</issue>):<fpage>e623</fpage>. doi:<pub-id pub-id-type="doi">10.7717/peerj-cs.623</pub-id>; <pub-id pub-id-type="pmid">34307865</pub-id></mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Diebold</surname> <given-names>FX</given-names></string-name>, <string-name><surname>Mariano</surname> <given-names>RS</given-names></string-name></person-group>. <article-title>Comparing predictive accuracy</article-title>. <source>J Bus Econ Stat</source>. <year>1995</year>;<volume>13</volume>(<issue>3</issue>):<fpage>253</fpage>&#x2013;<lpage>63</lpage>. doi:<pub-id pub-id-type="doi">10.1198/073500102753410444</pub-id>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Harvey</surname> <given-names>D</given-names></string-name>, <string-name><surname>Leybourne</surname> <given-names>S</given-names></string-name>, <string-name><surname>Newbold</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Testing the equality of prediction mean squared errors</article-title>. <source>Int J Forecast</source>. <year>1997</year>;<volume>13</volume>(<issue>2</issue>):<fpage>281</fpage>&#x2013;<lpage>91</lpage>. doi:<pub-id pub-id-type="doi">10.1016/S0169-2070(96)00719-4</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>