最小代价机组承诺问题的改进遗传算法

S. Jalilzadeh, Y. Pirhayati
{"title":"最小代价机组承诺问题的改进遗传算法","authors":"S. Jalilzadeh, Y. Pirhayati","doi":"10.1109/ICICISYS.2009.5357777","DOIUrl":null,"url":null,"abstract":"In this paper an Improved Genetic Algorithm (IGA) for unit commitment problem with lowest cost is presented. The unit commitment problem (UCP) has an important role in power systems, due to improvement of commitment schedules results in the reduction of operating costs. However, the unit commitment problem is one of the most difficult optimization problems in power systems, because this problem has many constraints. Moreover, search space is vast. To overcome these problems, a genetic operator based on unit characteristic classification technique are proposed. From simulation results, better solutions are obtained in comparison with previously reported results.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"An Improved Genetic Algorithm for unit commitment problem with lowest cost\",\"authors\":\"S. Jalilzadeh, Y. Pirhayati\",\"doi\":\"10.1109/ICICISYS.2009.5357777\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper an Improved Genetic Algorithm (IGA) for unit commitment problem with lowest cost is presented. The unit commitment problem (UCP) has an important role in power systems, due to improvement of commitment schedules results in the reduction of operating costs. However, the unit commitment problem is one of the most difficult optimization problems in power systems, because this problem has many constraints. Moreover, search space is vast. To overcome these problems, a genetic operator based on unit characteristic classification technique are proposed. From simulation results, better solutions are obtained in comparison with previously reported results.\",\"PeriodicalId\":206575,\"journal\":{\"name\":\"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICISYS.2009.5357777\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICISYS.2009.5357777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

本文提出了一种求解成本最低的机组承诺问题的改进遗传算法(IGA)。机组承诺问题(UCP)在电力系统中具有重要的作用,因为机组承诺计划的改进可以降低运行成本。然而,机组承诺问题是电力系统中最困难的优化问题之一,因为该问题有许多约束条件。此外,搜索空间是巨大的。为了克服这些问题,提出了一种基于单元特征分类技术的遗传算子。仿真结果与以往报道的结果相比,得到了更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Genetic Algorithm for unit commitment problem with lowest cost
In this paper an Improved Genetic Algorithm (IGA) for unit commitment problem with lowest cost is presented. The unit commitment problem (UCP) has an important role in power systems, due to improvement of commitment schedules results in the reduction of operating costs. However, the unit commitment problem is one of the most difficult optimization problems in power systems, because this problem has many constraints. Moreover, search space is vast. To overcome these problems, a genetic operator based on unit characteristic classification technique are proposed. From simulation results, better solutions are obtained in comparison with previously reported results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem An intelligent model selection scheme based on particle swarm optimization A novel blind watermark algorithm based On SVD and DCT Optimization of machining parameters using estimation of distribution algorithms Optimal control analysis on a class of hybrid systems with impulses and switches
×
引用
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