一种基于Minty算法的配电网随机动态重构方法

A Stochastic Dynamic Reconfiguration Method by Applying Minty Algorithm in Distribution Network

针对配电网动态重构过程中的分布式可再生能源出力不确定性、多时间段耦合问题,提出一种基于Minty算法和机会约束规划的随机动态重构方法。建立基于机会约束规划的配电网动态重构数学模型;对调度区间内每个时间段以网损最小为目标采用改进Minty算法进行精确的静态重构,以能量增加最小为目标,提出消减开关动作次数满足约束的两个规则,减少单个和所有开关动作次数,直到获得满足动作次数限值约束的最优或近似最优方案。IEEE 33节点的标准算例结果验证提出的动态重构算法的相对于已有算法的准确性。

For the uncertainties in the distributed renewable energy sources outputs and multi-time coupling problem in the dynamic reconfiguration process in the distribution net-works,this paper proposes a stochastic optimization method by applying Minty algorithm and the chance constrained programming.The chance constrained mathematical model of the dynamic reconfiguration is established.The modified Minty algorithm is applied to accom-plish static reconfiguration for each interval with minimal power losses in the schedule.T wo heuristic rules whose objective is to minimize energy increase are proposed.The operation times constraints of switches are reduced until the constraints are satisfied.The optimal or near optimal solution is obtained.The results of IEEE 33-bus demonstrate the accuracy over the existing optimization algorithms.