A new strategy based artificial bee colony algorithm for unit commitment problem

P. K. Singhal, R. Naresh, Veena Sharma, N. Kumar
{"title":"A new strategy based artificial bee colony algorithm for unit commitment problem","authors":"P. K. Singhal, R. Naresh, Veena Sharma, N. Kumar","doi":"10.1109/RDCAPE.2015.7281369","DOIUrl":null,"url":null,"abstract":"In this paper, a new strategy based artificial bee colony algorithm (DisABC) has been proposed that uses a new difference equation, which employs a measure of dissimilarity between two binary solutions of unit commitment problem (UCP) to generate the new binary solutions. Moreover, Economic dispatch (ED) sub-problem is carried out using lambda-iteration technique. Performance of DisABC is tested on 2 test systems comprising of 5-unit and 26-unit over the scheduling time horizon of 24 hours. Results are compared with those obtained in the reported techniques in the literature to solve the UCP which show better performance of the proposed approach.","PeriodicalId":403256,"journal":{"name":"2015 International Conference on Recent Developments in Control, Automation and Power Engineering (RDCAPE)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Recent Developments in Control, Automation and Power Engineering (RDCAPE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RDCAPE.2015.7281369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

In this paper, a new strategy based artificial bee colony algorithm (DisABC) has been proposed that uses a new difference equation, which employs a measure of dissimilarity between two binary solutions of unit commitment problem (UCP) to generate the new binary solutions. Moreover, Economic dispatch (ED) sub-problem is carried out using lambda-iteration technique. Performance of DisABC is tested on 2 test systems comprising of 5-unit and 26-unit over the scheduling time horizon of 24 hours. Results are compared with those obtained in the reported techniques in the literature to solve the UCP which show better performance of the proposed approach.
基于策略的人工蜂群算法求解机组承诺问题
本文提出了一种新的基于策略的人工蜂群算法(DisABC),该算法使用一种新的差分方程,该差分方程利用单元承诺问题(UCP)的两个二元解之间的不相似性度量来生成新的二元解。此外,采用lambda迭代技术求解了经济调度子问题。DisABC的性能在2个测试系统上进行了测试,包括5个单元和26个单元,调度时间为24小时。结果与文献中报道的解决UCP的方法的结果进行了比较,表明该方法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信