Towards Sustainable Energy-Efficient Communities Based on a Scheduling Algorithm

. 2019 Sep 14;19(18):3973. doi: 10.3390/s19183973

Algorithm 1 Demand Calculation Function (

DCF)

1:
$R W^{t}$ (renewable vector) = ${σ_{1}, \dots, σ_{24}}$
2:
$N = s i z e (A_{i})$
3:
Defining variables $t_{b e g}^{i}$ , $t_{e n d}^{i}$
4:
for ihour time to the total number of hours do
5:
if ihour doesn’t belongs to interval $[t_{b e g}^{i}, t_{e n d}^{i}]$ then
6:
$f D_{i}^{t}$ computation
7:
end if
8:
end for
9:
for iappliance 1 to size of appliances configuration $(A_{i})$ do
10:
${RW}^{t} = {RW}^{t} - - A_{i} (f D_{i}^{t}$ )
11:
end for
12:
$A_{i} (v D_{i}^{t}) = A_{i} (v D_{i}^{t}) - - A_{i} (f D_{i}^{t})$
13:
$A_{i} (D_{i}^{t} (D_{i}^{t} < 0)) = 0$
14:
$A_{i} (f D_{i}^{t}) = A_{i} (f D_{i}^{t}) - - A_{i} (f D_{i}^{t})$ Objective Function $F (A_{i}, {RW}^{t}, t_{s c h e d}^{i})$
Require:
$A_{i}$ configuration: $v D_{i}^{t}, f D_{i}^{t}, L_{i}, t_{b e g}^{i}, t_{e n d}^{i}$
Ensure:
$t_{b e g}^{i} < t_{e n d}^{i}$
15:
$HC$ initialisation (consume Hourly Energy)
16:
for iappliance 1 to size of appliance configuration do
17:
Set $t_{b e g}^{i}$
18:
Set $t_{e n d}^{i}$ based on $L_{i}$ and $t_{b e g}^{i}$
19:
for ihour time to the total number of hours do
20:
if ihour belongs to interval $[t_{b e g}^{i}, t_{e n d}^{i}]$ then
21:
$HC (i h o u r) \leftarrow HC (i h o u r) + A_{i} (v D_{i}^{t})$
22:
else
23:
$HC (i h o u r) \leftarrow HC (i h o u r) + A_{i} (f D_{i}^{t})$
24:
end if
25:
end for
26:
end for
27:
$RW^{t} s = {RW}^{t} - - {HC}^{t}$
28:
$RW^{t} s (RW^{t} s < 0) = 0$
29:
$D e m a n d e d_RW^{t} \leftarrow m i n (RW^{t}, HC^{t})$
30:
$R 1 = s u m (RW^{t} s)$ ; $R 2 = m a x (HC^{t})$
31:
$R e s u l t = s u m (R 1 + R 2)$
32:
return $R e s u l t, D e m a n d e d_RW^{t}, HC^{t} (t_{s c h e d}^{i})$