基于改进量子离散粒子群算法的无功优化

Shuqi Li, Dong-mei Zhao, Xu Zhang, Chao Wang
{"title":"基于改进量子离散粒子群算法的无功优化","authors":"Shuqi Li, Dong-mei Zhao, Xu Zhang, Chao Wang","doi":"10.1109/CRIS.2010.5617552","DOIUrl":null,"url":null,"abstract":"The function of reactive power optimization (RPO)is to realize the reactive power of the electric fence and optimal control of voltage in order that the whole network's operation level can be improved and the loss of operation of power network can be reduced. Recently, the research of ORP is mainly focus on the handling of non-liner function and discrete variables and the convergence of the algorithm, which is the key and difficult point of the current research. quantum discrete PSO algorithm, which is applied to reactive power and voltage optimization control of electric power system, has great effect of searching relevance and coverage. However, the premature convergence problem will be appeared probably. In order to prevent some stagnations of the particles in the iteration, a method to improve quantum discrete particle swarm optimization(quantum discrete PSO)is proposed in this paper. Combined with the quantum discrete PSO Algorithm and chaotic optimization method, the global optimal positions which are found in the iteration of the quantum discrete PSO can reach the chaos optimization. By this, the result is randomly substituted for the position of a particle and continued iteration. The simulation results of some IEEE systems and an actual power network show that the method is characterized by the convergent speed greatly and good global search capability.","PeriodicalId":206094,"journal":{"name":"2010 5th International Conference on Critical Infrastructure (CRIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Reactive power optimization based on an improved quantum discrete PSO algorithm\",\"authors\":\"Shuqi Li, Dong-mei Zhao, Xu Zhang, Chao Wang\",\"doi\":\"10.1109/CRIS.2010.5617552\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The function of reactive power optimization (RPO)is to realize the reactive power of the electric fence and optimal control of voltage in order that the whole network's operation level can be improved and the loss of operation of power network can be reduced. Recently, the research of ORP is mainly focus on the handling of non-liner function and discrete variables and the convergence of the algorithm, which is the key and difficult point of the current research. quantum discrete PSO algorithm, which is applied to reactive power and voltage optimization control of electric power system, has great effect of searching relevance and coverage. However, the premature convergence problem will be appeared probably. In order to prevent some stagnations of the particles in the iteration, a method to improve quantum discrete particle swarm optimization(quantum discrete PSO)is proposed in this paper. Combined with the quantum discrete PSO Algorithm and chaotic optimization method, the global optimal positions which are found in the iteration of the quantum discrete PSO can reach the chaos optimization. By this, the result is randomly substituted for the position of a particle and continued iteration. The simulation results of some IEEE systems and an actual power network show that the method is characterized by the convergent speed greatly and good global search capability.\",\"PeriodicalId\":206094,\"journal\":{\"name\":\"2010 5th International Conference on Critical Infrastructure (CRIS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 5th International Conference on Critical Infrastructure (CRIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CRIS.2010.5617552\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International Conference on Critical Infrastructure (CRIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CRIS.2010.5617552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

无功优化(RPO)的作用是实现电网的无功功率和电压的最优控制,以提高整个电网的运行水平,减少电网的运行损失。目前,ORP的研究主要集中在非线性函数和离散变量的处理以及算法的收敛性上,这是当前研究的重点和难点。将量子离散粒子群算法应用于电力系统的无功电压优化控制中,具有很强的搜索相关性和覆盖效果。但也有可能出现过早收敛的问题。为了防止粒子在迭代过程中出现停滞现象,提出了一种改进的量子离散粒子群优化方法。将量子离散粒子群算法与混沌优化方法相结合,在量子离散粒子群算法的迭代过程中找到全局最优位置,达到混沌优化的目的。这样,将结果随机替换为粒子的位置并继续迭代。对部分IEEE系统和实际电网的仿真结果表明,该方法具有收敛速度快、全局搜索能力强的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reactive power optimization based on an improved quantum discrete PSO algorithm
The function of reactive power optimization (RPO)is to realize the reactive power of the electric fence and optimal control of voltage in order that the whole network's operation level can be improved and the loss of operation of power network can be reduced. Recently, the research of ORP is mainly focus on the handling of non-liner function and discrete variables and the convergence of the algorithm, which is the key and difficult point of the current research. quantum discrete PSO algorithm, which is applied to reactive power and voltage optimization control of electric power system, has great effect of searching relevance and coverage. However, the premature convergence problem will be appeared probably. In order to prevent some stagnations of the particles in the iteration, a method to improve quantum discrete particle swarm optimization(quantum discrete PSO)is proposed in this paper. Combined with the quantum discrete PSO Algorithm and chaotic optimization method, the global optimal positions which are found in the iteration of the quantum discrete PSO can reach the chaos optimization. By this, the result is randomly substituted for the position of a particle and continued iteration. The simulation results of some IEEE systems and an actual power network show that the method is characterized by the convergent speed greatly and good global search capability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信