Abstract
Accurate short-term load forecasting is essential for modern power distribution, yet selecting optimal predictive architectures across diverse feeder profiles remains a key challenge for local grid operators. This paper presents a multi-feeder comparative evaluation of machine learning architectures using hourly load data (January 2024–April 2026) from six distribution feeders within two operational zones under the Bangladesh Rural Electrification Board. The evaluated models include statistical baselines (ARIMA, SARIMA), linear regression, tree ensembles (Random Forest, XGBoost, LightGBM), and recurrent architectures (LSTM, GRU). Feature engineering includes cyclical temporal encodings, weather parameters, and temporal lags. Experimental results demonstrate that tree-based ensembles consistently outperform both statistical baselines and recurrent neural networks across all feeders. Random Forest achieved the highest performance, with a Mean MAPE of 2.35%, and individual feeder errors reaching as low as 0.83% MAPE and 0.02 MW MAE. Meanwhile, LightGBM demonstrated superior operational deployment efficiency, delivering a highly comparable Mean MAPE of 2.56% with the lowest inference time of 0.55 s, and a minimal memory footprint of 1.2 MB. These findings highlight that feature-engineered tree ensembles provide an optimal balance of predictive performance, scalability, and computational efficiency for real-time distribution grid operations across neighboring utility zones.
1. Introduction
Load forecasting for electrical distribution substations is a foundational requirement for modern grid management. Precise short-term predictions allow utility providers to optimize power dispatch, prevent localized transformer overloads, and maintain regional grid stability [1]. Accurate short-term load forecasting (STLF) is especially vital when navigating unpredictable demand profiles in industrial-heavy feeders and supporting renewable energy integration [2].
To establish the operational scope of predictive modeling, load forecasting frameworks are traditionally categorized into four temporal horizons based on their engineering application [3]: Very Short-Term Load Forecasting (VSTLF) (minutes up to a day) for real-time market clearing and automatic generation control; Short-Term Load Forecasting (STLF) (24 h to 168 h) for day-ahead unit commitment, peak demand mitigation, and security analysis; Medium-Term Load Forecasting (MTLF) (one week to several months) for fuel procurement and maintenance scheduling; and Long-Term Load Forecasting (LTLF)(years to decades) for capital infrastructure investments.
In Bangladesh, distribution utilities face distinct operational constraints shaped by rapid industrial growth, urban expansion, and legacy data collection infrastructures [4].
The existing power forecasting literature in Bangladesh heavily focuses on aggregated, national-level grid predictions [5,6]. However, national models naturally smooth out localized volatility. Substation- and feeder-level forecasting requires a far more granular approach capable of capturing micro-climate variations and feeder-specific consumer behaviors that national-scale models are structurally unable to resolve.
Beyond Bangladesh, while feeder- and substation-level STLF has been explored globally using various machine learning algorithms [7,8,9], existing benchmarking studies suffer from two key limitations. First, most studies evaluate predictive models on isolated, single-feeder datasets, failing to assess cross-zonal generalizability across heterogeneous consumer profiles (e.g., highly volatile industrial feeders versus cyclical residential feeders). Second, conventional STLF research focuses almost exclusively on offline predictive error metrics (such as MAPE or RMSE) while completely neglecting edge-deployment hardware constraints—such as model memory footprints, training duration, and per-window inference latency. In resource-constrained distribution grids managed by rural electric cooperatives, selecting an optimal model requires evaluating the explicit trade-offs between predictive accuracy and real-time computational overhead.
To bridge these gaps, this paper presents a comprehensive multi-feeder benchmarking study utilizing high-resolution hourly load data collected directly from power loggers installed across six distribution feeders operating under the Bangladesh Rural Electrification Board (BREB). BREB distributes electricity through rural electric cooperatives called Palli Bidyut Samities (PBSs). We evaluate hourly data spanning from 1 January 2024 to 30 April 2026 across two major operating zones: Gazipur PBS-1 (Joydebpur-7 F5, Gacha-1 F4, Gacha-1 F3) and Mymensingh PBS-2 (Sreepur-1 F5, Sreepur-7 F1, Sreepur-8 F2).
Using a unified 43-feature matrix incorporating historical load lags, cyclical temporal encodings, and localized meteorological parameters (temperature, humidity, wind speed) extracted from the Open-Meteo API [10], we systematically evaluate eight forecasting models across a multi-window recursive 168 h (7-day) rolling horizon. The evaluated architectures span classical statistical baselines (ARIMA, SARIMA, linear regression), tree-based ensembles (Random Forest [11], XGBoost [12], LightGBM [13]), and recurrent deep neural networks (LSTM [14], GRU [15]).
This study makes four primary contributions:
- Cross-Zonal Multi-Feeder Benchmark: Establishing a realistic performance evaluation across six distribution feeders exhibiting starkly contrasting industrial and residential load profiles across two distinct utility zones (Gazipur PBS-1 and Mymensingh PBS-2).
- Unified Multi-Model Benchmarking: Rigorously comparing statistical baselines, gradient-boosted ensembles, and recurrent deep learning structures under an identical 168 h recursive rolling forecast horizon and identical 43-feature input representations.
- Domain-Specific Feature Integration: Quantifying the impact of localized meteorological dependencies (temperature, relative humidity, wind speed) and cyclical time encodings on capturing volatile feeder-level dynamics.
- Operational Deployment and Efficiency Analysis: Evaluating model viability beyond accuracy by measuring exact memory footprints, training execution times, and per-window batch inference latencies to determine optimal candidates for real-time edge integration into utility monitoring systems.
2. Related Work
Short-term load forecasting (STLF) at the distribution substation and feeder levels has evolved significantly from classical parametric formulations to non-linear data-driven architectures [2,7]. This section critically reviews the progression of STLF methodologies and synthesizes the existing literature regarding multi-feeder load dynamics, computational execution constraints, and cross-zonal generalizability.
2.1. Evolution of STLF Methodologies
Early STLF frameworks predominantly relied on linear regression and classical statistical formulations due to their analytical tractability [2]. While traditional parametric models effectively capture smooth periodic seasonal trends in aggregated grid demand, their linear structural assumptions limit performance when applied to lower-level distribution feeders characterized by high volatility, non-linear meteorology–demand interactions, and exogenous disruptions [7].
To overcome these non-linear constraints, machine learning (ML) algorithms gained prominence. Tree-based ensemble methods, such as Random Forest (RF) [11,16], non-parametrically map non-linear feature interactions. Subsequent advances in gradient-boosted decision trees (GBDTs)—specifically Extreme Gradient Boosting (XGBoost) [12] and Light Gradient Boosting Machine (LightGBM) [13]—demonstrated superior predictive performance on tabular grid telemetry [17]. LightGBM, in particular, utilizes leaf-wise tree growth and histogram-based feature binning, drastically reducing memory footprint and training overhead while maintaining robust performance across multi-step forecast horizons.
Concurrently, deep learning (DL) architectures have been extensively explored for sequence modeling. Recurrent neural network (RNN) variants, such as Long Short-Term Memory (LSTM) [6,14,18,19] and Gated Recurrent Units (GRU) [15,20], excel at capturing temporal dependencies without manual feature engineering. Hybrid structures combining convolutional feature extractors or attention mechanisms with recurrent layers have further enhanced predictive accuracy [5,8,21]. However, deep architectures introduce higher parameter counts and significant computational complexity during training and deployment.
2.2. Cross-Zonal Feeder Dynamics and Computational Overhead Gaps
Despite the extensive literature comparing algorithmic variations, existing STLF studies exhibit two major critical limitations:
First, the vast majority of STLF research evaluates model efficacy solely through offline predictive error metrics, such as RMSE, MAPE, and MAE [3,9]. Complex deep learning structures and large ensemble models are frequently declared optimal based on marginal reductions in error, without profiling operational execution overhead. In practical energy management systems (EMSs) and distribution management systems (DMSs), particularly at resource-constrained rural substations [4], hardware capabilities are strictly limited. Crucial operational parameters—such as disk storage footprint, offline retrain duration, and online batch inference latency per forecast window—are rarely benchmarked under unified, standardized hardware conditions.
Second, the existing literature heavily focuses on high-level transmission grid demand [1], aggregated macro-regions [22], and single-substation transformer datasets [23]. Distribution networks in developing power grids consist of highly heterogeneous feeder lines (e.g., dedicated industrial, mixed commercial–residential, or heavy agricultural zones) subject to severe ambient weather variations and operational disruptions. A forecasting model tuned for an aggregated region or single transformer often fails when deployed across adjacent, distinct feeder topographies. A comprehensive, standardized multi-model benchmarking framework evaluated across multi-feeder cross-zonal distribution topologies remains absent.
Beyond standalone predictive performance, high-precision feeder-level load forecasting serves as a critical foundational layer for downstream operational control, including dynamic demand-side management, optimal load dispatch, and smart microgrid scheduling [24].
To highlight these research gaps, Table 1 systematically compares representative STLF studies against the proposed benchmarking framework.
Table 1.
Systematic comparison of representative short-term load forecasting studies against the proposed benchmarking framework.
3. Methodology
The overall end-to-end forecasting pipeline, spanning data ingestion through model deployment, is illustrated in Figure 1, while the long-term historical hourly load distributions and average 24 h diurnal consumption patterns across all six feeders are presented in Figure 2 and Figure 3, respectively.
Figure 1.
Systematic workflow of the multi-feeder load forecasting framework: from raw feeder and weather acquisition (via substation power loggers), through 43-feature engineering, to individual model training, testing, and deployment.
Figure 2.
Historical hourly load curves decomposed across individual distribution feeders in a grid panel, illustrating baseline load disparities, seasonal peak oscillations, and feeder-specific outages over the study period. Feeder subplots are color-coded for visual distinction.
Figure 3.
Average 24 h diurnal load profiles across individual distribution feeders, highlighting distinct temporal consumption patterns and consumer heterogeneity across the distribution network.
3.1. Data Collection and Preprocessing
The load data is collected from the substation power loggers introduced in Section 1, one per feeder, across all six distribution feeders (Sreepur-1 F5, Sreepur-7 F1, Sreepur-8 F2, Joydebpur-7 F5, Gacha-1 F4, and Gacha-1 F3), spanning from 1 January 2024 to 30 April 2026.
Mathematical Scaling and Power Derivation: Each power logger records secondary-side electrical parameters (i.e., the low-voltage, low-current signals output by the substation’s instrument transformers) at high-frequency 5 min sampling intervals. To reconstruct true primary-side active power demand ( in MW) from secondary-side readings ( in W), Potential Transformer () and Current Transformer () scaling multipliers were applied across all three phases, as follows:
For instance, given secondary parameters , , and , the secondary active power scales with transformation ratios and to yield per phase, yielding a total three-phase primary load .
Data Quality Enhancement and Temporal Aggregation: Raw hardware logs exhibited operational anomalies due to instrument calibration drifts, telemetry dropouts, and line faults. Data preprocessing followed a rigorous cleaning workflow:
- Anomaly Removal: Unphysical negative power readings resulting from reverse-current sensor artifacts were removed and flagged as missing values.
- Outlier Filtering: Extreme value spikes exceeding physical feeder thermal limits were identified and removed using rolling z-score statistical thresholding ().
- Imputation Strategy: Short contiguous missing values (≤3 consecutive hours) were imputed using linear interpolation, while larger structural gaps were resolved using same-hour profile mapping from identical days of preceding weeks.
- Resampling: The cleaned 5 min active power time-series was temporally averaged to an hourly frequency profile to match the target operational horizon for short-term load forecasting (STLF).
Across the entire dataset, negative values, outliers and missing observations accounted for under 1.2% of total records, as shown in Table 2. To evaluate the statistical behavior and dynamic properties of the multi-feeder load data, we conducted descriptive statistical profiling and stationarity analysis across all six distribution channels. Stationarity was evaluated using the Augmented Dickey–Fuller (ADF) test.
Table 2.
Raw data collection, cleaning statistics (), effective hours, and per-feeder missing ratios across the six BREB distribution feeders.
3.2. Feature Engineering
To capture the key drivers of electrical demand, we constructed 43 features of four main categories, as summarized in Table 3. Here, autoregressive lags capture historical load patterns and daily cycles; weather variables account for temperature and humidity changes; cyclical features maintain smooth transitions across hours and days; and event flags account for weekends, holidays, and peak hours in which load changes. The empirical justification for these feature selections, including temporal lag structure and weather variable correlation analyses, is detailed in Section 4.2.
Table 3.
Summary of engineered features.
During the 168 h rolling forecasting evaluation, weather variables (temperature, relative humidity, and wind speed) are generated without look-ahead bias by employing a 168 h historical persistence proxy. For each step within the horizon, weather values are derived from observations exactly 168 h prior (). This ensures future weather ground truth is strictly excluded, preventing look-ahead bias.
3.3. Data Partitioning
To eliminate look-ahead bias and data leakage, all dataset boundaries were split chronologically using an 80/20 ratio, spanning the total study period from 1 January 2024 to 30 April 2026 (20,424 h). Specifically, the initial 80% (covering 1 January 2024 to 12 November 2025) was reserved for model training, and the final unseen 20% (covering 13 November 2025 to 30 April 2026) was held out as an unseen test set for multi-step recursive evaluation across 1 to 168 h look-ahead horizons. For the deep learning models, LSTM and GRU, we created a validation set from 10% of the training set to prevent overfitting by using early stopping. So, for the LSTM and GRU models, the data partition is 72% training, 8% validation, and 20% testing.
3.4. Model Training and Evaluation Framework
We benchmarked eight predictive models across four architectural paradigms: classical statistical baselines, linear regression, gradient-boosted/bagged tree ensembles, and recurrent deep neural networks.
3.4.1. Phase I: Statistical Baselines and Linear Regression
Classical statistical baselines (ARIMA, SARIMA, and linear regression) were configured via the statsmodels framework with rigorous, empirically justified specifications. For ARIMA, parameters were tuned per feeder using Akaike Information Criterion (AIC) minimization over a localized 672 h validation sample (corresponding to the final 4 weeks of the training split), with the differencing order d set from ADF tests ( for Sreepur-8 F2; elsewhere). This yielded tailored specifications: for Sreepur-1 F5 and Gacha-1 F4; for Sreepur-7 F1; for Sreepur-8 F2; and for Joydebpur-7 F5 and Gacha-1 F3.
For SARIMA, unconstrained grid searches were avoided due to the computational cost of fitting seasonal models across multiple distribution feeders. Instead, configurations were evaluated over a targeted candidate set of the following four parsimonious structures:
- (1)
- (Fast pure AR daily model);
- (2)
- (Extended AR model);
- (3)
- (Mixed non-seasonal ARMA model);
- (4)
- (Seasonal moving-average model).
All candidates incorporated with first-order seasonal differencing (). AIC selection on the validation sample consistently identified as the optimal model across all channels. Additionally, linear regression was evaluated using the full 43-variable feature matrix to establish a benchmark on the linear regression model.
3.4.2. Phase II: Tree-Based Ensemble Models
To model non-linear interactions and high-dimensional feature dependencies, three tree ensemble architectures were trained:
- Random Forest: A bagging ensemble constructed with 300 decision trees (maximum depth of 15), in line with empirical findings in STLF [16], as setting the estimator count to 300 stabilizes prediction variance while mitigating overfitting.
- LightGBM: A gradient-boosted decision tree model trained using Mean Squared Error (MSE) loss with 500 estimators, a learning rate of 0.03, and leaf-wise tree growth (num_leaves = 31) for optimal execution speed.
- XGBoost: A gradient-boosted decision tree model trained using MSE loss with 500 estimators, a learning rate of 0.03, a maximum tree depth of 6, and a histogram-based split method (tree_method = ‘hist’).
3.4.3. Phase III: Recurrent Deep Learning Networks
Recurrent neural networks (LSTM and GRU) were constructed to process 3D sequential feature tensors across a 24 h historical look-back window () with 43 input features. Both networks share a stacked two-layer architecture (64 and 32 hidden units) followed by a 16-unit dense layer (ReLU activation), utilizing a dropout rate after each recurrent layer to mitigate overfitting. Feature data and target variables were normalized using MinMaxScaler (). Model optimization was conducted using the Adam optimizer () with Mean Squared Error (MSE) loss. Training was executed with a batch size of 32 for up to 50 epochs, incorporating an early stopping callback (patience = 7 epochs) based on 10% held-out validation loss to prevent overtraining and restore optimal model weights.
3.4.4. Computational Environment and Experimental Setup
All the training and experiments were executed within a standardized cloud-based Google Colab Linux environment.
The hardware and software specifications utilized for all benchmarking measurements are detailed as follows:
- Hardware Configuration: Operating within Google Colab’s standard cloud compute tier, the execution backend featured 2 logical vCPUs (1 socket, 1 core per socket, and 2 threads per core, with NUMA node 0 bound to CPUs ) and of total system RAM.
- Operating System: Google Colab backend Linux kernel version 6.6.122+-x86_64 with GNU C Library (glibc) version 2.39.
- Software and Library Ecosystem: Built on Python version 3.13.16, incorporating key scientific and machine learning frameworks: statsmodels (0.15.0) for statistical baselines, Scikit-Learn (1.6.1) for regression benchmarks, XGBoost (3.4.1) and LightGBM (4.6.0) for gradient-boosted models, and TensorFlow (2.21.0) for deep learning architectures.
To rigorously evaluate model generalizability and identify the most suitable architecture for deployment in resource-constrained distribution substations (such as BREB), the evaluation followed a structured four-stage experimental protocol across the unseen 20% test split (spanning 13 November 2025 to 30 April 2026 across all six BREB feeders):
- Initial 1-Step-Ahead Screening: All eight candidate models were initially screened across 1-step-ahead test forecasts to filter out underperforming architectures.
- Multi-Step Recursive Evaluation: The top-performing architectures were advanced to a 168 h (7-day) recursive rolling multi-step forecasting evaluation across 24 forecast windows (comprising 4032 total forecast instances per model) on test data to simulate real-world operational lead times and quantify autoregressive error accumulation over extended horizons.
- Comparative Statistical Validation: The surviving models were subjected to rigorous comparative performance metrics (MAE, RMSE, MAPE, ) alongside Diebold–Mariano (DM) and Wilcoxon signed-rank significance tests to evaluate predictive superiority over the naive lag-168 h persistence model.
- Deployment Feasibility Selection: The final model selection balances predictive accuracy with computational efficiency.
4. Results
4.1. Feeder-Wise Statistical and Stationarity Profiling
As summarized in Table 4, each feeder records 20,424 hourly observations spanning from 1 January 2024 to 30 April 2026. Demand magnitude and volatility vary significantly across the six distribution channels. Mean load ranges from (Gacha-1 F4) to (Joydebpur-7 F5), with standard deviations highlighting high dynamic dispersion on Joydebpur-7 F5 () and Sreepur-1 F5 (). Base loads range between and , while peak demand reaches on Joydebpur-7 F5, underscoring capacity scale differences across rural and industrial circuits.
Table 4.
Statistical properties across the six BREB distribution feeders.
Distributional metrics indicate predominantly left-skewed load profiles (skewness from to ) due to sustained commercial operation, except for Sreepur-7 F1 (). The negative kurtosis across most channels reflects platykurtic distributions shaped by structured diurnal switching rather than extreme random spikes.
Augmented Dickey–Fuller (ADF) tests confirm that the five feeders strictly reject the unit-root null hypothesis (), establishing statistical stationarity. Sreepur-8 F2 exhibits weak non-stationarity (), indicating localized trend dynamics that justify first-order differencing () for classical baseline models on this channel.
4.2. Feature Correlation Analysis
To empirically validate the drivers of electrical demand across the distribution grid, we examined the effects of lag features using ACF, weather variables (temperature, humidity, and wind) and their correlation with load, alongside calendar dynamics.
Autocorrelation Function (ACF) analysis (Figure 4) shows that pronounced peaks occur at 24 h intervals (), confirming strong daily seasonality across all feeder profiles. These findings validate our construction of the 31-variable autoregressive feature block, comprising the first 25 consecutive hourly lags ( to ) alongside weekly seasonal lags (, , , , , and ).
Figure 4.
Autocorrelation Function (ACF) up to 168 h (7-day) lags across individual distribution feeders. Vertical dashed red lines highlight strong 24 h diurnal and weekly periodicity across all feeder channels.
Temperature displays a positive overall correlation () with electrical demand due to increased cooling loads during high-temperature intervals (Figure 5). Thermal sensitivity varies across individual channels: Gacha-1 F4 (), Joydebpur-7 F5 (), and Sreepur-1 F5 () exhibit pronounced temperature dependencies, whereas Sreepur-8 F2 displays more moderate sensitivity (). These quantitative findings justify the inclusion of raw ambient temperature and the non-linear squared term () in our feature space.
Figure 5.
Multi-feeder correlation analysis between hourly ambient temperature and demand. Fitted linear regression trends illustrate distinct temperature sensitivities across individual feeders (overall ).
As illustrated in Figure 6, relative humidity exhibits an overall negative correlation with aggregate demand (), which is particularly strong on Sreepur-1 F5 () and Joydebpur-7 F5 (). Peak humidity thresholds (95–100%) heavily coincide with monsoon precipitation and cloud cover, suppressing cooling load demand.
Figure 6.
Multi-feeder correlation analysis between relative humidity and demand, showing localized negative correlation trends across distribution feeders ().
Conversely, local wind speed (Figure 7) shows a weak overall positive correlation (), ranging from on Gacha-1 F4 to on Sreepur-8 F2, driven by a diurnal increase in wind speed coinciding with afternoon industrial load ramps.
Figure 7.
Multi-feeder correlation analysis between local wind speed and electrical demand, illustrating weak positive correlation trends ().
Electricity consumption shifts during non-working days and major cultural events, as illustrated in (Figure 8), validating the integration of binary indicator variables for weekends, daily operating windows, and holidays like Eid.
Figure 8.
Comparative analysis of hourly demand profiles across six individual distribution feeders, illustrating distinct consumption patterns for normal weekdays, weekends, and national holidays.
4.3. 1-Step-Ahead Forecasting Performance
As summarized in Table 5 and Table 6, tree-based ensemble architectures consistently demonstrated superior predictive performance across all six feeders, with Random Forest achieving the lowest overall Mean MAPE of 2.35%, closely followed by XGBoost (2.52% Mean MAPE) and LightGBM (2.56% Mean MAPE).
Table 5.
Feeder-wise error evaluation (MAE, RMSE) across 1-step-ahead forecasting models. Feeders are labeled as Substation Name + Feeder Code (e.g., “Sreepur-1 F5” = Feeder 5 at the Sreepur-1 substation). MAE: Mean Absolute Error (MW); RMSE: Root Mean Squared Error (MW).
Table 6.
Feeder-wise evaluation: MAPE (Mean Absolute Percentage Error) and score (Coefficient of Determination) calculated on test data across 1-step-ahead forecasting models.
In terms of absolute errors (Table 5), Random Forest attained the minimum MAE across five out of six feeders, reaching a peak precision of 0.02 MW MAE (0.0460 MW RMSE) on Sreepur-8 F2 and 0.06 MW MAE (0.0922 MW RMSE) on Sreepur-1 F5. XGBoost and LightGBM exhibited closely competitive RMSE bounds, with XGBoost recording the lowest RMSE on Joydebpur-7 F5 (0.1477 MW) and Gacha-1 F4 (0.0454 MW), while LightGBM led on Sreepur-7 F1 (0.1030 MW) and Gacha-1 F3 (0.1343 MW).
Goodness-of-fit evaluations on test data (Table 6) further reinforce the robustness of the ensemble models, all maintaining scores exceeding 0.976 across all feeders and reaching up to 0.9940 (Random Forest on Sreepur-1 F5). The deep learning architectures (GRU and LSTM) formed the next best performing class, achieving Mean MAPEs of 3.43% () and 4.19% (), respectively, outperforming linear regression (5.41% Mean MAPE). The statistical baselines struggled on dynamic load profiles, with SARIMA achieving a 6.79% Mean MAPE, whereas standard ARIMA exhibited significant residual tracking errors, yielding negative test values on Sreepur-7 F1 (−1.4604) and Gacha-1 F3 (−1.3978) due to severe uncaptured non-stationarity. Visual inspection of the 14-day forecast horizon (Figure 9) confirms that tree ensembles closely track ground-truth load profiles across both peak industrial hours and non-working demand dips.
Figure 9.
Comparative evaluation of 1-step-ahead hourly load forecasting models evaluated across a 14-day test window (336 consecutive hours) for six primary distribution feeders. Ground-truth actual load demand is highlighted in bold and slated against machine learning and statistical model predictions.
4.4. Multi-Step Rolling Horizon Forecasting and Statistical Validation
When evaluating long-term multi-step performance over the 168 h recursive rolling horizon across 24 evaluation windows in the full test set (Table 7 and Table 8), a clear operational divergence emerges. While deep learning sequence models (LSTM and GRU) performed competitively in static single-step tests, they exhibited severe autoregressive error propagation over the continuous forecast window, resulting in average MAPEs exceeding 17% (specifically reaching 17.29% for LSTM and 19.67% for GRU) and negative scores on volatile feeders, such as for LSTM on Sreepur-7 F1 and for GRU on Gacha-1 F3.
Table 7.
Feeder-wise 168-hour rolling forecast performance matrix (MAE and RMSE) across machine learning models. Feeders are labeled as Substation Name + Feeder Code (e.g., “Sreepur-1 F5” = Feeder 5 at the Sreepur-1 substation). MAE: Mean Absolute Error (MW); RMSE: Root Mean Squared Error (MW).
Table 8.
Feeder-wise 168-hour rolling forecast performance matrix (MAPE and ) across machine learning models. Feeders are labeled as Substation Name + Feeder Code (e.g., “Sreepur-1 F5” = Feeder 5 at the Sreepur-1 substation). MAPE: Mean Absolute Percentage Error (%); : Coefficient of Determination.
Consequently, only the persistence baseline model and the tree-based ensemble models (LightGBM, Random Forest, and XGBoost) demonstrated robust, non-divergent forecasting trajectories across the entire 168 h rolling evaluation, with Random Forest recording the lowest overall average MAPE of 3.19% (and overall average MAE of 0.0926 MW and RMSE of 0.1805 MW, as detailed in Table 7 and Table 8), closely followed by XGBoost at 3.44% MAPE and LightGBM at 3.47% MAPE. For this reason, formal statistical significance testing—comprising pair-wise Diebold–Mariano (DM) tests and Wilcoxon signed-rank tests ()—was conducted exclusively among the tree ensembles and the naive persistence baseline (Table 9).
Table 9.
Statistical significance tests across the test set (24 rolling windows with 168 h horizon, each model having 4032 data points).
The statistical tests confirmed that all three tree models significantly outperformed the persistence benchmark (). However, the pair-wise DM test revealed no statistically significant performance difference between the tree architectures themselves (LightGBM vs. Random Forest: ; LightGBM vs. XGBoost: ). Because LightGBM achieves statistically equivalent performance while drastically reducing 168 h horizon inference latency to just 0.55 s per window—compared to 1.37 s for XGBoost and 15.15 s for Random Forest—and maintaining a minimal model size of 1.2 MB (a 100-fold reduction from Random Forest’s 120 MB and smaller than XGBoost’s 1.5 MB), alongside a highly efficient training time of 3.47 s (Table 10), it avoids memory bandwidth bottlenecks and represents the optimal candidate for resource-constrained edge deployment in BREB distribution substations.
Table 10.
Computational efficiency and deployment metrics across top 5 forecasting models. Inference time measured on 168 h rolling forecast.
4.5. Predictive Uncertainty and Risk Analysis
To quantify forecast risk across multi-step horizon rollouts, empirical prediction intervals were evaluated using non-overlapping 24 h evaluation windows extracted from the test set across all six distribution feeders. For each discrete horizon step , the relative uncertainty margin () under a statistical confidence level (, ) is computed as
where represents the sample standard deviation () of model forecast residuals across N test windows, and denotes the mean observed feeder load at step h. Here, serves as a normalized parametric proxy for relative error dispersion across evaluation windows under asymptotic Gaussian assumptions.
The uncertainty analysis demonstrates that tree-based models, particularly LightGBM, achieve superior variance bounds compared to deep learning architectures—a finding that aligns with recent probabilistic forecasting where LGBM-Q performed better than DeepAR and MQRNN [26].
As illustrated in Figure 10, predictive uncertainty exhibits severe heteroscedasticity linked to diurnal grid dynamics over the 24 h look-ahead horizon starting at 04:00:
Figure 10.
Statistical prediction interval margins (±%) across the 24 h look-ahead horizon starting at the test forecast origin (04:00). Computed at a confidence level (). Note: ARIMA is omitted due to relative uncertainty margins exceeding .
- Early Morning Base (Step 1–4/04:00–07:00): Forecast risk remains tightly constrained during low-demand off-peak hours. Tree ensembles (LightGBM, XGBoost, Random Forest) deliver the narrowest uncertainty bands, ranging from to . Linear regression establishes a near-constant baseline around –.
- Diurnal Ramp-Up Surge (Step 5–6/08:00–09:00): Rapid industrial shift initiations and load ramping trigger a sharp expansion in residual variance. LSTM and GRU experience an immediate spike at Step 5 (08:00), expanding to relative uncertainty margins of and , respectively. SARIMA reaches its overall maximum uncertainty of at Step 6 (09:00). Tree ensembles display strong robustness during this transition, bounding uncertainty to –.
- Midday Industrial Operating Plateau (Step 7–10/10:00–13:00): LSTM retains an elevated risk profile fluctuating between and , whereas tree-based ensembles rapidly cool down to a stable – interval.
- Overnight Convergence (Step 20–24/23:00–03:00): As grid operational variance drops overnight, all machine learning architectures converge toward minimal uncertainty. Tree ensembles hit their global minimum at Step 20 (23:00), shrinking to –. GRU and LSTM decay to and by Step 24 (03:00), while non-seasonal ARIMA is excluded from the analysis as its relative uncertainty exceeds .
5. Discussion
The benchmarking results highlight a clear trade-off between predictive accuracy and computational footprint across model families. While non-linear tree-based ensembles consistently dominated the top performance tier, their operational deployment characteristics vary significantly:
- MAE/MAPE Precision vs. Memory Footprint: Random Forest achieved the lowest overall average error ( Mean MAPE; MAE on Sreepur-1 F5) and the lowest single-feeder MAPE ( with MAE on Sreepur-8 F2). However, this marginal gain over gradient boosting frameworks comes at the cost of a massive model file size () and a high inference latency of 15.15 s, as shown in Table 10.
- Optimal Production Selection: LightGBM established the most favorable operational profile, achieving a highly competitive Mean MAPE while executing in just with a lightweight footprint, making it the ideal candidate for real-time edge integration in automated feeder load management. These findings align directly with recent empirical benchmarks on real-world power distribution systems, such as those of Shiblee and Koukaras (2025) [17], who similarly demonstrated that LightGBM systematically outperforms deep recurrent architectures (LSTM, GRU) and hybrid CNN-LSTM networks across standard error metrics while maintaining superior computational efficiency and model interpretability.
- Deep Learning vs. Linear Baselines: Deep recurrent architectures captured diurnal dependencies effectively (GRU achieving a Mean MAPE and LSTM a Mean MAPE), but were outperformed by tree ensembles due to the strong tabular signal provided by the engineered 43-variable feature vector. Classical non-seasonal ARIMA failed to generalize ( Mean MAPE) due to its inability to account for sudden holiday shocks and rapid industrial ramping.
Study Limitations and Operational Vulnerabilities
Despite the strong empirical performance of gradient-boosted tree ensembles, several operational boundaries and methodological limitations must be acknowledged:
- Susceptibility to Missing Lag Values: The 168 h recursive forecasting protocol is highly susceptible to missing or corrupted historical load lags, as an unhandled missing value at step t rapidly propagates through autoregressive feature updates across the remaining forecast horizon.
- Dependency on Meteorological Forecasting Quality: Predictive performance remains tightly coupled to the accuracy of external meteorological inputs, leaving the pipeline vulnerable to forecast errors or unexpected localized micro-climate shifts in the weather data stream.
- Geographic and Topological Boundaries:The empirical evaluation is restricted to six distribution feeders across two operational zones, limiting immediate zero-shot generalization to unobserved feeder topologies and densely populated urban networks without prior retraining.
6. Conclusions
This study addresses the critical challenge of localized short-term load forecasting at the feeder level, directly targeting the operational constraints of resource-constrained distribution substations under the Bangladesh Rural Electrification Board (BREB). While traditional national-scale models smooth out localized demand fluctuations, our multi-feeder benchmarking across Gazipur PBS-1 and Mymensingh PBS-2 demonstrates that capturing micro-climate variations and feeder-specific consumer behaviors requires a carefully balanced combination of domain-specific feature engineering and lightweight model architectures.
Addressing the core objective of balancing predictive precision against operational overhead, Random Forest achieved the minimum overall error (2.35% Mean MAPE, reaching 0.83% MAPE and 0.02 MW MAE on Sreepur-8 F2), but incurred substantial inference time for 168 h forecast (15.15 s) and memory footprint (), as shown in Table 10. In contrast, LightGBM achieved statistically equivalent accuracy (2.56% Mean MAPE; in Diebold–Mariano testing) with a 168 h inference time of just 0.55 s and a minimal 1.2 MB footprint. This demonstrates that gradient-boosted tree ensembles offer the optimal balance of accuracy, scalability, and computational efficiency required for seamless deployment in real-time power quality monitoring dashboards and automated feeder dispatching across rural utility zones.
Author Contributions
Conceptualization, M.I.Z.; methodology, P.C.K. and M.I.Z.; software, M.T.U. and P.C.K.; validation, M.T.U. and P.C.K.; formal analysis, M.T.U. and P.C.K.; investigation, M.T.U. and P.C.K.; data curation, M.T.U. and P.C.K.; writing—original draft preparation, M.T.U., P.C.K. and S.T.A.R.; writing—review and editing, S.T.A.R. and M.I.Z.; visualization, M.T.U. and P.C.K.; supervision, S.T.A.R.; project administration, M.I.Z.; funding acquisition, M.I.Z. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the Bangladesh Energy and Power Research Council (Ref: BEPRC/U-83.001.20.1).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
The data used in this study are available upon request and require authorization from the Bangladesh Power Division.
Acknowledgments
The authors would like to gratefully acknowledge the Bangladesh Energy and Power Research Council (BEPRC) for their support and the Bangladesh Rural Electrification Board (BREB) for providing the operational distribution-feeder measurements used in this study.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Habbak, H.; Mahmoud, M.; Metwally, K.; Fouda, M.M.; Ibrahem, M.I. Load Forecasting Techniques and Their Applications in Smart Grids. Energies 2023, 16, 1480. [Google Scholar] [CrossRef] [Scilit]
- Hasan, M.; Mifta, Z.; Papiya, S.J.; Roy, P.; Dey, P.; Salsabil, N.A.; Chowdhury, N.U.R.; Farrok, O. A state-of-the-art comparative review of load forecasting methods: Characteristics, perspectives, and applications. Energy Convers. Manag. X 2025, 26, 100922. [Google Scholar] [CrossRef] [Scilit]
- Gasparin, A.; Lukovic, S.; Alippi, C. Deep learning for time series forecasting: The electric load case. CAAI Trans. Intell. Technol. 2022, 7, 1–25. [Google Scholar] [CrossRef] [Scilit]
- Islam, S.; Zaber, M.; Ali, A.A. A smart grid prerequisite: Survey on electricity demand forecasting models and scope analysis of demand forecasting in Bangladesh. In Proceedings of the 2017 IEEE Region 10 Humanitarian Technology Conference (R10-HTC), Dhaka, Bangladesh, 21–23 December 2017; pp. 691–696. [Google Scholar] [CrossRef] [Scilit]
- Rafi, S.H.; Nahid-Al-Masood; Deeba, S.R.; Hossain, E. A Short-Term Load Forecasting Method Using Integrated CNN and LSTM Network. IEEE Access 2021, 9, 32436–32448. [Google Scholar] [CrossRef] [Scilit]
- Hasan-Al-Shaikh; Rahman, M.A.; Zubair, A. Electric Load Forecasting with Hourly Precision Using Long Short-Term Memory Networks. In Proceedings of the 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), Cox’s Bazar, Bangladesh, 7–9 February 2019; pp. 1–6. [Google Scholar] [CrossRef] [Scilit]
- Nti, I.K.; Teimeh, M.; Nyarko-Boateng, O.; Adekoya, A.F. Electricity load forecasting: A systematic review. J. Electr. Syst. Inf. Technol. 2020, 7, 13. [Google Scholar] [CrossRef] [Scilit]
- Ullah, K.; Ahsan, M.; Hasanat, S.M.; Haris, M.; Yousaf, H.; Raza, S.F.; Tandon, R.; Abid, S.; Ullah, Z. Short-Term Load Forecasting: A Comprehensive Review and Simulation Study with CNN-LSTM Hybrids Approach. IEEE Access 2024, 12, 111858–111881. [Google Scholar] [CrossRef] [Scilit]
- Cordeiro-Costas, M.; Villanueva, D.; Eguía-Oller, P.; Martínez-Comesaña, M.; Ramos, S. Load Forecasting with Machine Learning and Deep Learning Methods. Appl. Sci. 2023, 13, 7933. [Google Scholar] [CrossRef] [Scilit]
- Zippenfenig, P. Open-Meteo.com Weather API, Version 0.2.69; Zenodo: Geneva, Switzerland, 2023. [CrossRef]
- Breiman, L. Random forests. Mach. Learn. 2001, 45, 5–32. [Google Scholar] [CrossRef] [Scilit]
- Chen, T.; Guestrin, C. XGBoost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 13–17 August 2016; pp. 785–794. [Google Scholar] [CrossRef] [Scilit]
- Ke, G.; Meng, Q.; Finley, T.; Wang, T.; Chen, W.; Ma, W.; Ye, Q.; Liu, T.Y. LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In Advances in Neural Information Processing Systems (NeurIPS 2017); Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R., Eds.; Curran Associates, Inc.: Long Beach, CA, USA, 2017; Volume 30. [Google Scholar]
- Hochreiter, S.; Schmidhuber, J. Long short-term memory. Neural Comput. 1997, 9, 1735–1780. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Cho, K.; Van Merriënboer, B.; Gulcehre, C.; Bahdanau, D.; Bougares, F.; Schwenk, H.; Bengio, Y. Learning phrase representations using RNN encoder–decoder for statistical machine translation. arXiv 2014, arXiv:1406.1078. [Google Scholar]
- Magalhães, B.; Bento, P.; Pombo, J.; Calado, M.R.; Mariano, S. Short-Term Load Forecasting Based on Optimized Random Forest and Optimal Feature Selection. Energies 2024, 17, 1926. [Google Scholar] [CrossRef] [Scilit]
- Shiblee, M.F.H.; Koukaras, P. Short-Term Load Forecasting in the Greek Power Distribution System: A Comparative Study of Gradient Boosting and Deep Learning Models. Energies 2025, 18, 5060. [Google Scholar] [CrossRef] [Scilit]
- Kong, W.; Dong, Z.Y.; Jia, Y.; Hill, D.J.; Xu, Y.; Zhang, Y. Short-Term Residential Load Forecasting Based on LSTM Recurrent Neural Network. IEEE Trans. Smart Grid 2017, 8, 2811–2821. [Google Scholar] [CrossRef] [Scilit]
- Pavlatos, C.; Makris, E.; Fotis, G.; Vita, V.; Mladenov, V. Enhancing electrical load prediction using a bidirectional LSTM neural network. Electronics 2023, 12, 4652. [Google Scholar] [CrossRef] [Scilit]
- Abumohsen, M.; Owda, A.Y.; Owda, M. Electrical Load Forecasting Using LSTM, GRU, and RNN Algorithms. Energies 2023, 16, 2283. [Google Scholar] [CrossRef] [Scilit]
- Pentsos, V.; Tragoudas, S.; Wibbenmeyer, J.; Khdeer, N. A Hybrid LSTM-Transformer Model for Power Load Forecasting. IEEE Trans. Smart Grid 2025, 16, 2624–2634. [Google Scholar] [CrossRef] [Scilit]
- Figueiró, I.C.; Abaide, A.R.; Knak Neto, N.; Silva, L.N.F.; Santos, L.L.C. Bottom-Up Short-Term Load Forecasting Considering Macro-Region and Weighting by Meteorological Region. Energies 2023, 16, 6857. [Google Scholar] [CrossRef] [Scilit]
- Liu, H.; Wang, Y.; Wei, C.; Li, J.; Lin, Y. Two-Stage Short-Term Load Forecasting for Power Transformers Under Different Substation Operating Conditions. IEEE Access 2019, 7, 161424–161436. [Google Scholar] [CrossRef] [Scilit]
- Akarne, Y.; Essadki, A.; Nasser, T.; Annoukoubi, M. Enhanced smart microgrid scheduling: An empirical study on simultaneous energy supply and demand optimization using binary sparrow search algorithm. Results Eng. 2025, 27, 106811. [Google Scholar] [CrossRef] [Scilit]
- Shahinzadeh, H.; Nafisi, H.; Zamani, A.; Mehrabani-Najafabadi, S.; Mahmoudi, A.; Ebrahimi, F. Probabilistic Short-Term Load Forecasting Using GBDT-Based Sister Forecasts and Ensemble Methods. In Proceedings of the 2025 15th International Conference on Computer and Knowledge Engineering (ICCKE), Mashhad, Iran, 28–29 October 2025. [Google Scholar]
- Ryu, S.; Yu, J.B. Quantile-Mixer: A Novel Deep Learning Approach for Probabilistic Short-Term Load Forecasting. IEEE Trans. Smart Grid 2024, 15, 2237–2250. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.









