印度电力池日前电站可用性最优声明的随机模型

N. Vaitheeswaran, R. Balasubramanian
{"title":"印度电力池日前电站可用性最优声明的随机模型","authors":"N. Vaitheeswaran, R. Balasubramanian","doi":"10.1109/POWERI.2006.1632553","DOIUrl":null,"url":null,"abstract":"This paper evolves a strategy for optimal declaration of the day ahead generation availability in the 'Availability Based Tariff regime in India'. The mathematical formulation presented in this paper maximizes the expected revenue of the generator by considering various stochastic parameters. The computational model developed in this work considers three random variables viz, the generating unit's availability, unscheduled interchange (UI) and load. The state transition of generating units is assumed to follow the first order Markov's process. The load and unscheduled interchange related to grid frequency follow known discrete probability distributions. Monte Carlo state duration sampling is applied for simulating the unit transitions. Both UI as well as load uncertainty are generated by state sampling approach from their probability distributions. The expected revenue generated in a day, comprising of 96 time blocks of 15 minutes duration, is statistically computed. Finally by iterative approach, the expected optimal station availability for next day's declaration is computed. A numerical example of a generating station is illustrated to show the revenue maximization strategy by this optimization","PeriodicalId":191301,"journal":{"name":"2006 IEEE Power India Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Stochastic model for optimal declaration of day ahead station availability in power pools in India\",\"authors\":\"N. Vaitheeswaran, R. Balasubramanian\",\"doi\":\"10.1109/POWERI.2006.1632553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper evolves a strategy for optimal declaration of the day ahead generation availability in the 'Availability Based Tariff regime in India'. The mathematical formulation presented in this paper maximizes the expected revenue of the generator by considering various stochastic parameters. The computational model developed in this work considers three random variables viz, the generating unit's availability, unscheduled interchange (UI) and load. The state transition of generating units is assumed to follow the first order Markov's process. The load and unscheduled interchange related to grid frequency follow known discrete probability distributions. Monte Carlo state duration sampling is applied for simulating the unit transitions. Both UI as well as load uncertainty are generated by state sampling approach from their probability distributions. The expected revenue generated in a day, comprising of 96 time blocks of 15 minutes duration, is statistically computed. Finally by iterative approach, the expected optimal station availability for next day's declaration is computed. A numerical example of a generating station is illustrated to show the revenue maximization strategy by this optimization\",\"PeriodicalId\":191301,\"journal\":{\"name\":\"2006 IEEE Power India Conference\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Power India Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/POWERI.2006.1632553\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Power India Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/POWERI.2006.1632553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文提出了一种在“印度基于可用性的电价制度”中对前一天发电可用性进行最佳声明的策略。本文提出的数学公式考虑了各种随机参数,使发电机的期望收益最大化。本文建立的计算模型考虑了三个随机变量,即发电机组的可用性、非计划交换(UI)和负荷。假设发电机组的状态转移遵循一阶马尔可夫过程。与电网频率相关的负荷和计划外交换服从已知的离散概率分布。采用蒙特卡罗状态持续时间采样法模拟单元跃迁。用户界面和负载不确定性都是通过状态抽样方法从它们的概率分布中产生的。一天产生的预期收入,由96个15分钟的时间段组成,统计计算。最后通过迭代法,计算出第二天申报的预期最优站位可用性。以某电站为例,说明了该优化方法的收益最大化策略
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stochastic model for optimal declaration of day ahead station availability in power pools in India
This paper evolves a strategy for optimal declaration of the day ahead generation availability in the 'Availability Based Tariff regime in India'. The mathematical formulation presented in this paper maximizes the expected revenue of the generator by considering various stochastic parameters. The computational model developed in this work considers three random variables viz, the generating unit's availability, unscheduled interchange (UI) and load. The state transition of generating units is assumed to follow the first order Markov's process. The load and unscheduled interchange related to grid frequency follow known discrete probability distributions. Monte Carlo state duration sampling is applied for simulating the unit transitions. Both UI as well as load uncertainty are generated by state sampling approach from their probability distributions. The expected revenue generated in a day, comprising of 96 time blocks of 15 minutes duration, is statistically computed. Finally by iterative approach, the expected optimal station availability for next day's declaration is computed. A numerical example of a generating station is illustrated to show the revenue maximization strategy by this optimization
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信