检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:寇攀高[1] 周建中[1] 何耀耀[1] 向秀桥[1] 李超顺[1]
机构地区:[1]华中科技大学水电与数字化工程学院,湖北省武汉市430074
出 处:《中国电机工程学报》2009年第26期101-106,共6页Proceedings of the CSEE
基 金:国家自然科学基金项目(50539140);"十一五"国家科技支撑计划重大项目(2008BAB29B08);科技部水利部公益性行业科研专项(200701008)~~
摘 要:为解决水轮发电机组调速器PID参数优化问题,引入菌群优化(bacterial foraging optimization,BFO)算法。考虑到BFO算法收敛速度慢,而粒子群优化(paticle swarm optimization,PSO)算法具有较好的收敛性,提出BFO-PSO算法。以描述菌体间相互吸引、相互排斥、相互学习的Jcc指标与综合ITAE指标之和构成一种新型适应度函数。数值计算结果表明:与BFO算法、PSO算法相比,BFO-PSO算法收敛速度快,能有效改善水轮机调节系统空载工况和孤网运行条件下过渡过程的动态性能。To improve the quality of PID parameters of the turbine governor, bacterial foraging optimization (BFO) algorithm was introduced. Considering the slow convergence of BFO algorithm and the good convergence of particle swarm optimization (PSO) algorithm, a novel method named BFO- PSO algorithm was proposed. The integrated ITAE index plus the J^c index which weights the interaction between bacterial cells constitutes a new type of fitness function, which can reflect the effect of bacterial swarm's mutual attraction, mutual repellence and mutual learning. Through numerical experiments, it's found that compared to the classic BFO algorithm and the classic PSO algorithm, BFO-PSO algorithm converges faster and can effectively improve the dynamic performance of the hydraulic turbine governing system transients on no-load and isolated operation conditions.
关 键 词:菌群优化算法 粒子群优化算法 水轮发电机组 PID参数优化
分 类 号:TM612[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229