Journal of Modern Power Systems and Clean Energy

ISSN 2196-5625 CN 32-1884/TK

Bilevel programming approach to demand response management with day-ahead tariff
Author:
Affiliation:

1 EPIC Center of Excellence in Production Informatics and Control, Institute for Computer Science and Control, Hungarian Academy of Sciences, Budapest, Hungary

Fund Project:

This research was supported by the GINOP grant (No. 2.3.2-15-2016-00002), the NKFIA grant 129178, and the Janos Bolyai Research Fellowship.

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
    Abstract:

    This paper introduces a bilevel programming approach to electricity tariff optimization for the purpose of demand response management (DRM) in smart grids. In the multi-follower Stackelberg game model, the leader is the profit-maximizing electricity retailer, who must set a time-of-use variable energy tariff in the grid. Followers correspond to groups of prosumers (simultaneous producers and consumers of the electricity. They response to the observed tariff, schedule controllable loads and determine the charging/discharging policy of their batteries to minimize the cost of electricity and to maximize the utility at the same time. A bilevel programming formulation of the problem is defined, and its fundamental properties are proven. The primal-dual reformulation is proposed in this paper to convert the bilevel optimization problem into a single-level quadratically constrained quadratic program (QCQP), and a successive linear programming (SLP) algorithm is applied to solve it. It is demonstrated in computational experiments that the proposed approach outperforms typical earlier methods based on the Karush– Kuhn–Tucker (KKT) reformulation regarding both solution quality and computational efficiency on practically relevant problem sizes. Besides, it also offers more flexible modeling capabilities.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: November 27,2019
  • Published: