NEXT-HOUR ELECTRICITY PRICE FORECASTING USING LEAST SQUARES SUPPORT VECTOR MACHINE AND GENETIC ALGORITHM
Bibliographic record
Abstract
Predicting the price of electricity is crucial for the operation of power systems. Short-term electricity price forecasting deals with forecasts from an hour to a day ahead. Hourly-ahead forecasts offer expected prices to market participants before operation hours. This is especially useful for effective bidding strategies where the bidding amount can be reviewed or changed before the operation hours. Nevertheless, many existing models have relatively low prediction accuracy. Furthermore, single prediction models are typically less accurate for different scenarios. Thus, a hybrid model comprising least squares support vector machine (LSSVM) and genetic algorithm (GA) was developed in this work to predict electricity prices with higher accuracy. This model was tested on the Ontario electricity market. The inputs, which were the hourly Ontario electricity price (HOEP) and demand for the previous seven days, as well as 1-h pre-dispatch price (PDP), were optimized by GA to prevent losing potentially important inputs. At the same time, the LSSVM parameters were optimized by GA to obtain accurate forecasts. The hybrid LSSVM-GA model was shown to produce an average mean absolute percentage error (MAPE) of 8.13% and the structure of this model is less complex compared with other models developed in previous studies. This is due to the fact that only two algorithms were used (LSSVM and GA), with the load and HOEP for the week preceding the forecasting hour as the inputs. Based on the results, it is concluded that the proposed hybrid algorithm is a promising alternative to produce good electricity price forecasts.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".