An Optimal Real-time Pricing Algorithm for the Smart Grid: A Bi-level Programming Approach

Authors Fan-Lin Meng, Xiao-Jun Zeng



PDF
Thumbnail PDF

File

OASIcs.ICCSW.2013.81.pdf
  • Filesize: 0.54 MB
  • 8 pages

Document Identifiers

Author Details

Fan-Lin Meng
Xiao-Jun Zeng

Cite As Get BibTex

Fan-Lin Meng and Xiao-Jun Zeng. An Optimal Real-time Pricing Algorithm for the Smart Grid: A Bi-level Programming Approach. In 2013 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 35, pp. 81-88, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/OASIcs.ICCSW.2013.81

Abstract

This paper proposes an improved approach to our previous work [meng2012stackelberg]. [meng2012stackelberg] uses Stackelberg game to model the interactions between electricity retailer and its customers and genetic algorithms are used to obtain the Stackelberg Equilibrium (SE). In this paper, we propose a bi-level programming model by considering benefits of the electricity retailer (utility company) and its customer. In the upper level model, the electricity retailer determines the real-time retail prices with the aim to maximize its profit. The customer reacts to the prices announced by the retailer aiming to minimize their electricity bills in the lower level model. In order to make it more tractable, we convert the hierarchical bi-level programming problem into one single level problem by replacing the lower lever's problem with his Karush–Kuhn–Tucker (KKT) conditions. A branch and bound algorithm is chosen to solve the resulting single level problem. Experimental results show that both the bi-level programming model and the solution method are feasible. Compared with the genetic algorithm approach proposed in work [meng2012stackelberg], the branch and bound algorithm in this paper is more efficient in finding the optimal solution.

Subject Classification

Keywords
  • Real-time Pricing
  • Demand Response
  • Smart Gird
  • Bi-level Programming
  • Branch and Bound Algorithm

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail