A Review of Unit Commitment Problem Using Dynamic Programming

S. Chaudhari, Saurabh Killekar, Aishwarya Mahadik, Nair Meerakrishna, M. Divya
{"title":"A Review of Unit Commitment Problem Using Dynamic Programming","authors":"S. Chaudhari, Saurabh Killekar, Aishwarya Mahadik, Nair Meerakrishna, M. Divya","doi":"10.1109/ICNTE44896.2019.8945885","DOIUrl":null,"url":null,"abstract":"Optimization of unit commitment can be performed in various ways which include Dynamic Programming as one of the most reliable method. The precise meaning of unit commitment is scheduling of generators to increase the efficiency of generation while keeping the cost of generation to be minimum. This can be achieved by systematic following of the procedures of dynamic programming. Constraints related to dynamic programming enfolds the practical situations. Ideal situations can be often misinterpreted and certain factors of conditioning can be ignored. Hence, reliability constraint pertaining to risk of generation limit incapability is also important and down to be looked upon. Simulation of dynamic programming offers a better insight of the nominal and the actual values induced by using this programming method.","PeriodicalId":292408,"journal":{"name":"2019 International Conference on Nascent Technologies in Engineering (ICNTE)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Nascent Technologies in Engineering (ICNTE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNTE44896.2019.8945885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Optimization of unit commitment can be performed in various ways which include Dynamic Programming as one of the most reliable method. The precise meaning of unit commitment is scheduling of generators to increase the efficiency of generation while keeping the cost of generation to be minimum. This can be achieved by systematic following of the procedures of dynamic programming. Constraints related to dynamic programming enfolds the practical situations. Ideal situations can be often misinterpreted and certain factors of conditioning can be ignored. Hence, reliability constraint pertaining to risk of generation limit incapability is also important and down to be looked upon. Simulation of dynamic programming offers a better insight of the nominal and the actual values induced by using this programming method.
基于动态规划的机组承诺问题综述
机组运行状态的优化有多种方法,其中动态规划是最可靠的方法之一。机组承诺的准确含义是对发电机组进行调度,以提高发电效率,同时保持发电成本最低。这可以通过系统地遵循动态规划程序来实现。与动态规划相关的约束包含了实际情况。理想的情况往往会被误解,某些条件作用的因素可能会被忽略。因此,与发电极限失效风险相关的可靠性约束也很重要,值得重视。动态规划的仿真可以更好地了解使用这种规划方法所得到的标称值和实际值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信