Unit commitment using gravitational search algorithm with holomorphic embedded approach

A. Shukla, J. Momoh, S. Singh
{"title":"Unit commitment using gravitational search algorithm with holomorphic embedded approach","authors":"A. Shukla, J. Momoh, S. Singh","doi":"10.1109/ISAP.2017.8071396","DOIUrl":null,"url":null,"abstract":"Volatility of load demand and electricity price has set a challenging task In the operational planning and controls of modem power system. Therefore, power utilities face challenge to serve the load demand at minimum operating cost by performing a proper scheduling of the generating units. To perform such a task, unit commitment plays a vital role and significant amount cost is saved per year. In this paper, Gravitational Search Algorithm (GSA) is utilized for Unit Commitment problem. Optimum scheduling of the generating units is obtained using GSA and Holomorphic Embedded Load Flow method for handling load flow operation, generators real power output and network losses for each time period. IEEE 30-bus systems is considered to check the performance of the proposed method and simulation results are compared to other techniques available in the literature.","PeriodicalId":257100,"journal":{"name":"2017 19th International Conference on Intelligent System Application to Power Systems (ISAP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 19th International Conference on Intelligent System Application to Power Systems (ISAP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAP.2017.8071396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Volatility of load demand and electricity price has set a challenging task In the operational planning and controls of modem power system. Therefore, power utilities face challenge to serve the load demand at minimum operating cost by performing a proper scheduling of the generating units. To perform such a task, unit commitment plays a vital role and significant amount cost is saved per year. In this paper, Gravitational Search Algorithm (GSA) is utilized for Unit Commitment problem. Optimum scheduling of the generating units is obtained using GSA and Holomorphic Embedded Load Flow method for handling load flow operation, generators real power output and network losses for each time period. IEEE 30-bus systems is considered to check the performance of the proposed method and simulation results are compared to other techniques available in the literature.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于全纯嵌入方法的引力搜索算法的单元承诺
负荷需求和电价的波动给现代电力系统的运行规划和控制提出了一项具有挑战性的任务。因此,如何以最小的运行成本来满足负荷需求,对发电机组进行合理的调度是电力公司面临的挑战。为了完成这样的任务,单位承诺起着至关重要的作用,每年节省大量的成本。本文将重力搜索算法(GSA)应用于机组投入问题。利用GSA和全纯嵌入式潮流法处理各时段的潮流运行、发电机实际输出功率和网损,得到发电机组的最优调度。考虑了IEEE 30总线系统来检查所提出方法的性能,并将仿真结果与文献中可用的其他技术进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design of a multi-agent system for distributed voltage regulation Machine learning versus ray-tracing to forecast irradiance for an edge-computing SkyImager Modified teaching-learning based optimization algorithm and damping of inter-area oscillations through VSC-HVDC Intelligent system for automatic performance evaluation of distribution system operators Methodology for islanding operation of distributed synchronous generators
×
引用
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