基于改进人口迁移算法的输电网扩展规划  

Transmission Expansion Planning Based on Modified Population Migrant Algorithm

作　　者：李如琦[1] 陈铁洲[1] 邓国良[1] 苏浩益[1] 

机构地区：[1]广西大学,广西南宁530004

出　　处：《广西电力》2011年第2期1-4,32,共5页Guangxi Electric Power

摘　　要：输电网扩展规划是一个非常复杂的大规模组合优化问题,对比提出了一种改进人口迁移算法的求解方法。标准人口迁移算法在求解过程中搜索容易陷入局部最优解和后期收敛时间较长等问题,针对以上缺点,对算法的迭代初始化、种群生成策略以及参数设置进行了改进,将遗传算法的最优保留思想引入到算法中,提高了算法搜索全局最优解的能力与收敛到最优解的速度,使其更适用于输电网扩展规划。将改进后的算法应用到单阶段输电网扩展规划中,建立了输电网扩展规划的数学模型,设计了相应的算法。通过本算法与粒子群算法、标准人口迁移算法对Garver-6节点系统和Garver-18节点系统进行仿真计算比较,结果证明改进人口迁移算法具有灵活性和有效性。Transmission expansion planning is a very complicated large scale optimal combination problem, so a solution method based on modified population migrant algorithm is proposed. Standard population migrant algorithm has its problems such as easily getting struck at local optimal solutions and having long calculation time in later period of convergence. So the alternation initialization, group generation strategy and parameters setup of the algorithm is modified and the optimal reservation idea in genetic algorithm is added in the algorithm, which improve the searching ability for global optimal solution and the speed converging to optimal solution and thus is more suitable to transmission expansion planning. The modified algorithm is applied in one stage transmission expansion planning, the mathematic model is built and the algorithm is designed. Simulation results are compared with the proposed algorithm, the particle swarm algorithm, and the standard population migrant algorithm based on Garver-6 and Garver-18 power systems, which show that the proposed algorithm is flexible and effective.

关 键 词：电力系统 输电网扩展规划 人口迁移算法 最优保留 随机搜索 

分 类 号：TM715[电气工程—电力系统及自动化]