Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2016
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2016
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2016
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Network-Constrained Ac Unit Commitment Under Uncertainty Using A Bender'S Decomposition Approach

Authors: B. Janani; S. Thiruvenkadam;

Network-Constrained Ac Unit Commitment Under Uncertainty Using A Bender'S Decomposition Approach

Abstract

{"references": ["R. Baldick (1995), \"The generalized unit commitment problem,\" IEEE Trans.Power Syst., vol. 10, no. 1, pp. 465\u2013475.", "F. Zhuang and F. D. Galiana (1988), \"Towards a more rigorous and practical unit commitment by Lagrangian relaxation,\" IEEE Trans. Power Syst., vol. 3, no. 2, pp. 763\u2013773.", "N. J. Redondo and A. J. Conejo (1999), \"Short-term hydro-thermal coordination by Lagrangian relaxation: solution of the dual problem,\" IEEE Trans. Power Syst., vol. 14, no. 1, pp. 89\u201395.", "A. J. Conejo, M. Carri\u00f3n (2010), and J. M. Morales, Decision Making Under Uncertainty in Electricity Markets, ser. Operations Research & Management Science. New York, NY, USA: Springer.", "S. Takriti, J. R. Birge, and E. Long (1996), \"A stochastic model for the unit commitment problem,\" IEEE Trans. Power Syst., vol. 11, no. 3, pp. 1497\u20131508.", "P. Carpentier, G. Gohen, J.-C. Culioli, and A. Renaud (1996), \"Stochastic optimization of unit commitment: a new decomposition framework,\" IEEE Trans. Power Syst., vol. 11, no. 2, pp. 1067\u20131073.", "J. M. Morales, A. J. Conejo, and J. Perez-Ruiz (2009), \"Economic valuation of reserves in power systems with high penetration of wind power,\" IEEE Trans. Power Syst., vol. 24, no. 2, pp. 900\u2013910.", "F. Bouffard, F. D. Galiana, and A. J. Conejo (2005), \"Market-clearing with stochastic security-Part I: formulation,\" IEEE Trans. Power Syst., vol. 20, no. 4, pp. 1818\u20131826.", "F. Bouffard, F. D. Galiana, and A. J. Conejo (2005), \"Market-clearing with stochastic security-Part II: case studies,\" IEEE Trans. Power Syst., vol. 20, no. 4, pp. 1827\u20131835.\n[10]\tQ. Wang, J. Wang, and Y. Guan (2015), \"Price-based unit commitment with wind power utilization constraints,\" IEEE Trans. Power Syst., vol. 28, no. 3, pp. 2718\u20132726.\n[11]\tA. Kalantari, J. F. Restrepo, and F. D. Galiana (2013), \"Security-constrained unit commitment with uncertain wind generation: the loadability set approach,\" IEEE Trans. Power Syst., vol. 28, no. 2, pp. 1787\u20131796. \n[12]\tA. Tuohy, P. Meibom, E. Denny, and M. O'Malley (2009), \"Unit commitment for systems with significant wind penetration,\" IEEE Trans. Power Syst., vol. 24, no. 2, pp. 592\u2013601.\n[13]\tJ. Wang, M. Shahidehpour, and Z. Li (2008), \"Security-constrained unit commitment with volatile wind power generation,\" IEEE Trans. Power Syst., vol. 23, no. 3, pp. 1319\u20131327.\n[14]\tW. S. Sifuentes and A. Vargas (2007), \"Hydrothermal scheduling using Benders decomposition: accelerating techniques,\" IEEE Trans. Power Syst., vol. 22, no. 3, pp. 1351\u20131359.\n[15]\tY. Fu, M. Shahidehpour, and Z. Li (2005), \"Security-constrained unit commitment with AC constraints,\" IEEE Trans. Power Syst., vol. 20, no.2, pp. 1001\u20131013.\n[16]\tC. E. Murillo-Sanchez, R. D. Zimmerman, C. L. Anderson, and R. J. Thomas (2013), \"Secure planning and operations of systems with stochastic sources, energy storage, and active demand,\" IEEE Trans. Smart Grid, vol. 4, pp. 2220\u20132229.\n[17]\tQ. P. Zheng, J. Wang, and A. L. Liu, \"Stochastic optimization for unit commitment\u2014a review,\" IEEE Trans. Power Syst., to be published.\n[18]\tJ. Ostrowski, M. F. Anjos, and A. Vannelli (2012), \"Tight mixed integer linear programming formulations for the unit commitment problem,\" IEEE Trans. Power Syst., vol. 27, no. 1, pp. 39\u201346.\n[19]\tS. Muller, M. Deicke, and R. W. D. Doncker (2002), \"Doubly fed induction generator systems for wind turbines,\" IEEE Ind. Appl. Mag., vol. 8, pp. 26\u201333.\n[20]\tA. J. Conejo, E. Castillo, R. Minguez, and R. Garcia-Bertrand (2006), Decomposition Techniques in Mathematical Programming: Engineering and Science Applications. Heidelberg, Germany: Springer.\n[21]\tD. P. Bertsekas and N. R. Sandell (1982), \"Estimates of the duality gap for large-scale separable nonconvex optimization problems,\" in Proc. 21st IEEE Conf. Decision and Control, vol. 21, pp. 782\u2013785.\n[22]\tEnergy Information Administration (Online). Available: http://www.eia.gov/countries/data.cfm.\n[23]\tT. N. Santos and A. L. Diniz (2009), \"Feasibility and optimality cuts for the multistage Benders decomposition approach: Application to the network constrained hydrothermal scheduling,\" in Proc. IEEE Power Energy Soc. General Meeting, 2009 (PES '09), pp. 1\u20138."]}

In this work, the system evaluates the impact of considering a stochastic approach on the day ahead basis Unit Commitment. Comparisons between stochastic and deterministic Unit Commitment solutions are provided. The Unit Commitment model consists in the minimization of the total operation costs considering unit’s technical constraints like ramping rates, minimum up and down time. Load shedding and wind power spilling is acceptable, but at inflated operational costs. The evaluation process consists in the calculation of the optimal unit commitment and in verifying the fulfillment of the considered constraints. For the calculation of the optimal unit commitment, an algorithm based on the Benders Decomposition, namely on the Dual Dynamic Programming, was developed. Two approaches were considered on the construction of stochastic solutions. Data related to wind power outputs from two different operational days are considered on the analysis. Stochastic and deterministic solutions are compared based on the actual measured wind power output at the operational day. Through a technique capability of finding representative wind power scenarios and its probabilities, the system can analyze a more detailed process about the expected final operational cost.

Keywords

stochastic programming, wind power uncertainty., Benders' decomposition, network constrained AC unit commitment

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 2
    download downloads 3
  • 2
    views
    3
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
2
3
Green