Meng, Fanlin and Zeng, Xiao-Jun and Zhang, Yan and Dent, Chris J and Gong, Dunwei (2018) 'An integrated optimization + learning approach to optimal dynamic pricing for the retailer with multi-type customers in smart grids.' Information Sciences, 448-44. 215 - 232. ISSN 0020-0255
|
Text
24347.pdf - Accepted Version Download (497kB) | Preview |
Abstract
In this paper, we consider a realistic and meaningful scenario in the context of smart grids where an electricity retailer serves three different types of customers, i.e., customers with an optimal home energy management system embedded in their smart meters (C-HEMS), customers with only smart meters (C-SM), and customers without smart meters (C-NONE). The main objective of this paper is to support the retailer to make optimal day-ahead dynamic pricing decisions in such a mixed customer pool. To this end, we propose a two-level decision-making framework where the retailer acting as upper-level agent firstly announces its electricity prices of next 24 h and customers acting as lower-level agents subsequently schedule their energy usages accordingly. For the lower level problem, we model the price responsiveness of different customers according to their unique characteristics. For the upper level problem, we optimize the dynamic prices for the retailer to maximize its profit subject to realistic market constraints. The above two-level model is tackled by genetic algorithms (GA) based distributed optimization methods while its feasibility and effectiveness are confirmed via simulation results.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Bilevel modelling; Genetic algorithms; Machine learning; Dynamic pricing; Demand-side management; Demand response; Smart grids |
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Science and Health > Mathematical Sciences, Department of |
Depositing User: | Elements |
Date Deposited: | 01 May 2019 14:47 |
Last Modified: | 08 Apr 2021 14:15 |
URI: | http://repository.essex.ac.uk/id/eprint/24535 |
Actions (login required)
![]() |
View Item |