二元/实数编码粒子群优化机组调度问题

K. Chandrasekaran, S. P. Simon
{"title":"二元/实数编码粒子群优化机组调度问题","authors":"K. Chandrasekaran, S. P. Simon","doi":"10.1109/EPSCICON.2012.6175240","DOIUrl":null,"url":null,"abstract":"This paper presents a new approach for binary and real coded particle swarm optimization (BRPSO) algorithm to solve the unit commitment problem (UCP). On solving UCP, the proposed binary coded PSO finds the ON/OFF status of the generating units while the economic dispatch problem (EDP) is solved using the real coded PSO. Tanh function is proposed to improve the particle searching mechanism in binary PSO. The proposed methodology is tested and validated on 3, 17, 26 and 38 generating unit system for 24 hour scheduling horizon. The effectiveness of the proposed technique is demonstrated by comparing its performance with the other methods reported in the literature.","PeriodicalId":143947,"journal":{"name":"2012 International Conference on Power, Signals, Controls and Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Binary/real coded particle swarm optimization for unit commitment problem\",\"authors\":\"K. Chandrasekaran, S. P. Simon\",\"doi\":\"10.1109/EPSCICON.2012.6175240\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new approach for binary and real coded particle swarm optimization (BRPSO) algorithm to solve the unit commitment problem (UCP). On solving UCP, the proposed binary coded PSO finds the ON/OFF status of the generating units while the economic dispatch problem (EDP) is solved using the real coded PSO. Tanh function is proposed to improve the particle searching mechanism in binary PSO. The proposed methodology is tested and validated on 3, 17, 26 and 38 generating unit system for 24 hour scheduling horizon. The effectiveness of the proposed technique is demonstrated by comparing its performance with the other methods reported in the literature.\",\"PeriodicalId\":143947,\"journal\":{\"name\":\"2012 International Conference on Power, Signals, Controls and Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Power, Signals, Controls and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EPSCICON.2012.6175240\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Power, Signals, Controls and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EPSCICON.2012.6175240","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

提出了一种求解机组承诺问题的二值实数编码粒子群优化算法(BRPSO)。在解决UCP问题时,提出的二进制编码粒子群求解发电机组的开/关状态,而实际编码粒子群求解经济调度问题(EDP)。为了改进二元粒子群算法中的粒子搜索机制,提出了Tanh函数。在3、17、26和38发电机组系统上进行了24小时调度水平的测试和验证。通过将其性能与文献中报道的其他方法进行比较,证明了所提出技术的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Binary/real coded particle swarm optimization for unit commitment problem
This paper presents a new approach for binary and real coded particle swarm optimization (BRPSO) algorithm to solve the unit commitment problem (UCP). On solving UCP, the proposed binary coded PSO finds the ON/OFF status of the generating units while the economic dispatch problem (EDP) is solved using the real coded PSO. Tanh function is proposed to improve the particle searching mechanism in binary PSO. The proposed methodology is tested and validated on 3, 17, 26 and 38 generating unit system for 24 hour scheduling horizon. The effectiveness of the proposed technique is demonstrated by comparing its performance with the other methods reported in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信