Peak Shaving through Resource Buffering

  • Authors:

  • Amotz Bar-Noy;Matthew P. Johnson;Ou Liu

  • Affiliations:

  • The Graduate Center of the City University of New York,;The Graduate Center of the City University of New York,;The Graduate Center of the City University of New York,

  • Venue:
  • Approximation and Online Algorithms
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce and solve a new problem inspired by energy pricing schemes in which a client is billed for peak usage. At each timeslot the system meets an energy demand through a combination of a new request, an unreliable amount of free source energy (e.g. solar or wind power), and previously received energy. The added piece of infrastructure is the battery , which can store surplus energy for future use. More generally, the demands could represent required amounts of energy, water, or any other tenable resource which can be obtained in advance and held until needed. In a feasible solution, each demand must be supplied on time, through a combination of newly requested energy, energy withdrawn from the battery, and free source. The goal is to minimize the maximum request. In the online version of this problem, the algorithm must determine each request without knowledge of future demands or free source availability, with the goal of maximizing the amount by which the peak is reduced. We give efficient optimal algorithms for the offline problem, with and without a bounded battery. We also show how to find the optimal offline battery size, given the requirement that the final battery level equals the initial battery level. Finally, we give efficient H n -competitive algorithms assuming the peak effective demand is revealed in advance, and provide matching lower bounds.