Heterogeneous unit clustering for efficient operational flexibility modeling

Bryan S. Palmintier, Mort D. Webster

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

Designing future capacity mixes with adequate flexibility requires capturing operating constraints through an embedded unit commitment approximation. Despite significant recent improvements, such simulations still require significant computation times. Here we propose a method, based on clustering units, for approximate unit commitment with dramatic improvements in solution time. This method speeds computation by aggregating similar but non-identical units. This replaces large numbers of binary commitment variables with fewer integers while still capturing individual unit decisions and constraints. We demonstrate the trade-off between accuracy and run-time for different levels of aggregation. A numeric example using an ERCOT-based 205-unit system illustrates that careful aggregation introduces errors of 0.05%-0.9% across several metrics while providing several orders of magnitude faster solution times (400x) compared to traditional binary formulations. Further aggregation increases errors slightly (∼2x) with further speedup (2000x). We also compare other simplifications that can provide an additional order of magnitude speed-up for some problems.

Original languageEnglish (US)
Article number6684593
Pages (from-to)1089-1098
Number of pages10
JournalIEEE Transactions on Power Systems
Volume29
Issue number3
DOIs
StatePublished - Jan 1 2014

Fingerprint

Agglomeration

All Science Journal Classification (ASJC) codes

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this

@article{29e97969a6cd4f1eb7ba96d689a91ee2,
title = "Heterogeneous unit clustering for efficient operational flexibility modeling",
abstract = "Designing future capacity mixes with adequate flexibility requires capturing operating constraints through an embedded unit commitment approximation. Despite significant recent improvements, such simulations still require significant computation times. Here we propose a method, based on clustering units, for approximate unit commitment with dramatic improvements in solution time. This method speeds computation by aggregating similar but non-identical units. This replaces large numbers of binary commitment variables with fewer integers while still capturing individual unit decisions and constraints. We demonstrate the trade-off between accuracy and run-time for different levels of aggregation. A numeric example using an ERCOT-based 205-unit system illustrates that careful aggregation introduces errors of 0.05{\%}-0.9{\%} across several metrics while providing several orders of magnitude faster solution times (400x) compared to traditional binary formulations. Further aggregation increases errors slightly (∼2x) with further speedup (2000x). We also compare other simplifications that can provide an additional order of magnitude speed-up for some problems.",
author = "Palmintier, {Bryan S.} and Webster, {Mort D.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TPWRS.2013.2293127",
language = "English (US)",
volume = "29",
pages = "1089--1098",
journal = "IEEE Transactions on Power Systems",
issn = "0885-8950",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

Heterogeneous unit clustering for efficient operational flexibility modeling. / Palmintier, Bryan S.; Webster, Mort D.

In: IEEE Transactions on Power Systems, Vol. 29, No. 3, 6684593, 01.01.2014, p. 1089-1098.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Heterogeneous unit clustering for efficient operational flexibility modeling

AU - Palmintier, Bryan S.

AU - Webster, Mort D.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Designing future capacity mixes with adequate flexibility requires capturing operating constraints through an embedded unit commitment approximation. Despite significant recent improvements, such simulations still require significant computation times. Here we propose a method, based on clustering units, for approximate unit commitment with dramatic improvements in solution time. This method speeds computation by aggregating similar but non-identical units. This replaces large numbers of binary commitment variables with fewer integers while still capturing individual unit decisions and constraints. We demonstrate the trade-off between accuracy and run-time for different levels of aggregation. A numeric example using an ERCOT-based 205-unit system illustrates that careful aggregation introduces errors of 0.05%-0.9% across several metrics while providing several orders of magnitude faster solution times (400x) compared to traditional binary formulations. Further aggregation increases errors slightly (∼2x) with further speedup (2000x). We also compare other simplifications that can provide an additional order of magnitude speed-up for some problems.

AB - Designing future capacity mixes with adequate flexibility requires capturing operating constraints through an embedded unit commitment approximation. Despite significant recent improvements, such simulations still require significant computation times. Here we propose a method, based on clustering units, for approximate unit commitment with dramatic improvements in solution time. This method speeds computation by aggregating similar but non-identical units. This replaces large numbers of binary commitment variables with fewer integers while still capturing individual unit decisions and constraints. We demonstrate the trade-off between accuracy and run-time for different levels of aggregation. A numeric example using an ERCOT-based 205-unit system illustrates that careful aggregation introduces errors of 0.05%-0.9% across several metrics while providing several orders of magnitude faster solution times (400x) compared to traditional binary formulations. Further aggregation increases errors slightly (∼2x) with further speedup (2000x). We also compare other simplifications that can provide an additional order of magnitude speed-up for some problems.

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

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

U2 - 10.1109/TPWRS.2013.2293127

DO - 10.1109/TPWRS.2013.2293127

M3 - Article

AN - SCOPUS:84899620080

VL - 29

SP - 1089

EP - 1098

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

SN - 0885-8950

IS - 3

M1 - 6684593

ER -