Invasive weed optimization algorithm for solving economic load dispatch

M. Nagib, Mahmoud M. Othman, Adel A. Naiem, Y. Hegazy
{"title":"Invasive weed optimization algorithm for solving economic load dispatch","authors":"M. Nagib, Mahmoud M. Othman, Adel A. Naiem, Y. Hegazy","doi":"10.1109/EEEIC.2016.7555491","DOIUrl":null,"url":null,"abstract":"The economic load dispatch problem is an online optimization problem to calculate the minimal fuel cost for each power generator under load constraints. At first, the classical methods such as lambda iteration and non-linear programming were used to solve the economic load dispatch problem. Although of their accuracy, these methods are time consuming. Meta-heuristic algorithms such as Particle swarm optimization, Ant colony and Genetic algorithms give better solution while their running time is longer. The hybrid models, by combining two different algorithms, were experimented to get benefits of both mentioned methods. In this paper, a novel algorithm based on invasive weed optimization method is used to solve the economic load dispatch problem under generation and load constraints in order to overcome drawbacks of previous techniques. The proposed algorithm is implemented in MATLAB environment and tested on a 3-units power system. Different test cases are proposed and the results show the efficiency and accuracy of the proposed algorithm in solving the economic dispatch problem.","PeriodicalId":246856,"journal":{"name":"2016 IEEE 16th International Conference on Environment and Electrical Engineering (EEEIC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 16th International Conference on Environment and Electrical Engineering (EEEIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EEEIC.2016.7555491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The economic load dispatch problem is an online optimization problem to calculate the minimal fuel cost for each power generator under load constraints. At first, the classical methods such as lambda iteration and non-linear programming were used to solve the economic load dispatch problem. Although of their accuracy, these methods are time consuming. Meta-heuristic algorithms such as Particle swarm optimization, Ant colony and Genetic algorithms give better solution while their running time is longer. The hybrid models, by combining two different algorithms, were experimented to get benefits of both mentioned methods. In this paper, a novel algorithm based on invasive weed optimization method is used to solve the economic load dispatch problem under generation and load constraints in order to overcome drawbacks of previous techniques. The proposed algorithm is implemented in MATLAB environment and tested on a 3-units power system. Different test cases are proposed and the results show the efficiency and accuracy of the proposed algorithm in solving the economic dispatch problem.
求解经济负荷调度的入侵杂草优化算法
经济负荷调度问题是在负荷约束下计算每台发电机组最小燃料成本的在线优化问题。首先采用lambda迭代和非线性规划等经典方法求解经济负荷调度问题。这些方法虽然准确,但耗时长。粒子群算法、蚁群算法和遗传算法等元启发式算法的求解效果较好,但运行时间较长。结合两种不同的算法,对混合模型进行了实验,得到了两种方法的优点。本文提出了一种基于入侵杂草优化方法的新算法,用于解决发电和负荷约束下的经济负荷调度问题,克服了以往技术的不足。该算法在MATLAB环境下实现,并在三台电力系统上进行了测试。给出了不同的测试用例,结果表明了该算法在解决经济调度问题方面的有效性和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信