检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李如琦[1] 陈铁洲[1] 邓国良[1] 苏浩益[1]
出 处:《广东电力》2010年第12期8-12,49,共6页Guangdong Electric Power
摘 要:提出了一种改进人口迁移算法求解输电网扩展规划的大规模组合优化问题。针对标准人口迁移算法在求解过程中搜索容易陷入局部最优解和后期收敛时间较长等缺点,对算法的迭代初始化、种群生成策略以及参数设置进行了改进,将遗传算法的最优保留思想引入到算法中,提高了算法搜索全局最优解的能力与收敛到最优解的速度。将改进后的算法应用到满足"N-1"安全准则的输电网扩展规划问题中,建立了输电网扩展规划的数学模型,设计了相应的算法。比较该算法与粒子群算法、标准人口迁移算法对IEEE Garver6节点系统和IEEE Garver18节点系统的仿真计算结果,证明了改进人口迁移算法能有效地解决满足"N-1"安全检验的输电网扩展规划优化问题。In this paper,the improved population migration algorithm for solving large-scale combinatorial optimization problems of transmission line expansion plan is proposed.In connection with disadvantages such as the easiness of search to lapse into local optimal solution during solving process of standard population migration algorithm and long convergence time in later period and so forth,iteration initialization,population producing strategy and parameter setting get upturned,and the introduction of optimal reservation concept into the algorithm increases capability of searching global optimal solution and speed of convergence to optimal solution.The improved algorithm is applied to transmission network expansion planning catering for N-1 security criterion,mathematical model for transmission network expansion planning is established and the corresponding algorithm is devised.The IEEE Garver 6 node system and IEEE Garver 18 node system are compared via simulation calculation results by this algorithm,particle swam algorithm,standard population algorithm.It is demonstrated that improved population migration algorithm can effectively cope with the optimization of transmission network planning catering for N-1 security inspection.
关 键 词:电力系统 输电网扩展规划 “N-1”安全准则 人口迁移算法 最优保留 随机搜索
分 类 号:TM715[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.56