Non-Iterative Enhanced SDP Relaxations for Optimal Scheduling of Distributed Energy Storage in Distribution Systems

Qifeng Li, Vijay Vittal

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Convexification of an optimal scheduling algorithm for distributed energy storage (DES) in radial distribution systems with high penetration of photovoltaic resources is studied. The AC power flow equalities are taken into account as constraints in the optimization model. Different from the typical optimal power flow problem, the objective function of a DES optimal scheduling (DESOS) problem varies with changing operational requirements. In this paper, three frequently-used objective functions are considered for the DESOS problem. Two of them are monotonic over the feasible set while the third is not. An illustrative example elucidates that the descent direction of a chosen objective function significantly impacts the efficiency of the second-order cone programming (SOCP) relaxation for the DESOS problem. To obtain tighter semidefinite programming (SDP) relaxations for the DESOS cases where the SOCP relaxation is not exact, this paper looks for computationally efficient convex constraints that can approximate the rank-1 constraint in the non-iterative framework. The designed non-iterative enhanced SDP relaxations are compared in terms of tightness of convexification for the DESOS problems considering the three objective functions independently. The comparison is performed on several radial IEEE test systems and a real world distribution feeder.

Original languageEnglish (US)
Article number7523207
Pages (from-to)1721-1732
Number of pages12
JournalIEEE Transactions on Power Systems
Volume32
Issue number3
DOIs
StatePublished - May 1 2017

Fingerprint

Energy storage
Scheduling
Cones
Scheduling algorithms

Keywords

  • Convex relaxation
  • distributed energy storage (DES)
  • enhanced SDP (ESDP) relaxation
  • non-iterative
  • optimal dispatch

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this

Non-Iterative Enhanced SDP Relaxations for Optimal Scheduling of Distributed Energy Storage in Distribution Systems. / Li, Qifeng; Vittal, Vijay.

In: IEEE Transactions on Power Systems, Vol. 32, No. 3, 7523207, 01.05.2017, p. 1721-1732.

Research output: Contribution to journalArticle

@article{3588fae9ca4b4c47abd2dc2eed5a7478,
title = "Non-Iterative Enhanced SDP Relaxations for Optimal Scheduling of Distributed Energy Storage in Distribution Systems",
abstract = "Convexification of an optimal scheduling algorithm for distributed energy storage (DES) in radial distribution systems with high penetration of photovoltaic resources is studied. The AC power flow equalities are taken into account as constraints in the optimization model. Different from the typical optimal power flow problem, the objective function of a DES optimal scheduling (DESOS) problem varies with changing operational requirements. In this paper, three frequently-used objective functions are considered for the DESOS problem. Two of them are monotonic over the feasible set while the third is not. An illustrative example elucidates that the descent direction of a chosen objective function significantly impacts the efficiency of the second-order cone programming (SOCP) relaxation for the DESOS problem. To obtain tighter semidefinite programming (SDP) relaxations for the DESOS cases where the SOCP relaxation is not exact, this paper looks for computationally efficient convex constraints that can approximate the rank-1 constraint in the non-iterative framework. The designed non-iterative enhanced SDP relaxations are compared in terms of tightness of convexification for the DESOS problems considering the three objective functions independently. The comparison is performed on several radial IEEE test systems and a real world distribution feeder.",
keywords = "Convex relaxation, distributed energy storage (DES), enhanced SDP (ESDP) relaxation, non-iterative, optimal dispatch",
author = "Qifeng Li and Vijay Vittal",
year = "2017",
month = "5",
day = "1",
doi = "10.1109/TPWRS.2016.2594298",
language = "English (US)",
volume = "32",
pages = "1721--1732",
journal = "IEEE Transactions on Power Systems",
issn = "0885-8950",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Non-Iterative Enhanced SDP Relaxations for Optimal Scheduling of Distributed Energy Storage in Distribution Systems

AU - Li, Qifeng

AU - Vittal, Vijay

PY - 2017/5/1

Y1 - 2017/5/1

N2 - Convexification of an optimal scheduling algorithm for distributed energy storage (DES) in radial distribution systems with high penetration of photovoltaic resources is studied. The AC power flow equalities are taken into account as constraints in the optimization model. Different from the typical optimal power flow problem, the objective function of a DES optimal scheduling (DESOS) problem varies with changing operational requirements. In this paper, three frequently-used objective functions are considered for the DESOS problem. Two of them are monotonic over the feasible set while the third is not. An illustrative example elucidates that the descent direction of a chosen objective function significantly impacts the efficiency of the second-order cone programming (SOCP) relaxation for the DESOS problem. To obtain tighter semidefinite programming (SDP) relaxations for the DESOS cases where the SOCP relaxation is not exact, this paper looks for computationally efficient convex constraints that can approximate the rank-1 constraint in the non-iterative framework. The designed non-iterative enhanced SDP relaxations are compared in terms of tightness of convexification for the DESOS problems considering the three objective functions independently. The comparison is performed on several radial IEEE test systems and a real world distribution feeder.

AB - Convexification of an optimal scheduling algorithm for distributed energy storage (DES) in radial distribution systems with high penetration of photovoltaic resources is studied. The AC power flow equalities are taken into account as constraints in the optimization model. Different from the typical optimal power flow problem, the objective function of a DES optimal scheduling (DESOS) problem varies with changing operational requirements. In this paper, three frequently-used objective functions are considered for the DESOS problem. Two of them are monotonic over the feasible set while the third is not. An illustrative example elucidates that the descent direction of a chosen objective function significantly impacts the efficiency of the second-order cone programming (SOCP) relaxation for the DESOS problem. To obtain tighter semidefinite programming (SDP) relaxations for the DESOS cases where the SOCP relaxation is not exact, this paper looks for computationally efficient convex constraints that can approximate the rank-1 constraint in the non-iterative framework. The designed non-iterative enhanced SDP relaxations are compared in terms of tightness of convexification for the DESOS problems considering the three objective functions independently. The comparison is performed on several radial IEEE test systems and a real world distribution feeder.

KW - Convex relaxation

KW - distributed energy storage (DES)

KW - enhanced SDP (ESDP) relaxation

KW - non-iterative

KW - optimal dispatch

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

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

U2 - 10.1109/TPWRS.2016.2594298

DO - 10.1109/TPWRS.2016.2594298

M3 - Article

VL - 32

SP - 1721

EP - 1732

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

SN - 0885-8950

IS - 3

M1 - 7523207

ER -