检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋坤隆 谢云云[1] 殷明慧[1] 邹云[1] 周前[2] 汪成根[2]
机构地区:[1]南京理工大学自动化学院,江苏省南京市210094 [2]江苏省电力公司电力科学研究院,江苏省南京市211103
出 处:《电网技术》2017年第7期2300-2307,共8页Power System Technology
基 金:国家自然科学基金资助项目(51507080;61673213);江苏省博士后基金资助项目(1402042C)~~
摘 要:在停电系统恢复路径优化中,智能算法因具有较好的寻优性能而得到广泛的应用。以线路状态为编码的恢复路径智能优化方法,由于迭代过程中的随机性,新生成个体中非连通个体比重非常大,影响了寻优效率。对此,已有研究提出了对非连通个体进行修正的思路和方法,但新增连通性修正环节也会增加每一步迭代的运算时间,而加快该环节将有助于提高恢复路径优化的寻优速度。为此,考虑到在迭代过程中新生成个体的投运线路数量和平均非连通区域数较少的特点,提出了基于凝聚层次聚类法和Prim算法的连通性修正算法,使非连通个体更快速修正为连通个体,在保证寻优结果精度的基础上提高智能算法计算速度。最后,以遗传算法为例,IEEE标准系统的多组仿真算例验证了所提方法的有效性。Intelligent algorithm is widely used in optimization of restoration paths due to its excellent capability. Because of its randomness with line state encoding, most new population generated in the process is non-connective. It is essential to improve its optimization efficiency. Although thought and method of connectivity rectification for non-connective individuals are introduced in existing research, correcting non-connective individuals is very time consuming. A quick connectivity rectification method can contribute to speed up optimizing speed of restoration paths. Considering the characteristics that number of operation lines with state "1" and partial connection sections for non-connective individuals generated in iterative process is few, in order to further enhance correcting speed for non-connective individuals, a rectification method based on agglomerative hierarchical clustering algorithm and Prim algorithm was proposed. In premise of accuracy assurance, the non-connective individuals are corrected rapidly. Finally, taking genetic algorithm as an example, IEEE test systems were used for validation of the proposed method.
分 类 号:TM914[电气工程—电力电子与电力传动]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43