Dynamic Demand Response Using Customer Coupons Considering Multiple Load Aggregators to Simultaneously Achieve Efficiency and Fairness

Zhechao Li, Shaorong Wang, Xuejun Zheng, Francisco De Leon, Tianqi Hong

Research output: Contribution to journalArticlepeer-review

Abstract

This paper discusses the feasibility of using customer coupon demand response in meshed secondary networks. Customers are rewarded by coupons to achieve the objective of optimal operation cost during peak periods. The interdependence of the locational marginal price and the demand is modeled by an artificial neural network. The effect of multiple load aggregators participating in customer coupon demand response is also investigated. Because load aggregators satisfy different proportions of the objective, a fairness function is defined that guarantees that aggregators are rewarded in correspondence with their participation toward the objective. Energy loss is also considered in the objective as it is an essential part of the distribution system. A dynamic coupon mechanism is designed to cope with the changing nature of the demand. To validate the effectiveness of the method, simulations of the proposed method have been performed on a real heavily-meshed distribution network in this paper. The results show that customer coupon demand response significantly contributes to shaving the peak, therefore, bringing considerable economic savings and reduction of loss.

Original languageEnglish (US)
Pages (from-to)3112-3121
Number of pages10
JournalIEEE Transactions on Smart Grid
Volume9
Issue number4
DOIs
StatePublished - Jul 2018

Keywords

  • Customer coupon demand response
  • fairness
  • load aggregator
  • locational marginal price
  • meshed secondary network

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Dynamic Demand Response Using Customer Coupons Considering Multiple Load Aggregators to Simultaneously Achieve Efficiency and Fairness'. Together they form a unique fingerprint.

Cite this