Loading…

Dynamic programming for scalable just-in-time economic dispatch with non-convex constraints and anytime participation

•Recursive formulae for computing the parameters of value functions are given.•Discrete dynamic programming for non-convex economic dispatch is presented.•Computationally scalable and decentralized methods are proposed.•Dynamic planning of economic dispatch with ramp constraints is presented. This p...

Full description

Saved in:
Bibliographic Details
Published in:International journal of electrical power & energy systems 2020-12, Vol.123, p.106217, Article 106217
Main Authors: Kim, Jinsung, Kim, Kwang-Ki K.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c306t-590d5114662ca3e60524555098f4700ba1302619811222d28707d3ef5a6d23703
cites cdi_FETCH-LOGICAL-c306t-590d5114662ca3e60524555098f4700ba1302619811222d28707d3ef5a6d23703
container_end_page
container_issue
container_start_page 106217
container_title International journal of electrical power & energy systems
container_volume 123
creator Kim, Jinsung
Kim, Kwang-Ki K.
description •Recursive formulae for computing the parameters of value functions are given.•Discrete dynamic programming for non-convex economic dispatch is presented.•Computationally scalable and decentralized methods are proposed.•Dynamic planning of economic dispatch with ramp constraints is presented. This paper considers two classes of dynamic programming frameworks for economic dispatch in power systems. The first framework is of classical continuous convex economic dispatch. We present recursive formulae for computing the parameters of value functions and show that the value functions are generalized quadratic and generalized piecewise quadratic for unconstrained and generation-capacity constrained convex economic dispatch, respectively. The second framework is of discrete dynamic programming for economic dispatch with non-convex cost functions and constraints. The discrete dynamic programming framework is computationally scalable and decentralized. The computations of the value table are scalable in the sense that any newcomers and seceders of generation units can be numerically efficiently taken care of, by not redoing the entire backward induction process but only computing the value tables of the successors. Extension of the discrete dynamic programming framework to dynamic economic dispatch with ramp constraints is also presented. We demonstrate the proposed algorithms by three numerical case studies. One is for non-convex economic dispatch with 15 generation units and prohibited operating zones. Another example of a larger scale system of 53 units with consideration of transmission losses is also studied. For a dynamic case, the proposed method is applied to a dynamic economic dispatch problem with non-convex ramp constraints.
doi_str_mv 10.1016/j.ijepes.2020.106217
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_ijepes_2020_106217</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0142061520300193</els_id><sourcerecordid>S0142061520300193</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-590d5114662ca3e60524555098f4700ba1302619811222d28707d3ef5a6d23703</originalsourceid><addsrcrecordid>eNp9kM9KAzEQh4MoWKtv4CEvkDrJbpLdiyD1LxS86Dmk2WybpZssSVrt27t1PXsYfjAz3zB8CN1SWFCg4q5buM4ONi0YsFNLMCrP0IxWsiYFp_IczYCWjICg_BJdpdQBgKxLNkP7x6PXvTN4iGETdd87v8FtiDgZvdPrncXdPmXiPMmut9ia4MNpvXFp0Nls8ZfLW-yDJ-PkYL_xGClH7XxOWPtmrOMvOeiYnXEj5IK_Rhet3iV785dz9Pn89LF8Jav3l7flw4qYAkQmvIaGU1oKwYwurADOSs451FVbSoC1pgUwQeuKUsZYwyoJsilsy7VoWCGhmKNyumtiSCnaVg3R9ToeFQV1Uqc6NalTJ3VqUjdi9xNmx98OzkaVjLPe2MZFa7Jqgvv_wA9c6Xpl</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Dynamic programming for scalable just-in-time economic dispatch with non-convex constraints and anytime participation</title><source>ScienceDirect Journals</source><creator>Kim, Jinsung ; Kim, Kwang-Ki K.</creator><creatorcontrib>Kim, Jinsung ; Kim, Kwang-Ki K.</creatorcontrib><description>•Recursive formulae for computing the parameters of value functions are given.•Discrete dynamic programming for non-convex economic dispatch is presented.•Computationally scalable and decentralized methods are proposed.•Dynamic planning of economic dispatch with ramp constraints is presented. This paper considers two classes of dynamic programming frameworks for economic dispatch in power systems. The first framework is of classical continuous convex economic dispatch. We present recursive formulae for computing the parameters of value functions and show that the value functions are generalized quadratic and generalized piecewise quadratic for unconstrained and generation-capacity constrained convex economic dispatch, respectively. The second framework is of discrete dynamic programming for economic dispatch with non-convex cost functions and constraints. The discrete dynamic programming framework is computationally scalable and decentralized. The computations of the value table are scalable in the sense that any newcomers and seceders of generation units can be numerically efficiently taken care of, by not redoing the entire backward induction process but only computing the value tables of the successors. Extension of the discrete dynamic programming framework to dynamic economic dispatch with ramp constraints is also presented. We demonstrate the proposed algorithms by three numerical case studies. One is for non-convex economic dispatch with 15 generation units and prohibited operating zones. Another example of a larger scale system of 53 units with consideration of transmission losses is also studied. For a dynamic case, the proposed method is applied to a dynamic economic dispatch problem with non-convex ramp constraints.</description><identifier>ISSN: 0142-0615</identifier><identifier>EISSN: 1879-3517</identifier><identifier>DOI: 10.1016/j.ijepes.2020.106217</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Distributed generation ; Dynamic programming ; Economic dispatch ; Multi-parametric programming ; Non-convex optimization ; Operating prohibited zones ; Real-time dispatch ; Smart grid ; Unit commitment</subject><ispartof>International journal of electrical power &amp; energy systems, 2020-12, Vol.123, p.106217, Article 106217</ispartof><rights>2020 Elsevier Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-590d5114662ca3e60524555098f4700ba1302619811222d28707d3ef5a6d23703</citedby><cites>FETCH-LOGICAL-c306t-590d5114662ca3e60524555098f4700ba1302619811222d28707d3ef5a6d23703</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Kim, Jinsung</creatorcontrib><creatorcontrib>Kim, Kwang-Ki K.</creatorcontrib><title>Dynamic programming for scalable just-in-time economic dispatch with non-convex constraints and anytime participation</title><title>International journal of electrical power &amp; energy systems</title><description>•Recursive formulae for computing the parameters of value functions are given.•Discrete dynamic programming for non-convex economic dispatch is presented.•Computationally scalable and decentralized methods are proposed.•Dynamic planning of economic dispatch with ramp constraints is presented. This paper considers two classes of dynamic programming frameworks for economic dispatch in power systems. The first framework is of classical continuous convex economic dispatch. We present recursive formulae for computing the parameters of value functions and show that the value functions are generalized quadratic and generalized piecewise quadratic for unconstrained and generation-capacity constrained convex economic dispatch, respectively. The second framework is of discrete dynamic programming for economic dispatch with non-convex cost functions and constraints. The discrete dynamic programming framework is computationally scalable and decentralized. The computations of the value table are scalable in the sense that any newcomers and seceders of generation units can be numerically efficiently taken care of, by not redoing the entire backward induction process but only computing the value tables of the successors. Extension of the discrete dynamic programming framework to dynamic economic dispatch with ramp constraints is also presented. We demonstrate the proposed algorithms by three numerical case studies. One is for non-convex economic dispatch with 15 generation units and prohibited operating zones. Another example of a larger scale system of 53 units with consideration of transmission losses is also studied. For a dynamic case, the proposed method is applied to a dynamic economic dispatch problem with non-convex ramp constraints.</description><subject>Distributed generation</subject><subject>Dynamic programming</subject><subject>Economic dispatch</subject><subject>Multi-parametric programming</subject><subject>Non-convex optimization</subject><subject>Operating prohibited zones</subject><subject>Real-time dispatch</subject><subject>Smart grid</subject><subject>Unit commitment</subject><issn>0142-0615</issn><issn>1879-3517</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kM9KAzEQh4MoWKtv4CEvkDrJbpLdiyD1LxS86Dmk2WybpZssSVrt27t1PXsYfjAz3zB8CN1SWFCg4q5buM4ONi0YsFNLMCrP0IxWsiYFp_IczYCWjICg_BJdpdQBgKxLNkP7x6PXvTN4iGETdd87v8FtiDgZvdPrncXdPmXiPMmut9ia4MNpvXFp0Nls8ZfLW-yDJ-PkYL_xGClH7XxOWPtmrOMvOeiYnXEj5IK_Rhet3iV785dz9Pn89LF8Jav3l7flw4qYAkQmvIaGU1oKwYwurADOSs451FVbSoC1pgUwQeuKUsZYwyoJsilsy7VoWCGhmKNyumtiSCnaVg3R9ToeFQV1Uqc6NalTJ3VqUjdi9xNmx98OzkaVjLPe2MZFa7Jqgvv_wA9c6Xpl</recordid><startdate>202012</startdate><enddate>202012</enddate><creator>Kim, Jinsung</creator><creator>Kim, Kwang-Ki K.</creator><general>Elsevier Ltd</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>202012</creationdate><title>Dynamic programming for scalable just-in-time economic dispatch with non-convex constraints and anytime participation</title><author>Kim, Jinsung ; Kim, Kwang-Ki K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-590d5114662ca3e60524555098f4700ba1302619811222d28707d3ef5a6d23703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Distributed generation</topic><topic>Dynamic programming</topic><topic>Economic dispatch</topic><topic>Multi-parametric programming</topic><topic>Non-convex optimization</topic><topic>Operating prohibited zones</topic><topic>Real-time dispatch</topic><topic>Smart grid</topic><topic>Unit commitment</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Jinsung</creatorcontrib><creatorcontrib>Kim, Kwang-Ki K.</creatorcontrib><collection>CrossRef</collection><jtitle>International journal of electrical power &amp; energy systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kim, Jinsung</au><au>Kim, Kwang-Ki K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic programming for scalable just-in-time economic dispatch with non-convex constraints and anytime participation</atitle><jtitle>International journal of electrical power &amp; energy systems</jtitle><date>2020-12</date><risdate>2020</risdate><volume>123</volume><spage>106217</spage><pages>106217-</pages><artnum>106217</artnum><issn>0142-0615</issn><eissn>1879-3517</eissn><abstract>•Recursive formulae for computing the parameters of value functions are given.•Discrete dynamic programming for non-convex economic dispatch is presented.•Computationally scalable and decentralized methods are proposed.•Dynamic planning of economic dispatch with ramp constraints is presented. This paper considers two classes of dynamic programming frameworks for economic dispatch in power systems. The first framework is of classical continuous convex economic dispatch. We present recursive formulae for computing the parameters of value functions and show that the value functions are generalized quadratic and generalized piecewise quadratic for unconstrained and generation-capacity constrained convex economic dispatch, respectively. The second framework is of discrete dynamic programming for economic dispatch with non-convex cost functions and constraints. The discrete dynamic programming framework is computationally scalable and decentralized. The computations of the value table are scalable in the sense that any newcomers and seceders of generation units can be numerically efficiently taken care of, by not redoing the entire backward induction process but only computing the value tables of the successors. Extension of the discrete dynamic programming framework to dynamic economic dispatch with ramp constraints is also presented. We demonstrate the proposed algorithms by three numerical case studies. One is for non-convex economic dispatch with 15 generation units and prohibited operating zones. Another example of a larger scale system of 53 units with consideration of transmission losses is also studied. For a dynamic case, the proposed method is applied to a dynamic economic dispatch problem with non-convex ramp constraints.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.ijepes.2020.106217</doi></addata></record>
fulltext fulltext
identifier ISSN: 0142-0615
ispartof International journal of electrical power & energy systems, 2020-12, Vol.123, p.106217, Article 106217
issn 0142-0615
1879-3517
language eng
recordid cdi_crossref_primary_10_1016_j_ijepes_2020_106217
source ScienceDirect Journals
subjects Distributed generation
Dynamic programming
Economic dispatch
Multi-parametric programming
Non-convex optimization
Operating prohibited zones
Real-time dispatch
Smart grid
Unit commitment
title Dynamic programming for scalable just-in-time economic dispatch with non-convex constraints and anytime participation
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T20%3A26%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20programming%20for%20scalable%20just-in-time%20economic%20dispatch%20with%20non-convex%20constraints%20and%20anytime%20participation&rft.jtitle=International%20journal%20of%20electrical%20power%20&%20energy%20systems&rft.au=Kim,%20Jinsung&rft.date=2020-12&rft.volume=123&rft.spage=106217&rft.pages=106217-&rft.artnum=106217&rft.issn=0142-0615&rft.eissn=1879-3517&rft_id=info:doi/10.1016/j.ijepes.2020.106217&rft_dat=%3Celsevier_cross%3ES0142061520300193%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c306t-590d5114662ca3e60524555098f4700ba1302619811222d28707d3ef5a6d23703%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true