Application of ACSA for solving multi-objective optimal power flow problem with load uncertainty

B. Rao, K. Vaisakh
{"title":"Application of ACSA for solving multi-objective optimal power flow problem with load uncertainty","authors":"B. Rao, K. Vaisakh","doi":"10.1109/ICE-CCN.2013.6528607","DOIUrl":null,"url":null,"abstract":"This paper presents a multi-objective adaptive Clonal selection algorithm (MOACSA) for solving optimal power flow (OPF) problem. OPF problem is formulated as a non-linear constrained multi-objective optimization problem in which different objectives and various constraints have been considered. Fast elitist non-dominated sorting and crowding distance techniques have been used to find and manage the Pareto optimal front. Finally, a fuzzy based mechanism has been used to select a best compromise solution from the Pareto set. The proposed MOACS algorithm has been tested on IEEE 30-bus test system with different objectives such as cost, loss and L-index. Simulation studies are carried out under both normal load and load uncertainty conditions for multi-objective optimal power flow problem with different cases. The results obtained with normal load condition are also compared with fast non-dominated sorting genetic algorithm (NSGA-II), multi-objective harmony search algorithm (MOHS) and multi-objective differential evolutionary algorithm (MODE) methods which are available in the literature.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICE-CCN.2013.6528607","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

This paper presents a multi-objective adaptive Clonal selection algorithm (MOACSA) for solving optimal power flow (OPF) problem. OPF problem is formulated as a non-linear constrained multi-objective optimization problem in which different objectives and various constraints have been considered. Fast elitist non-dominated sorting and crowding distance techniques have been used to find and manage the Pareto optimal front. Finally, a fuzzy based mechanism has been used to select a best compromise solution from the Pareto set. The proposed MOACS algorithm has been tested on IEEE 30-bus test system with different objectives such as cost, loss and L-index. Simulation studies are carried out under both normal load and load uncertainty conditions for multi-objective optimal power flow problem with different cases. The results obtained with normal load condition are also compared with fast non-dominated sorting genetic algorithm (NSGA-II), multi-objective harmony search algorithm (MOHS) and multi-objective differential evolutionary algorithm (MODE) methods which are available in the literature.
ACSA在求解负荷不确定多目标最优潮流问题中的应用
提出了一种求解最优潮流问题的多目标自适应克隆选择算法。将OPF问题表述为考虑不同目标和各种约束的非线性约束多目标优化问题。快速精英非支配排序和拥挤距离技术被用于寻找和管理Pareto最优前沿。最后,利用一种基于模糊的机制从Pareto集合中选择最优妥协解。本文提出的MOACS算法已在IEEE 30总线测试系统上进行了测试,测试目标包括成本、损耗和l指数。针对多目标最优潮流问题,分别在正常负荷和负荷不确定两种情况下进行了仿真研究。并将正常负载条件下的结果与文献中已有的快速非支配排序遗传算法(NSGA-II)、多目标和谐搜索算法(MOHS)和多目标差分进化算法(MODE)方法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信