149文章解读与程序——SCI《Switch Opening and Exchange Method for Stochastic Distribution Network Recon》已提供下载资源-CSDN博客

本文链接：https://blog.csdn.net/LIANG674027206/article/details/141231615

👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆下载资源链接👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆👆

《《《《《《《《更多资源还请持续关注本专栏》》》》》》》

论文与完整源程序_电网论文源程序的博客-CSDN博客https://blog.csdn.net/liang674027206/category_12531414.html

电网论文源程序-CSDN博客电网论文源程序擅长文章解读,论文与完整源程序,等方面的知识,电网论文源程序关注python,机器学习,计算机视觉,深度学习,神经网络,数据挖掘领域.https://blog.csdn.net/LIANG674027206?type=download

关键词：配电网重构 SOE算法多时段随机重构

参考文档：《Switch Opening and Exchange Method for Stochastic Distribution Network Reconfiguration》完全复现

仿真平台：MATLAB+CPLEX/gurobi平台优势：代码具有一定的深度和创新性，注释清晰，非烂大街的代码，非常精品！主要内容：代码主要做的是一个通过配电网重构获取最优网络拓扑的问题，从而有效降低网损，提高经济效益，同时考虑了光伏和负荷的随机性，构建了多时段随机配电网重构模型，考虑到大型网络中计算较为耗时，采用一种基于开断和交换的SOE方法，已获得良好的径向拓扑，采用IEEE多个标准算例进行了测试，更加创新，而且求解的效果更好，结果和文献基本是一致，代码质量非常高

部分代码展示：

clear all, clc, close all
addpath('./code')
ver_num_reconfig_dec = 2
%% basic setting
tic
fprintf('decrease_reconfig_84_tabu.m \n')
warning('off')
addpath(pathdef)
mpopt = mpoption;
mpopt.out.all = 0; % do not print anything
mpopt.verbose = 0;
version_LODF = 0 % 1: use decrease_reconfig_algo_LODF.m
                                  % 0: use decrease_reconfig_algo.m
distancePara = 6

candi_brch_bus = []; % candidate branch i added to bus j
casei=4
d84_v2
substation_node = 84;        n_bus = 84;
combine3 = 0

n1 = 3
n2 = 2
n1_down_substation = n1+1;    n2_up_ending = n2;

Branch0 = Branch;
brch_idx_in_loop0 = unique(brch_idx_in_loop(:));

%% original network's power flow (not radial)
show_biograph1 = 0
show_biograph = 0
from_to = show_biograph_not_sorted(Branch, substation_node, show_biograph1); 
mpc = generate_mpc(Bus, Branch, n_bus);
res_orig = runpf(mpc, mpopt);
losses = get_losses(res_orig.baseMVA, res_orig.bus, res_orig.branch);
loss0 = sum(real(losses));
fprintf('case84_tabu: original loop network''s loss is %.5f \n\n', loss0)

% for each branch in a loop, 
% if open that branch does not cause isolation, check the two ending buses 
% of that branch for connectivity, realized by shortestpath or conncomp
% calculate the lowest loss increase, print out the sorted loss increase 
% open the branch with lowest loss increase
% stop criterion: number of buses - number of branches = 1

%% ------------------------ Core algorithm ------------------------%%
ff0 = Branch(:, 1);   ff = ff0;
tt0 = Branch(:, 2);   tt = tt0;
t1 = toc;
if version_LODF
    [Branch] = decrease_reconfig_algo_LODF(Bus, Branch, brch_idx_in_loop, ...
        ff0, tt0, substation_node, n_bus, loss0, distancePara); %%%  core algorithm
else
    [Branch] = decrease_reconfig_algo(Bus, Branch, brch_idx_in_loop, ff0, tt0, ...
        substation_node, n_bus, loss0); %%%  core algorithm
end
t2 = toc;
time_consumption.core = t2 - t1

% output of core algorithm
from_to = show_biograph_not_sorted(Branch(:, [1 2]), substation_node, ...
    show_biograph1); %%% show figure, take time
mpc = generate_mpc(Bus, Branch, n_bus);
t1 = toc;
res_pf_dec = runpf(mpc, mpopt);
t2 = toc;    
time_consumption.runpf = t2-t1;

losses = get_losses(res_pf_dec.baseMVA, res_pf_dec.bus, res_pf_dec.branch);
loss0_dec = sum(real(losses))  % loss = 
fprintf('case84_tabu: radial network obtained by my core algorithm''s loss is %.5f \n\n', ...
    loss0_dec);
yij_dec = generate_yij_from_Branch(Branch, Branch0);

效果展示：