Unit-Commitment-FDP-Method/start.m at master · tomazin/Unit-Commitment-FDP-Method · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
% @author: Saeed Motedaveli

clc;

% Initialize Data
initializeData();

% Units Number
unitsNum = length(units(:, 1));

% Calculate Diffrent Combination of Units.
% for 4 units its like 1111, 1110, ...
UCM = unitCombination(unitsNum, units);

% In state 0 the combination of units is: 0110
startCombination = 12;
numOfTimes = 8;

% Sort Units by Full-Load Ave. Cost
sortedUnits = sortUnits(units);

% Final Result Matrix
result = zeros(length(UCM), 8);
resultCombination = zeros(length(UCM), 8);

IHR = units(:, 4);          % Incremental Heat Rate
NLC = units(:, 5);          % No-Load Cost
FC = fuel_cost;             % Fuel Cost
SUC = unit_status(:, 4);    % Start-Up Cost : Cold

% Calculate Fcost for time 0 to 1
load = load_pattern(1, 2);  % Power that load need it in first hour
for i = length(UCM): -1 : 1
    if UCM(i, 2) < load
        break;
    end

    % Save total Cost for stage 1
    result(i, 1) = calculateFcost(UCM, 1, 0, UCM(i, 1), 12, sortedUnits, load, IHR, FC, NLC, SUC);
    % Save minimum combination of Fcost for stage 1
    resultCombination(i, 1) = startCombination;
end

% Calculate Fcost for 1 to numOfTimes
for t = 2 : numOfTimes
    load = load_pattern(t, 2);   % Power that load need it

    for i = length(UCM): -1 : 1

        if UCM(i, 2) < load
            break;
        end

        minFcost = 0;
        minFcostCombination = 0;
        for j = 1 : length(UCM)
            if result(j, t-1) == 0
                continue;
            end

            Fcost = calculateFcost(UCM, t, t-1, UCM(i, 1), UCM(j, 1), sortedUnits, load, IHR, FC, NLC, SUC) + result(j, t-1);

            if minFcost == 0
                minFcost = Fcost;
                minFcostCombination = j-1;
            elseif minFcost > Fcost
                minFcost = Fcost;
                minFcostCombination = j-1;
            end

        end

        % Save total Cost
        result(i, t) = minFcost;
        % Save minimum combination of Fcost
        resultCombination(i, t) = minFcostCombination;

    end
end

% Print result
fprintf('####################### Minimum Total Cost of every Stage #######################\n\n');
fprintf('     Comb.');
for i = 1 : length(result(1, :))
    fprintf('\t%7.0f', i);
end
fprintf('\n---------------------------------------------------------------------------------\n');
for i = 1 : length(result)

    fprintf('  %d\t', UCM(i, 1));
    for k = 3 : length(UCM(1, :))
        fprintf('%d', UCM(i, k));
    end

    fprintf(' ');

    for j = 1 : length(result(1, :))
        fprintf('\t%7.0f', result(i, j));
    end

    fprintf('\n');
end

fprintf('\n\n\n####################### Minimum Combination to every Stage #######################\n\n');
fprintf('     Comb.');
for i = 1 : length(result(1, :))
    fprintf('\t%7.0f', i);
end
fprintf('\n---------------------------------------------------------------------------------\n');
for i = 1 : length(result)

    fprintf('  %d\t', UCM(i, 1));
    for k = 3 : length(UCM(1, :))
        fprintf('%d', UCM(i, k));
    end

    fprintf(' ');

    for j = 1 : length(result(1, :))
        fprintf('\t%7.0f', resultCombination(i, j));
    end

    fprintf('\n');
end


bestCombination = zeros(numOfTimes, 1);
for i = 1 : numOfTimes

    minOfFcost = 0;
    minCombination = 0;
    for j = length(result) : -1 : 1
        Fcost = result(j, i);
        if Fcost > 0
            if minOfFcost == 0
                minOfFcost = Fcost;
                minCombination = resultCombination(j, i);
            elseif minOfFcost > Fcost
                minOfFcost = Fcost;
                minCombination = resultCombination(j, i);
            end
        end
    end
    bestCombination(i) = minCombination;
end

fprintf('\n\n\n######################## Best Combination of every Stage ########################\n\n');
for i = 1 : length(result(1, :))
    fprintf('\t%-7s', [int2str(i-1), '->', int2str(i)]);
end
fprintf('\n---------------------------------------------------------------------------------\n');
for i = 1 : length(result(1, :))
    if i == length(result(1, :))
        fprintf('\t%-7s', [int2str(bestCombination(i)), '->', int2str(startCombination)]);
    else
        fprintf('\t%-7s', [int2str(bestCombination(i)), '->', int2str(bestCombination(i+1))]);
    end
end

fprintf('\n\n');