A solution of unit commitment with transmission and voltage constraints by heuristic method and optimal power flow

H. Sasaki, T. Yamamoto, J. Kubokawa, T. Nagata, H. Fujita
{"title":"A solution of unit commitment with transmission and voltage constraints by heuristic method and optimal power flow","authors":"H. Sasaki, T. Yamamoto, J. Kubokawa, T. Nagata, H. Fujita","doi":"10.1109/ICPST.2000.900083","DOIUrl":null,"url":null,"abstract":"In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. We have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to the IEEE 118 test system with 36 generators over a 24-h period. The result shows that the proposed algorithm is capable of obtaining satisfactory schedules without any constraint violation.","PeriodicalId":330989,"journal":{"name":"PowerCon 2000. 2000 International Conference on Power System Technology. Proceedings (Cat. No.00EX409)","volume":"135 30","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PowerCon 2000. 2000 International Conference on Power System Technology. Proceedings (Cat. No.00EX409)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPST.2000.900083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. We have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to the IEEE 118 test system with 36 generators over a 24-h period. The result shows that the proposed algorithm is capable of obtaining satisfactory schedules without any constraint violation.
用启发式方法和最优潮流求解具有输电和电压约束的机组调度问题
针对具有传输和电压约束的机组短期调度问题,提出了一种启发式算法。机组承诺是一个非常复杂的组合优化问题,求解起来非常困难,特别是对于具有网络约束的大型电力系统。提出了一种不受网络约束的基于平均满负荷成本的启发式算法。本文提出了一种结合启发式算法和OPF算法的网络约束下的机组承诺问题的求解方法。该算法已应用于ieee118测试系统中36台发电机的24小时测试。结果表明,该算法能够在不违反约束的情况下获得满意的调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信