检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学电子与信息工程系,湖北武汉430074
出 处:《水电能源科学》2009年第2期194-197,共4页Water Resources and Power
基 金:国家自然科学基金资助项目(70271069)
摘 要:针对目前配电网络重构基本遗传算法GA易发生早熟、非全局收敛及收敛速度慢等问题,提出了一种基于改进自适应GA配网重构方法,将最优保存策略和两两竞争相结合的方法作为新选择操作数,采用随最优个体相对保留代数自适应变化交叉和变异操作数,将最优个体最少保留代数作为算法终止条件。算例结果表明,该法全局搜索能力强、收敛速度快,为配电网络重构寻优奠定了理论基础。A new network reconfiguration method based on improved adaptive genetic algorithm was given in order to deal with some problems which include precocious or non-global convergence or slow convergence when old genetic algorithm was applied in the network reconfiguration. The improvement of the algorithm was made that put the combination of optimal preservation strategy and competitions as a new options operator, adopted cross-operator and variation operator changed with the relative retention algebra the optimal individual adaptively, put least reservation generations of the optimum individual as algorithm termination conditions. The result shows that the improved algorithm has good global search ability and rapid convergence rate, whichlays a theoretical foundation for global optimization problem of the distribution network reconfiguration.
分 类 号:TM711[电气工程—电力系统及自动化] TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.238.90