检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张志刚[1] 江渝[1] 任静[2] 王恒[1] 黄敏[1]
机构地区:[1]输配电装备及系统安全与新技术国家重点实验室(重庆大学),重庆市沙坪坝区400044 [2]重庆大学自动化学院,重庆市沙坪坝区400044
出 处:《电网技术》2012年第5期232-238,共7页Power System Technology
基 金:国家自然科学基金项目(50777066)~~
摘 要:提出了一种基于均匀设计的免疫克隆无功优化算法。该方法将初始种群均匀地分布在解空间中,使初始种群更多地表征解空间的信息,这样有利于在降低种群规模的同时保持种群多样性,有效提高算法的计算效率。提出了一种基于"距离"的疫苗接种策略,按照"距离"从大到小的原则确定接种位,有效地避免了"接种浪费";引入克隆算法的高频变异操作,对每一代的最优个体进行邻域搜索,提高算法的局部搜索能力。对IEEE 30节点和IEEE 57节点系统进行仿真表明:该算法在种群规模较小的情况下依然具有计算效率高、收敛性好等优点,适合求解电力系统无功优化问题。A uniform design based immune clone algorithm for reactive power optimization is proposed, which distributes initial population in solution space uniformly to make the initial population characterizing more information of solution space, thus it is favorable to maintain population diversity while the scale of initial population is reduced and the calculation efficiency can be effectively improved. A vaccine inoculation strategy based on the distance is put forward, namely the positions for vaccine inoculation are determined according to the ordering from long distance to short distance by judging the distances between the positions of inoculated gene individuals and the positions of the vaccine, so the waste of inoculation can be avoided; a hyper-mutation operation ofclone is led in and the neighbor search for optimal individuals of all generations is performed to improve the local search ability of the proposed algorithm. Simulation results of IEEE 30-bus system and IEEE 57-bus system show that even under the condition of smaller population scale the proposed algorithm still possesses such merits as high computational efficiency and good convergence, so it is suitable to solve the problem of power system reactive power optimization problem.
关 键 词:电力系统 均匀设计 “距离”接种策略 克隆变异算子 无功优化
分 类 号:TM72[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249