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 = 10
combine3 = 1
candi_brch_bus = []; % candidate branch i added to bus j
% mpc0 = case417;
casei=4
d417_v2
substation_node = 1; n_bus = 417;
n1 = 3
n2 = 2
n1_down_substation = n1+1; n2_up_ending = n2;
Branch0 = Branch;
brch_idx_in_loop0 = unique(brch_idx_in_loop(:));
show_biograph1 = 0;
show_biograph = 0;
%% original network's power flow (not radial)
% show_biograph(Branch, Bus)
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('case417_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);
from_to0 = from_to;
mpc = generate_mpc(Bus, Branch, n_bus);
res_pf_dec = runpf(mpc, mpopt);
losses = get_losses(res_pf_dec.baseMVA, res_pf_dec.bus, res_pf_dec.branch);
loss0_dec = sum(real(losses)); %
fprintf('case417_tabu: radial network obtained by my core algorithm''s loss is %.5f \n\n', loss0_dec)
Branch_loss_record = [];
% record Branch and loss
Branch_loss_record.core.Branch = Branch;
Branch_loss_record.core.loss = loss0_dec;
%% prepare force open branches for tabu: branch_idx_focused
if get_brch_tabu_v2 == 1
[branch_idx_focused] = get_branch_idx_focused_for_tabu_v2( ...
from_to, Branch0, Branch, substation_node, brch_idx_in_loop0, n_bus, ...
n1_down_substation, n2_up_ending); % to answer reviewer 5-5's question
else
[branch_idx_focused] = get_branch_idx_focused_for_tabu( ...
from_to, Branch0, Branch, substation_node, brch_idx_in_loop0, n_bus, ...
n1_down_substation, n2_up_ending);
end
%% ------------------------ Tabu algorithm ------------------------%%
% run the core program for each upstream branch connected to the idx_force_open
% idx_considered = [35 69]
% for iter = idx_considered
for iter = 1:length(branch_idx_focused)
fprintf('iter=%d/%d\n', iter, length(branch_idx_focused));
Branch = Branch0;
Branch(branch_idx_focused(iter), :) = [];
ff0 = Branch(:, 1); ff = ff0;
tt0 = Branch(:, 2); tt = tt0;
brch_idx_in_loop = brch_idx_in_loop0;
idx_tmp = find(brch_idx_in_loop == branch_idx_focused(iter));
if isempty(idx_tmp)
else
brch_idx_in_loop(idx_tmp) = [];
brch_idx_in_loop(idx_tmp:end) = brch_idx_in_loop(idx_tmp:end)-1;
end
t1 = toc;
%%------------------- core algorithm in Tabu loop--------------------%%
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;