Demand bidding optimization for an aggregator with a genetic algorithm

Leehter Yao, Wei Hong Lim, Sew Sun Tiang, Teng Hwang Tan, Chin Hong Wong, Jia Yew Pang

Research output: Contribution to journalArticle

Abstract

Demand response (DR) is an effective solution used to maintain the reliability of power systems. Although numerous demand bidding models were designed to balance the demand and supply of electricity, these works focused on optimizing the DR supply curve of aggregator and the associated clearing prices. Limited researches were done to investigate the interaction between each aggregator and its customers to ensure the delivery of promised load curtailments. In this paper, a closed demand bidding model is envisioned to bridge the aforementioned gap by facilitating the internal DR trading between the aggregator and its large contract customers. The customers can submit their own bid as a pairs of bidding price and quantity of load curtailment in hourly basis when demand bidding is needed. A purchase optimization scheme is then designed to minimize the total bidding purchase cost. Given the presence of various load curtailment constraints, the demand bidding model considered is highly nonlinear. A modified genetic algorithm incorporated with efficient encoding scheme and adaptive bid declination strategy is therefore proposed to solve this problem effectively. Extensive simulation shows that the proposed purchase optimization scheme can minimize the total cost of demand bidding and it is computationally feasible for real applications.

Original languageEnglish
Article number2498
JournalEnergies
Volume11
Issue number10
DOIs
Publication statusPublished - 20 Sep 2018

Fingerprint

Bidding
Genetic algorithms
Genetic Algorithm
Optimization
Costs
Electricity
Customers
Declination
Minimise
Demand
Power System
Encoding
Model
Internal
Closed
Curve

Keywords

  • Demand bidding
  • Demand response
  • Genetic algorithm
  • Load curtailment
  • Optimization

ASJC Scopus subject areas

  • Renewable Energy, Sustainability and the Environment
  • Energy Engineering and Power Technology
  • Energy (miscellaneous)
  • Control and Optimization
  • Electrical and Electronic Engineering

Cite this

Yao, L., Lim, W. H., Tiang, S. S., Tan, T. H., Hong Wong, C., & Pang, J. Y. (2018). Demand bidding optimization for an aggregator with a genetic algorithm. Energies, 11(10), [2498]. https://doi.org/10.3390/en11102498
Yao, Leehter ; Lim, Wei Hong ; Tiang, Sew Sun ; Tan, Teng Hwang ; Hong Wong, Chin ; Pang, Jia Yew. / Demand bidding optimization for an aggregator with a genetic algorithm. In: Energies. 2018 ; Vol. 11, No. 10.
@article{fbaae6234de84d89b9416a94637a9c44,
title = "Demand bidding optimization for an aggregator with a genetic algorithm",
abstract = "Demand response (DR) is an effective solution used to maintain the reliability of power systems. Although numerous demand bidding models were designed to balance the demand and supply of electricity, these works focused on optimizing the DR supply curve of aggregator and the associated clearing prices. Limited researches were done to investigate the interaction between each aggregator and its customers to ensure the delivery of promised load curtailments. In this paper, a closed demand bidding model is envisioned to bridge the aforementioned gap by facilitating the internal DR trading between the aggregator and its large contract customers. The customers can submit their own bid as a pairs of bidding price and quantity of load curtailment in hourly basis when demand bidding is needed. A purchase optimization scheme is then designed to minimize the total bidding purchase cost. Given the presence of various load curtailment constraints, the demand bidding model considered is highly nonlinear. A modified genetic algorithm incorporated with efficient encoding scheme and adaptive bid declination strategy is therefore proposed to solve this problem effectively. Extensive simulation shows that the proposed purchase optimization scheme can minimize the total cost of demand bidding and it is computationally feasible for real applications.",
keywords = "Demand bidding, Demand response, Genetic algorithm, Load curtailment, Optimization",
author = "Leehter Yao and Lim, {Wei Hong} and Tiang, {Sew Sun} and Tan, {Teng Hwang} and {Hong Wong}, Chin and Pang, {Jia Yew}",
year = "2018",
month = "9",
day = "20",
doi = "10.3390/en11102498",
language = "English",
volume = "11",
journal = "Energies",
issn = "1996-1073",
publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",
number = "10",

}

Yao, L, Lim, WH, Tiang, SS, Tan, TH, Hong Wong, C & Pang, JY 2018, 'Demand bidding optimization for an aggregator with a genetic algorithm', Energies, vol. 11, no. 10, 2498. https://doi.org/10.3390/en11102498

Demand bidding optimization for an aggregator with a genetic algorithm. / Yao, Leehter; Lim, Wei Hong; Tiang, Sew Sun; Tan, Teng Hwang; Hong Wong, Chin; Pang, Jia Yew.

In: Energies, Vol. 11, No. 10, 2498, 20.09.2018.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Demand bidding optimization for an aggregator with a genetic algorithm

AU - Yao, Leehter

AU - Lim, Wei Hong

AU - Tiang, Sew Sun

AU - Tan, Teng Hwang

AU - Hong Wong, Chin

AU - Pang, Jia Yew

PY - 2018/9/20

Y1 - 2018/9/20

N2 - Demand response (DR) is an effective solution used to maintain the reliability of power systems. Although numerous demand bidding models were designed to balance the demand and supply of electricity, these works focused on optimizing the DR supply curve of aggregator and the associated clearing prices. Limited researches were done to investigate the interaction between each aggregator and its customers to ensure the delivery of promised load curtailments. In this paper, a closed demand bidding model is envisioned to bridge the aforementioned gap by facilitating the internal DR trading between the aggregator and its large contract customers. The customers can submit their own bid as a pairs of bidding price and quantity of load curtailment in hourly basis when demand bidding is needed. A purchase optimization scheme is then designed to minimize the total bidding purchase cost. Given the presence of various load curtailment constraints, the demand bidding model considered is highly nonlinear. A modified genetic algorithm incorporated with efficient encoding scheme and adaptive bid declination strategy is therefore proposed to solve this problem effectively. Extensive simulation shows that the proposed purchase optimization scheme can minimize the total cost of demand bidding and it is computationally feasible for real applications.

AB - Demand response (DR) is an effective solution used to maintain the reliability of power systems. Although numerous demand bidding models were designed to balance the demand and supply of electricity, these works focused on optimizing the DR supply curve of aggregator and the associated clearing prices. Limited researches were done to investigate the interaction between each aggregator and its customers to ensure the delivery of promised load curtailments. In this paper, a closed demand bidding model is envisioned to bridge the aforementioned gap by facilitating the internal DR trading between the aggregator and its large contract customers. The customers can submit their own bid as a pairs of bidding price and quantity of load curtailment in hourly basis when demand bidding is needed. A purchase optimization scheme is then designed to minimize the total bidding purchase cost. Given the presence of various load curtailment constraints, the demand bidding model considered is highly nonlinear. A modified genetic algorithm incorporated with efficient encoding scheme and adaptive bid declination strategy is therefore proposed to solve this problem effectively. Extensive simulation shows that the proposed purchase optimization scheme can minimize the total cost of demand bidding and it is computationally feasible for real applications.

KW - Demand bidding

KW - Demand response

KW - Genetic algorithm

KW - Load curtailment

KW - Optimization

UR - http://www.scopus.com/inward/record.url?scp=85056113906&partnerID=8YFLogxK

U2 - 10.3390/en11102498

DO - 10.3390/en11102498

M3 - Article

AN - SCOPUS:85056113906

VL - 11

JO - Energies

JF - Energies

SN - 1996-1073

IS - 10

M1 - 2498

ER -