BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Optimal dispatch of heterogeneous batteries to maximise security o
 f supply - Simon Tindemans (Delft University of Technology)
DTSTART:20190111T100000Z
DTEND:20190111T110000Z
UID:TALK116842@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:Co-authors: Michael Evans (Imperial College London)\, David An
 geli (Imperial College London). We consider the problem of dispatching a f
 leet of heterogeneous batteries (i.e. energy-constrained generators) to pr
 event or minimise power shortage scenarios. In the general case on which n
 othing is known about future power requirements\, three significant result
 s are derived. First\, a greedy policy exists that uniquely maximises the 
 time until the fleet is first unable to supply demand. This policy implici
 tly establishes a `feasible set&rsquo\; of power requests that can be sati
 sfied by the fleet. Second\, an analytical transformation is presented tha
 t expresses this feasible set in a graphical form instead of a procedural 
 form (i.e. by invoking the policy). The graphical representation also prov
 ides a measure of the flexibility penalty due to heterogeneity. Third\, it
  is shown that the policy can be extended to handle scenarios with unavoid
 able power shortages\, in which case it minimises the energy not supplied.
  The fact that the greedy policy results in best-case security-of- supply 
 performance suggests it is suitable to be used as a reference policy for b
 attery dispatch within system adequacy studies. We present a discrete time
  algorithm that is tailored for this use case and show results for a Great
  Britain case study.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR