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

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 ener...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of modern power systems and clean energy 2019-11, Vol.7 (6), p.1632-1643
1. Verfasser: KOVÁCS, András
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2196-5625
2196-5420
DOI:10.1007/s40565-019-0569-7