基于进化规划的线流约束经济调度

P. Somasundaram, K. Kuppusamy, R. Devi
{"title":"基于进化规划的线流约束经济调度","authors":"P. Somasundaram, K. Kuppusamy, R. Devi","doi":"10.1142/S1465876304002277","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient, simple and new method for solving Economic Dispatch (ED) problem with line flow constraints through the application of Evolutionary Programming (EP). The controllable system quantities in the base-case state are optimized to minimize some defined objective function subject to the base-case operating constraints. A 10-bus system is taken for investigation. The ED results obtained using EP are compared with those obtained using quadratic programming. The investigations reveal that the proposed algorithm is relatively simple, reliable, efficient and suitable for on-line applications.","PeriodicalId":331001,"journal":{"name":"Int. J. Comput. Eng. Sci.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Evolutionary programming based economic dispatch with line flow constraints\",\"authors\":\"P. Somasundaram, K. Kuppusamy, R. Devi\",\"doi\":\"10.1142/S1465876304002277\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an efficient, simple and new method for solving Economic Dispatch (ED) problem with line flow constraints through the application of Evolutionary Programming (EP). The controllable system quantities in the base-case state are optimized to minimize some defined objective function subject to the base-case operating constraints. A 10-bus system is taken for investigation. The ED results obtained using EP are compared with those obtained using quadratic programming. The investigations reveal that the proposed algorithm is relatively simple, reliable, efficient and suitable for on-line applications.\",\"PeriodicalId\":331001,\"journal\":{\"name\":\"Int. J. Comput. Eng. Sci.\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Comput. Eng. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S1465876304002277\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Comput. Eng. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S1465876304002277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文提出了一种利用进化规划方法求解线路流约束下的经济调度问题的有效、简便的新方法。在基本情况运行约束下,对基本情况状态下的可控系统量进行优化,使某些已定义的目标函数最小化。以10路公交系统为研究对象。并与二次规划的结果进行了比较。研究表明,该算法简单、可靠、高效,适合在线应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evolutionary programming based economic dispatch with line flow constraints
This paper presents an efficient, simple and new method for solving Economic Dispatch (ED) problem with line flow constraints through the application of Evolutionary Programming (EP). The controllable system quantities in the base-case state are optimized to minimize some defined objective function subject to the base-case operating constraints. A 10-bus system is taken for investigation. The ED results obtained using EP are compared with those obtained using quadratic programming. The investigations reveal that the proposed algorithm is relatively simple, reliable, efficient and suitable for on-line applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信