Genetic algorithm solution to unit commitment problem

Hatim S. Madraswala, A. Deshpande
{"title":"Genetic algorithm solution to unit commitment problem","authors":"Hatim S. Madraswala, A. Deshpande","doi":"10.1109/ICPEICES.2016.7853075","DOIUrl":null,"url":null,"abstract":"In this paper, Genetic Algorithm (GA) is used to solve the Unit Commitment (UC) Problem. Unit commitment problem was formulated with consideration of up & down time, startup cost (Hot & Cold start), and production cost. Unit commitment schedule as well as economic dispatch is obtained to obtain total cost of generation. Problem specific operators are used in the algorithm to improve the quality of the solution obtained and increase the convergence speed of problem. Performance of the GA is tested on 2 IEEE test systems, one of 5 units, 14 bus and another of 7 units, 56 bus respectively over the scheduling period of 24 hours. Results give an insight in the superiority of GA to other methods for solving UC problem.","PeriodicalId":305942,"journal":{"name":"2016 IEEE 1st International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"280","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 1st International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPEICES.2016.7853075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 280

Abstract

In this paper, Genetic Algorithm (GA) is used to solve the Unit Commitment (UC) Problem. Unit commitment problem was formulated with consideration of up & down time, startup cost (Hot & Cold start), and production cost. Unit commitment schedule as well as economic dispatch is obtained to obtain total cost of generation. Problem specific operators are used in the algorithm to improve the quality of the solution obtained and increase the convergence speed of problem. Performance of the GA is tested on 2 IEEE test systems, one of 5 units, 14 bus and another of 7 units, 56 bus respectively over the scheduling period of 24 hours. Results give an insight in the superiority of GA to other methods for solving UC problem.
机组承诺问题的遗传算法求解
本文将遗传算法(GA)用于解决机组承诺问题。考虑了开机和停机时间、启动成本(热启动和冷启动)和生产成本,制定了机组承诺问题。得到机组承诺计划和经济调度,得到发电总成本。算法中采用了问题特定算子,提高了解的质量,加快了问题的收敛速度。在24小时的调度周期内,分别在2个IEEE测试系统上对GA的性能进行了测试,一个是5个单元,14个总线,另一个是7个单元,56个总线。结果揭示了遗传算法在解决UC问题方面的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信