Storage and Delivery Constrained Unit Commitment

Y. Al-kalaani; F. Eugenio Villaseca; F Renovich

doi:10.1109/59.496195

Storage and Delivery Constrained Unit Commitment

Y. Al-kalaani
, F. Eugenio Villaseca
, F Renovich

Cleveland State University

Research output: Contribution to journal › Article › peer-review

Abstract

A general formulation and the development of a dynamic programming algorithm to solve a fuel-constrained unit commitment problem is presented. The system under consideration has oil units with storage constraints, gas units with delivery constraints, and unconstrained coal units. An optimal approach to transfer the fuel delivery constraints into unit capacity limits using a closed-form dual dispatch is introduced. As a result, the gas units can be viewed as fuel-unconstrained, thus greatly reducing complexity. It is shown that the optimization problem, which requires that storage levels be parameterized, leads to two different dispatch rules. The oil units are dispatched to maximize the power they generate for a binding fuel amount or cost, whereas the gas and coal units are economically dispatched to provide for the remaining power. In addition to the standard constraints, the system is required to meet a minimum system spinning reserve. Test results are provided to illustrate the merits of the proposed method

Original language	American English
Journal	IEEE Transactions on Power Systems
Volume	11
DOIs	https://doi.org/10.1109/59.496195
State	Published - May 1 1996

Keywords

Short-term unit commitment
Dynamic programming
Fuel constraints
Spinning reserve
Economic dispatch
Dual dispatch
Fuel-limited capacity units

Disciplines

Electrical and Computer Engineering
Power and Energy

Access to Document

10.1109/59.496195License: CC BY

Storage and Delivery Constrained Unit CommitmentFinal published version, 2.31 MBLicense: CC BY

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=496195&contentType=Journals+%26+Magazines&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_Publication_Number%3A59%2Cp_Start_Page%3A1059%2Cp_Issue%3A2%2Cp_Volume%3A11%29

Cite this

@article{d282b37ee3244152a9e970cc2c3dc79e,

title = "Storage and Delivery Constrained Unit Commitment",

abstract = " A general formulation and the development of a dynamic programming algorithm to solve a fuel-constrained unit commitment problem is presented. The system under consideration has oil units with storage constraints, gas units with delivery constraints, and unconstrained coal units. An optimal approach to transfer the fuel delivery constraints into unit capacity limits using a closed-form dual dispatch is introduced. As a result, the gas units can be viewed as fuel-unconstrained, thus greatly reducing complexity. It is shown that the optimization problem, which requires that storage levels be parameterized, leads to two different dispatch rules. The oil units are dispatched to maximize the power they generate for a binding fuel amount or cost, whereas the gas and coal units are economically dispatched to provide for the remaining power. In addition to the standard constraints, the system is required to meet a minimum system spinning reserve. Test results are provided to illustrate the merits of the proposed method",

keywords = "Short-term unit commitment, Dynamic programming, Fuel constraints, Spinning reserve, Economic dispatch, Dual dispatch, Fuel-limited capacity units",

author = "Y. Al-kalaani and Villaseca, \{F. Eugenio\} and F Renovich",

note = "Al-kalaani, Y., Villaseca, F. E., \& Renovich, J. F. (1996). Storage and Delivery Constrained Unit Commitment. IEEE Transactions on Power Systems : a Publication of the Power Engineering Society, 11, 2, 1059-1066.",

year = "1996",

month = may,

day = "1",

doi = "10.1109/59.496195",

language = "American English",

volume = "11",

journal = "IEEE Transactions on Power Systems",

}

TY - JOUR

T1 - Storage and Delivery Constrained Unit Commitment

AU - Al-kalaani, Y.

AU - Villaseca, F. Eugenio

AU - Renovich, F

N1 - Al-kalaani, Y., Villaseca, F. E., & Renovich, J. F. (1996). Storage and Delivery Constrained Unit Commitment. IEEE Transactions on Power Systems : a Publication of the Power Engineering Society, 11, 2, 1059-1066.

PY - 1996/5/1

Y1 - 1996/5/1

N2 - A general formulation and the development of a dynamic programming algorithm to solve a fuel-constrained unit commitment problem is presented. The system under consideration has oil units with storage constraints, gas units with delivery constraints, and unconstrained coal units. An optimal approach to transfer the fuel delivery constraints into unit capacity limits using a closed-form dual dispatch is introduced. As a result, the gas units can be viewed as fuel-unconstrained, thus greatly reducing complexity. It is shown that the optimization problem, which requires that storage levels be parameterized, leads to two different dispatch rules. The oil units are dispatched to maximize the power they generate for a binding fuel amount or cost, whereas the gas and coal units are economically dispatched to provide for the remaining power. In addition to the standard constraints, the system is required to meet a minimum system spinning reserve. Test results are provided to illustrate the merits of the proposed method

AB - A general formulation and the development of a dynamic programming algorithm to solve a fuel-constrained unit commitment problem is presented. The system under consideration has oil units with storage constraints, gas units with delivery constraints, and unconstrained coal units. An optimal approach to transfer the fuel delivery constraints into unit capacity limits using a closed-form dual dispatch is introduced. As a result, the gas units can be viewed as fuel-unconstrained, thus greatly reducing complexity. It is shown that the optimization problem, which requires that storage levels be parameterized, leads to two different dispatch rules. The oil units are dispatched to maximize the power they generate for a binding fuel amount or cost, whereas the gas and coal units are economically dispatched to provide for the remaining power. In addition to the standard constraints, the system is required to meet a minimum system spinning reserve. Test results are provided to illustrate the merits of the proposed method

KW - Short-term unit commitment

KW - Dynamic programming

KW - Fuel constraints

KW - Spinning reserve

KW - Economic dispatch

KW - Dual dispatch

KW - Fuel-limited capacity units

UR - https://engagedscholarship.csuohio.edu/enece_facpub/88

U2 - 10.1109/59.496195

DO - 10.1109/59.496195

M3 - Article

VL - 11

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

ER -

Storage and Delivery Constrained Unit Commitment

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Cite this