基于迁移和优序加载的约束经济调度微遗传算法

W. Ongsakul, J. Tippayachai
{"title":"基于迁移和优序加载的约束经济调度微遗传算法","authors":"W. Ongsakul, J. Tippayachai","doi":"10.1109/DRPT.2000.855717","DOIUrl":null,"url":null,"abstract":"In this paper, a micro genetic algorithm based on migration and merit order loading solutions (MGAM-MOL) for solving the ramp rate constrained economic dispatch (ED) problems for combined cycle (CC) units with linear decreasing and staircase incremental cost (IC) functions is proposed. MGAM-MOL uses a merit order loading (MOL) solution as a base solution in order to reduce the micro genetic algorithm (MGA) search effort towards the optimal solution region. As transmission losses are included, the solutions are near the optimal solutions and are less expensive than those obtained from MGA, simple genetic algorithm (SGA), and MOLs especially for a large number of CC units, thereby leading to substantial fuel cost savings. Moreover, MGAM-MOL can easily facilitate the parallel implementation to reduce the computing expenses without sacrificing the quality of the solution.","PeriodicalId":127287,"journal":{"name":"DRPT2000. International Conference on Electric Utility Deregulation and Restructuring and Power Technologies. Proceedings (Cat. No.00EX382)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Constrained economic dispatch by micro genetic algorithm based on migration and merit order loading solutions\",\"authors\":\"W. Ongsakul, J. Tippayachai\",\"doi\":\"10.1109/DRPT.2000.855717\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a micro genetic algorithm based on migration and merit order loading solutions (MGAM-MOL) for solving the ramp rate constrained economic dispatch (ED) problems for combined cycle (CC) units with linear decreasing and staircase incremental cost (IC) functions is proposed. MGAM-MOL uses a merit order loading (MOL) solution as a base solution in order to reduce the micro genetic algorithm (MGA) search effort towards the optimal solution region. As transmission losses are included, the solutions are near the optimal solutions and are less expensive than those obtained from MGA, simple genetic algorithm (SGA), and MOLs especially for a large number of CC units, thereby leading to substantial fuel cost savings. Moreover, MGAM-MOL can easily facilitate the parallel implementation to reduce the computing expenses without sacrificing the quality of the solution.\",\"PeriodicalId\":127287,\"journal\":{\"name\":\"DRPT2000. International Conference on Electric Utility Deregulation and Restructuring and Power Technologies. Proceedings (Cat. No.00EX382)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DRPT2000. International Conference on Electric Utility Deregulation and Restructuring and Power Technologies. Proceedings (Cat. No.00EX382)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DRPT.2000.855717\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DRPT2000. International Conference on Electric Utility Deregulation and Restructuring and Power Technologies. Proceedings (Cat. No.00EX382)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRPT.2000.855717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

本文提出了一种基于迁移和优序加载解的微遗传算法,用于求解具有线性递减和阶梯增量成本函数的联合循环机组的斜坡率约束经济调度问题。为了减少微遗传算法(MGA)向最优解区域搜索的工作量,MGAM-MOL采用了一种优序加载(merit order loading, MOL)解作为基本解。考虑到传输损失,该方法接近于最优解,并且比MGA、简单遗传算法(SGA)和MOLs方法更便宜,特别是对于大量CC单元,从而大大节省了燃料成本。此外,MGAM-MOL可以很容易地促进并行实现,在不牺牲解决方案质量的情况下降低计算费用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Constrained economic dispatch by micro genetic algorithm based on migration and merit order loading solutions
In this paper, a micro genetic algorithm based on migration and merit order loading solutions (MGAM-MOL) for solving the ramp rate constrained economic dispatch (ED) problems for combined cycle (CC) units with linear decreasing and staircase incremental cost (IC) functions is proposed. MGAM-MOL uses a merit order loading (MOL) solution as a base solution in order to reduce the micro genetic algorithm (MGA) search effort towards the optimal solution region. As transmission losses are included, the solutions are near the optimal solutions and are less expensive than those obtained from MGA, simple genetic algorithm (SGA), and MOLs especially for a large number of CC units, thereby leading to substantial fuel cost savings. Moreover, MGAM-MOL can easily facilitate the parallel implementation to reduce the computing expenses without sacrificing the quality of the solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Degeneracy and duality gap on optimization-based electricity auctions Evaluation of the Romanian electricity industry restructuring process in comparison with the experience in the United Kingdom The use of tangent vectors for voltage collapse analysis Study of interrelations between electric power systems and large consumers in Russia Short-term investment scheduling in transmission power systems by evolutionary computation
×
引用
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