Unit Commitment Problem Using An Efficient PSO Based Algorithm

Yu Zhai, Nankun Mu, X. Liao, Junqing Le, Tingwen Huang
{"title":"Unit Commitment Problem Using An Efficient PSO Based Algorithm","authors":"Yu Zhai, Nankun Mu, X. Liao, Junqing Le, Tingwen Huang","doi":"10.1109/ICACI.2019.8778557","DOIUrl":null,"url":null,"abstract":"Electric generators consume most of the world's fossil energy in power plant. In power plants, better solving unit commitment problem (UCP) means saving more fossil energy. Nowadays, most of the algorithms to solve the UCP cannot get good results, so it is necessary to study more efficient algorithms. Towards this end, this paper presents a novel algorithm to solve UCP. The proposed algorithm combines particle swarm optimization and simulated annealing algorithm to solve UCP better. At the same time, a convex optimization algorithm is proposed to solve the corresponding economic load distribution problem. We have done a lot of experiments to prove the advantage of this algorithm, which can solve UCP efficiently.","PeriodicalId":213368,"journal":{"name":"2019 Eleventh International Conference on Advanced Computational Intelligence (ICACI)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Eleventh International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI.2019.8778557","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Electric generators consume most of the world's fossil energy in power plant. In power plants, better solving unit commitment problem (UCP) means saving more fossil energy. Nowadays, most of the algorithms to solve the UCP cannot get good results, so it is necessary to study more efficient algorithms. Towards this end, this paper presents a novel algorithm to solve UCP. The proposed algorithm combines particle swarm optimization and simulated annealing algorithm to solve UCP better. At the same time, a convex optimization algorithm is proposed to solve the corresponding economic load distribution problem. We have done a lot of experiments to prove the advantage of this algorithm, which can solve UCP efficiently.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于高效粒子群算法的机组承诺问题
发电机消耗了世界上大部分发电厂的化石能源。在发电厂,更好地解决机组承诺问题(UCP)意味着节约更多的化石能源。目前,大多数求解UCP的算法都不能得到很好的结果,因此有必要研究更高效的算法。为此,本文提出了一种求解UCP的新算法。该算法结合粒子群算法和模拟退火算法,较好地解决了UCP问题。同时,提出了一种凸优化算法来解决相应的经济负荷分配问题。我们做了大量的实验来证明该算法的优势,可以有效地解决UCP问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fault Diagnosis Method of Wind Turbine Bearing Based on Improved Intrinsic Time-scale Decomposition and Spectral Kurtosis Stage Actor Tracking Method Based on Kalman Filter Parameter Identification, Verification and Simulation of the CSD Transport Process A 2D Observation Model-Based Algorithm for Blind Single Image Super-Resolution Reconstruction A Deep Residual Networks Accelerator on FPGA
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1