Hybrid ant system/priority list method for unit commitment problem with operating constraints

K. Withironprasert, S. Chusanapiputt, D. Nualhong, S. Jantarang, S. Phoomvuthisarn
{"title":"Hybrid ant system/priority list method for unit commitment problem with operating constraints","authors":"K. Withironprasert, S. Chusanapiputt, D. Nualhong, S. Jantarang, S. Phoomvuthisarn","doi":"10.1109/ICIT.2009.4939612","DOIUrl":null,"url":null,"abstract":"This paper presents a new method to solve unit commitment problem with operating constraints using a hybrid ant system/priority list method (HASP). The proposed methodology employs ant system in cooperating with the priority list method to find unit commitment solution as means of mutually combining the advantages of them in that a flexibility of the priority list method is reinforced, while AS algorithm can gain the benefit of using bias information for improving its performance during search process. The simulation results show that the proposed HASP is capable of obtaining satisfactory solution within reasonable computational time. Moreover, the proposed HASP can be extensively applied to handle the ramp rate limits and the operating reserve constraint, which are important for modern power system operation.","PeriodicalId":405687,"journal":{"name":"2009 IEEE International Conference on Industrial Technology","volume":"465 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Industrial Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2009.4939612","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

This paper presents a new method to solve unit commitment problem with operating constraints using a hybrid ant system/priority list method (HASP). The proposed methodology employs ant system in cooperating with the priority list method to find unit commitment solution as means of mutually combining the advantages of them in that a flexibility of the priority list method is reinforced, while AS algorithm can gain the benefit of using bias information for improving its performance during search process. The simulation results show that the proposed HASP is capable of obtaining satisfactory solution within reasonable computational time. Moreover, the proposed HASP can be extensively applied to handle the ramp rate limits and the operating reserve constraint, which are important for modern power system operation.
具有运行约束的机组承诺问题的混合蚂蚁系统/优先列表方法
本文提出了一种基于混合蚁群系统/优先级列表法(HASP)求解具有运行约束的机组承诺问题的新方法。该方法采用蚁群系统与优先级列表方法协同寻找单元承诺解,将两者的优点相互结合,增强了优先级列表方法的灵活性,而as算法则可以利用偏差信息提高其搜索过程中的性能。仿真结果表明,所提出的HASP能够在合理的计算时间内得到满意的解。此外,所提出的HASP可以广泛应用于处理斜坡速率限制和运行储备约束,这对现代电力系统的运行具有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信