A Novel Fault Recovery Strategy for Future Distribution Network based on Multi-objective Particle Swarm Optimization Algorithm

Shu Liu, Xutong Hou, Chenxu Zhao, Liang Ji, Shuxin Tian, Xiangjing Su
{"title":"A Novel Fault Recovery Strategy for Future Distribution Network based on Multi-objective Particle Swarm Optimization Algorithm","authors":"Shu Liu, Xutong Hou, Chenxu Zhao, Liang Ji, Shuxin Tian, Xiangjing Su","doi":"10.1109/SPIES52282.2021.9633812","DOIUrl":null,"url":null,"abstract":"Fault recovery strategy plays a vital role in increasing the power system reliability and stability. The classic multi-objective evolutionary algorithm based on Pareto dominance criteria and crowding distance sorting method does not consider the preference of decision maker in the iterative process, which leads to the decline of convergence performance. For the problem, this paper proposes a novel fault recovery strategy based on the preference multi-objective particle swarm algorithm considering the reference vector. This method uses the reference vector to determine the preference area so as to effectively integrate the decision maker’s preference knowledge into the fault recovery plan design. As the multi-objective intelligence algorithm based on Pareto dominance does not consider the problem of decision-makers’ preference knowledge, the multi-objective discrete binary particle swarm algorithm is then introduced. Secondly, the individual solutions are selected through the v-dominance relationship according to the preferences of decision makers, and external files are maintained. Finally, the feasibility of the proposed method is verified through the 69-node distribution network.","PeriodicalId":411512,"journal":{"name":"2021 3rd International Conference on Smart Power & Internet Energy Systems (SPIES)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 3rd International Conference on Smart Power & Internet Energy Systems (SPIES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPIES52282.2021.9633812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Fault recovery strategy plays a vital role in increasing the power system reliability and stability. The classic multi-objective evolutionary algorithm based on Pareto dominance criteria and crowding distance sorting method does not consider the preference of decision maker in the iterative process, which leads to the decline of convergence performance. For the problem, this paper proposes a novel fault recovery strategy based on the preference multi-objective particle swarm algorithm considering the reference vector. This method uses the reference vector to determine the preference area so as to effectively integrate the decision maker’s preference knowledge into the fault recovery plan design. As the multi-objective intelligence algorithm based on Pareto dominance does not consider the problem of decision-makers’ preference knowledge, the multi-objective discrete binary particle swarm algorithm is then introduced. Secondly, the individual solutions are selected through the v-dominance relationship according to the preferences of decision makers, and external files are maintained. Finally, the feasibility of the proposed method is verified through the 69-node distribution network.
基于多目标粒子群优化算法的未来配电网故障恢复策略
故障恢复策略对提高电力系统的可靠性和稳定性起着至关重要的作用。经典的基于Pareto优势准则和拥挤距离排序法的多目标进化算法在迭代过程中没有考虑决策者的偏好,导致收敛性能下降。针对这一问题,提出了一种考虑参考向量的基于偏好多目标粒子群算法的故障恢复策略。该方法利用参考向量确定偏好区域,从而有效地将决策者的偏好知识融入到故障恢复计划设计中。针对基于Pareto优势的多目标智能算法没有考虑决策者偏好知识的问题,引入了多目标离散二元粒子群算法。其次,根据决策者的偏好,通过v-优势关系选择个体解决方案,并维护外部文件;最后,通过69节点配电网验证了所提方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信