首页 | 本学科首页   官方微博 | 高级检索  
     

基于最短路算法和遗传算法的配电网络重构
引用本文:余贻鑫,段刚.基于最短路算法和遗传算法的配电网络重构[J].中国电机工程学报,2000,20(9):44-49.
作者姓名:余贻鑫  段刚
作者单位:天津大学电力系,天津市,300072
摘    要:提出了通过组合负荷实现寻优的重构方法。利用最短路径法按照某一顺序为每个负荷分别寻找供电路径,然后利用遗传算法选择最优的负荷排列顺序,从而实现在局部最优解中寻求全局最优解。通过将容量约束和电压约束转换成弧的权值,在网络形成的过程中就考虑这些约束,从而进一步保证了该算法高效地找到全局优化解。此方法很容易实现树状约束,并对多环的复杂结构网络也能高效地实现重构寻优。

关 键 词:配电网络重构  最短路算法  遗传算法  全局优化
修稿时间:1999-09-09

SHORTEST PATH ALGORITHM AND GENETIC ALGORITHM BASED DISTRIBUTION SYSTEM RECONFIGURATION
YU Yi-xin,DUAN Gang.SHORTEST PATH ALGORITHM AND GENETIC ALGORITHM BASED DISTRIBUTION SYSTEM RECONFIGURATION[J].Proceedings of the CSEE,2000,20(9):44-49.
Authors:YU Yi-xin  DUAN Gang
Abstract:A distribution system reconfiguration method, named shortest path genetic algorithm, is presented, which optimizes a network by ordering the loads instead of combining the branches or switches. A method based on shortest path algorithm is used to search the optimal power supply paths for a series of loads one by one, while genetic algorithm is used to search the optimal order of the loads. It is very easy to get a radial network by this method, in addition, voltage constraints and capacity constraints can be considered in the searching progress instead of just being verified after solutions have been obtained.
Keywords:power distribution system reconfiguration  shortest path algorithm  genetic algorithm  global optimization  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号