Method note · scenario
The cheapest-hours saving
What it measures
What a daily load that can move to other hours would save each year running only in the cheapest hours of the day, against paying the average price.
Inputs
- The day-ahead price on the canonical hourly grid, for the bidding zone selected on the view
- A daily load that can move to other hours, such as charging an electric car, and the number of hours it can move into, both stated on the view
Method and weighting
Each local day, the load is placed in the cheapest hours of its stated count, drawn from the canonical hourly grid for the zone, and priced at those hours.
That optimised cost is averaged across the days with enough priced hours, and set against the same load priced at the period's flat mean, the mean price over every hour in the window. The difference between the two averages is scaled up to the days of a year for the annual saving.
Window
The rolling 12 months to the last complete day, refreshed on the 1st and 15th of each month. The current window runs from to . Data last refreshed on .
Known limits
- It is an upper bound: it assumes perfect foresight, knowing in advance which hours will be cheapest.
- The price is the wholesale price, before network charges, levies and tax.
Used on
- Flexibility in The Bill
Sources: ENTSO-E. Each is described on the Data sources page.