最小费用流算法在配电网网络重构中的应用  

Application of Minimal Cost Flows Algorithm in Distribution Network Reconfiguration

作　　者：沙立华[1] 张步涵[1] 

机构地区：[1]华中科技大学电力工程系,湖北武汉430074

出　　处：《水电能源科学》2001年第2期43-45,共3页Water Resources and Power

摘　　要：将图论中的最小费用流算法用于求解配电网网络重构问题 ,寻求以电压损耗最小为目标的合理的开环运行方式 .验算表明 ,该算法简单、快速。This article describes a method based on the minimal cost flows algorithm of graphtheory which is applied to the distribution network reconfiguration. It can be expected to seek a dispatching mode of active power to reduce the voltage loss of the whole network and select a rational open loop mode of operation. Digital tests were carried out and the results show that the minimal cost flows algorithm is effective and the calculation speed is very fast.

关 键 词：网络重构 最小费用流 电压损耗 配电网 

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