Abstract

The current energy transition and the underlying growth in variable and uncertain renewable-based energy generation challenge the proper operation of power systems. Classical probabilistic uncertainty models, e.g., stochastic programming or robust optimisation, have been used widely to solve problems such as the day-ahead energy and reserve dispatch problem to enhance the day-ahead decisions with a probabilistic insight of renewable energy generation in real-time. By doing so, the scheduling of the power system becomes, production and consumption of electric power, more reliable (i.e., more robust because of potential deviations) while minimising the social costs given potential balancing actions. Nevertheless, these classical models are not valid when the uncertainty is imprecise, meaning that the system operator may not rely on a unique distribution function to describe the uncertainty. Given the Distributionally Robust Optimisation method, our approach can be implemented for any non-probabilistic, e.g., interval models rather than only sets of distribution functions (ambiguity set of probability distributions). In this paper, the aim is to apply two advanced non-probabilistic uncertainty models: Interval and ϵ-contamination, where the imprecision and in-determinism in the uncertainty (uncertain parameters) are considered. We propose two kinds of theoretical solutions under two decision criteria—Maximinity and Maximality. For an illustration of our solutions, we apply our proposed approach to a case study inspired by the 24-node IEEE reliability test system.

Highlights

  • Introduction iationsOne of the important points in our life is to deal with uncertainties

  • Considering the U.S simultaneous energy and reserve dispatch, this paper focuses on the incorporation of the uncertainty into the energy and reserve dispatch solution with two advanced uncertainty models which account for imprecision and in-determinism, i.e., the erroneous modelling of uncertainty via a unique distribution function

  • Many applications for linear programming (LP) under uncertainty (LPUU) problems exist, few are addressed by Dantzig in [12] (Example 2), which is habitually about obtaining the minimum expected cost, e.g., most inexpensive diet in a Nutrition problem

Read more

Summary

Linear Programming under Uncertainty

Many applications for LP under uncertainty (LPUU) problems exist, few are addressed by Dantzig in [12] (Example 2), which is habitually about obtaining the minimum expected cost, e.g., most inexpensive diet in a Nutrition problem. An LPUU problem is a generalisation of the LP problem where at least one of the coefficients of the LP problem is uncertain (meaning they are not deterministic, we do not know the exact values or the values are not known, precisely). The generic (standard) linear programming problem under uncertainty is defined as follows, maximise U T x such that Yx ≤ Z, x ≥ 0.

Reformulating LP Problem as a Decision Problem
Interval Model
Day-Ahead Energy and Reserve Dispatch Problem
Use Case—Data and DA-Problem Modelling
Interval Model—DA-Energy and Reserve Dispatch Problem
Maximal Solutions in Interval Case
Maximin Solutions in e-Contamination Case
Maximal Solutions in e-Contamination Case
Numerical Maximin and Maximal Solutions for the DA-Energy and Reserve
Interval Case
Numerical Maximin Solution in Interval Case
Numerical Maximal Solutions in Interval Case
Numerical Maximin Solutions in e-Contamination Case
Numerical Maximal Solutions in e-Contamination Case
Numerical Results
Comparison
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call